{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:30:56Z","timestamp":1778851856298,"version":"3.51.4"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>BE-Tree is a novel dynamic data structure designed to efficiently index Boolean expressions over a high-dimensional discrete space. BE Tree-copes with both high-dimensionality and expressiveness of Boolean expressions by introducing an effective two-phase space-cutting technique that specifically utilizes the discrete and finite domain properties of the space. Furthermore, BE-Tree employs self-adjustment policies to dynamically adapt the tree as the workload changes. Moreover, in BE-Tree, we develop two novel cache-conscious predicate evaluation techniques, namely, lazy and bitmap evaluations, that also exploit the underlying discrete and finite space to substantially reduce BE-Tree's matching time by up to 75%<\/jats:p>\n          <jats:p>BE-Tree is a general index structure for matching Boolean expression which has a wide range of applications including (complex) event processing, publish\/subscribe matching, emerging applications in cospaces, profile matching for targeted web advertising, and approximate string matching. Finally, the superiority of BE-Tree is proven through a comprehensive evaluation with state-of-the-art index structures designed for matching Boolean expressions.<\/jats:p>","DOI":"10.1145\/2487259.2487260","type":"journal-article","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T14:32:49Z","timestamp":1372775569000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Analysis and optimization for boolean expression indexing"],"prefix":"10.1145","volume":"38","author":[{"given":"Mohammad","family":"Sadoghi","sequence":"first","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Arno","family":"Jacobsen","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,4]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462571.1462573"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301326"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807224"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of the 22th International Conference on Very Large Data Bases (VLDB'96)","author":"Berchtold S."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247620"},{"key":"e_1_2_2_8_1","volume-title":"Proceedings of the 23rd International Conference on Software Engineering (ICSE'01)","author":"Campailla A."},{"key":"e_1_2_2_9_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB'06)","author":"Candan K. S."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863975"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0077-6"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247521"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266894.1266929"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2442626.2442646"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375677"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2002259.2002284"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.25"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807171"},{"key":"e_1_2_2_22_1","volume-title":"Rete: A fast algorithm for the many pattern\/many object pattern match problem","author":"Forgy C. L.","year":"1990"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223796"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_2_2_25_1","volume-title":"Expert Systems: Principles and Programming.","author":"Giarratano J. C.","year":"1989"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_2_27_1","volume-title":"Proceedings of the 15th International Conference on Data Engineering. M. Kitsuregawa, M. P. Papazoglou, and C. Pu, Eds., IEEE, 266--275","author":"Hanson E. N."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98736"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88873-4_17"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1385989.1385999"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2005.40"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453906"},{"key":"e_1_2_2_33_1","article-title":"High performance publish-subscribe matching using parallel hardware","author":"Margara A.","year":"2013","journal-title":"IEEE Trans. Parallel Distrib Syst 99, PrePrints, 1."},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815933.1815935"},{"key":"e_1_2_2_35_1","volume-title":"Proceedings of the Conference of the Centre for Advanced Studies on Collaborative Research (CASCON'02)","author":"Rjaibi W."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213598.2213602"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951374"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989390"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.38"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921029"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995441.1995445"},{"key":"e_1_2_2_42_1","first-page":"623","article-title":"Clustering multidimensional extended objects to speed up execution of spatial queries. In Proceedings of the 9th International Conference on Extending Database Technology","volume":"2992","author":"Saita C.-A.","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_2_2_43_1","volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases (VLDB'87)","author":"Sellis T. K."},{"key":"e_1_2_2_44_1","volume-title":"Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCSW'02)","author":"Triantafillou P."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687633"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/176567.176573"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487259.2487260","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487259.2487260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:54Z","timestamp":1750235754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487259.2487260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1145\/2487259.2487260"],"URL":"https:\/\/doi.org\/10.1145\/2487259.2487260","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2012-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}