{"id":"https://openalex.org/W2053495332","doi":"https://doi.org/10.1145/2487259.2487260","title":"Analysis and optimization for boolean expression indexing","display_name":"Analysis and optimization for boolean expression indexing","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2053495332","doi":"https://doi.org/10.1145/2487259.2487260","mag":"2053495332"},"language":"en","primary_location":{"id":"doi:10.1145/2487259.2487260","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2487259.2487260","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Database Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074420391","display_name":"Mohammad Sadoghi","orcid":"https://orcid.org/0000-0003-2779-6080"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad Sadoghi","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072791865","display_name":"Hans\u2010Arno Jacobsen","orcid":"https://orcid.org/0000-0003-0813-0101"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hans-Arno Jacobsen","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":3.1744,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92187408,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"2","first_page":"1","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8375972509384155},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.6017100811004639},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5960375666618347},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.5196287035942078},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5042654275894165},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4983224868774414},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47622328996658325},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4287532567977905},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42498964071273804},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4182940125465393},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.41647329926490784},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41330209374427795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37648385763168335},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.3402060270309448},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.29913240671157837},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.23013445734977722},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.19797924160957336},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16147860884666443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14442378282546997}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8375972509384155},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.6017100811004639},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5960375666618347},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.5196287035942078},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5042654275894165},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4983224868774414},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47622328996658325},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4287532567977905},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42498964071273804},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4182940125465393},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.41647329926490784},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41330209374427795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37648385763168335},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3402060270309448},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.29913240671157837},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.23013445734977722},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.19797924160957336},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16147860884666443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14442378282546997},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2487259.2487260","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2487259.2487260","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Database Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1511214424","https://openalex.org/W1539647992","https://openalex.org/W1545499123","https://openalex.org/W1546877152","https://openalex.org/W1568285589","https://openalex.org/W1964356327","https://openalex.org/W1965569186","https://openalex.org/W1968925642","https://openalex.org/W1971405342","https://openalex.org/W1974715273","https://openalex.org/W1987163291","https://openalex.org/W1996185014","https://openalex.org/W2008632807","https://openalex.org/W2013595415","https://openalex.org/W2017988065","https://openalex.org/W2020493833","https://openalex.org/W2024605621","https://openalex.org/W2037289266","https://openalex.org/W2054311069","https://openalex.org/W2061245817","https://openalex.org/W2062482216","https://openalex.org/W2064536014","https://openalex.org/W2066417879","https://openalex.org/W2067580069","https://openalex.org/W2073471108","https://openalex.org/W2098657005","https://openalex.org/W2099794518","https://openalex.org/W2102456137","https://openalex.org/W2102507352","https://openalex.org/W2105423800","https://openalex.org/W2106642566","https://openalex.org/W2115901333","https://openalex.org/W2116502002","https://openalex.org/W2116641234","https://openalex.org/W2116923784","https://openalex.org/W2118269922","https://openalex.org/W2120084971","https://openalex.org/W2123209312","https://openalex.org/W2131620262","https://openalex.org/W2135611729","https://openalex.org/W2146032463","https://openalex.org/W2151135734","https://openalex.org/W2151229814","https://openalex.org/W2153409778","https://openalex.org/W2238624099","https://openalex.org/W3158104671","https://openalex.org/W4233730851","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W3145288231","https://openalex.org/W2371263218","https://openalex.org/W1774017438","https://openalex.org/W2504957479","https://openalex.org/W1887794835","https://openalex.org/W2123199373","https://openalex.org/W1492858093","https://openalex.org/W2092552144","https://openalex.org/W3216580934","https://openalex.org/W1980331464"],"abstract_inverted_index":{"BE-Tree":[0,48,96,137],"is":[1,97,138],"a":[2,14,98,108,141],"novel":[3,67],"dynamic":[4],"data":[5],"structure":[6,101],"designed":[7,148],"to":[8,52,86,94],"efficiently":[9],"index":[10,100,146],"Boolean":[11,26,104,151],"expressions":[12,27],"over":[13],"high-dimensional":[15],"discrete":[16,39,82],"space.":[17,46],"BE":[18],"Tree-copes":[19],"with":[20,144],"both":[21],"high-dimensionality":[22],"and":[23,40,74,83,129],"expressiveness":[24],"of":[25,44,111,136],"by":[28,92],"introducing":[29],"an":[30],"effective":[31],"two-phase":[32],"space-cutting":[33],"technique":[34],"that":[35,77],"specifically":[36],"utilizes":[37],"the":[38,45,55,58,80,134],"finite":[41,84],"domain":[42],"properties":[43],"Furthermore,":[47],"employs":[49],"self-adjustment":[50],"policies":[51],"dynamically":[53],"adapt":[54],"tree":[56],"as":[57],"workload":[59],"changes.":[60],"Moreover,":[61],"in":[62,121],"BE-Tree,":[63],"we":[64],"develop":[65],"two":[66],"cache-conscious":[68],"predicate":[69],"evaluation":[70,143],"techniques,":[71],"namely,":[72],"lazy":[73],"bitmap":[75],"evaluations,":[76],"also":[78],"exploit":[79],"underlying":[81],"space":[85],"substantially":[87],"reduce":[88],"BE-Tree's":[89],"matching":[90,103,124,150],"time":[91],"up":[93],"75%":[95],"general":[99],"for":[102,125,149],"expression":[105],"which":[106],"has":[107],"wide":[109],"range":[110],"applications":[112,120],"including":[113],"(complex)":[114],"event":[115],"processing,":[116],"publish/subscribe":[117],"matching,":[118],"emerging":[119],"cospaces,":[122],"profile":[123],"targeted":[126],"web":[127],"advertising,":[128],"approximate":[130],"string":[131],"matching.":[132],"Finally,":[133],"superiority":[135],"proven":[139],"through":[140],"comprehensive":[142],"state-of-the-art":[145],"structures":[147],"expressions.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}