{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:10:26Z","timestamp":1751285426322},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405105"},{"type":"electronic","value":"9783642405112"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40511-2_10","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T01:53:28Z","timestamp":1376877208000},"page":"134-148","source":"Crossref","is-referenced-by-count":17,"title":["Index Data Structure for Fast Subset and Superset Queries"],"prefix":"10.1007","author":[{"given":"Iztok","family":"Savnik","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1145\/235809.235810","volume":"43","author":"R. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R., Gonnet, G.: Fast text searching for regular expressions or automation searching on tries. Journal of ACM\u00a043(6), 915\u2013936 (1996)","journal-title":"Journal of ACM"},{"issue":"1-2","key":"10_CR2","first-page":"279","volume":"90","author":"A. Blurn","year":"1997","unstructured":"Blurn, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence\u00a090(1-2), 279\u2013298 (1997)","journal-title":"Artificial Intelligence"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45465-9_39","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Indyk, P., Panigrahy, R.: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 451\u2013462. Springer, Heidelberg (2002)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Doorenbos, R.: Combining left and right unlinking for matching a large number of learned rules. In: AAAI 1994, pp. 451\u2013458 (1994)","DOI":"10.21236\/ADA278979"},{"issue":"3","key":"10_CR5","first-page":"139","volume":"12","author":"P.A. Flach","year":"1999","unstructured":"Flach, P.A., Savnik, I.: Database dependency discovery: a machine learning approach. AI Communications\u00a012(3), 139\u2013160 (1999)","journal-title":"AI Communications"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"C. Forgy","year":"1982","unstructured":"Forgy, C., Rete: A fast algorithm for the many pattern\/many object pattern match problem. Artificial Intelligence\u00a019, 17\u201337 (1982)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s00778-003-0106-0","volume":"12","author":"S. Helmer","year":"2003","unstructured":"Helmer, S., Moerkotte, G.: A performance study of Four Index Structures for Set-Valued Attributes of Low Cardinality. The VLDB Journal - The International Journal on Very Large Data Bases\u00a012(3), 244\u2013261 (2003)","journal-title":"The VLDB Journal - The International Journal on Very Large Data Bases"},{"key":"10_CR8","unstructured":"Hoffmann, J., Koehler, J.: A New Method to Index and Query Sets. IJCAI (1999)"},{"key":"10_CR9","unstructured":"Mamoulis, N., Cheung, D.W., Lian, W.: Similarity Search in Sets and Categorical Data Using the Signature Tree. In: ICDE (2003)"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery Journal\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery Journal"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: An Introduction to Information Retrieval, Draft. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511809071"},{"issue":"2","key":"10_CR12","first-page":"1","volume":"28","author":"S. Melnik","year":"2003","unstructured":"Melnik, S., Garcia-Molina, H.: Adaptive Algorithms for Set Containment Joins. ACM Transactions on Database Systems\u00a028(2), 1\u201338 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Rivest, R.: Partial-Match Retrieval Algorithms. SIAM Journal on Computing\u00a05(1) (1976)","DOI":"10.1137\/0205003"},{"key":"10_CR14","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)"},{"key":"10_CR15","first-page":"174","volume-title":"Proc. of KDD 1993 Workshop: Knowledge Discovery from Databases","author":"I. Savnik","year":"1993","unstructured":"Savnik, I., Flach, P.A.: Bottom-up Induction of Functional Dependencies from Relations. In: Proc. of KDD 1993 Workshop: Knowledge Discovery from Databases, pp. 174\u2013185. AAAI Press, Washington (1993)"},{"key":"10_CR16","unstructured":"Savnik, I.: Efficient subset and superset queries. In: Local Proceedings and Materials of Doctoral Consortium of the Tenth International Baltic Conference on Databases and Information Systems (2012)"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/IDA-2000-43-403","volume":"4","author":"I. Savnik","year":"2000","unstructured":"Savnik, I., Flach, P.A.: Discovery of multivalued dependencies from relations. Intelligent Data Analysis Journal\u00a04, 195\u2013211 (2000)","journal-title":"Intelligent Data Analysis Journal"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Passas, S., Vassiliadis, P., Sellis, T.: A Combination of Trie-trees and Inverted Files for the Indexing of Set-valued Attributes. In: Proc. of ACM International Conference on Information and Knowledge Management (2006)","DOI":"10.1145\/1183614.1183718"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0306-4379(01)00047-3","volume":"27","author":"E. Tousidou","year":"2002","unstructured":"Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based Structures for Objects with Set-valued Attributes. Information Systems\u00a027, 93\u2013121 (2002)","journal-title":"Information Systems"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. ACM SIGMOD (2001)","DOI":"10.1145\/375663.375722"}],"container-title":["Lecture Notes in Computer Science","Availability, Reliability, and Security in Information Systems and HCI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40511-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:31:07Z","timestamp":1558031467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40511-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405105","9783642405112"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40511-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}