{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:29:19Z","timestamp":1755998959428,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"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":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3584372.3588663","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Indexing for Keyword Search with Structured Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7517-7252","authenticated-orcid":false,"given":"Shangqi","family":"Lu","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3883-5452","authenticated-orcid":false,"given":"Yufei","family":"Tao","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Chan","author":"Afshani Peyman","year":"2009","unstructured":"Peyman Afshani and Timothy M. Chan. 2009. Optimal halfspace range reporting in three dimensions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 180--186."},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Data Structure Lower Bounds for Document Indexing Problems","volume":"93","author":"Afshani Peyman","year":"2016","unstructured":"Peyman Afshani and Jesper Sindahl Nielsen. 2016. Data Structure Lower Bounds for Document Indexing Problems. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). 93:1--93:15.","journal-title":"Proceedings of International Colloquium on Automata, Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_3_1","volume-title":"Handbook of Discrete and Computational Geometry","author":"Agarwal Pankaj K.","unstructured":"Pankaj K. Agarwal. 2004. Range Searching. In Handbook of Discrete and Computational Geometry, 2nd Ed. Chapman and Hall\/CRC, 809--837.","edition":"2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994693"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274936"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00744-0"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871528"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187870"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 431--440","author":"Bhalotia Gaurav","key":"e_1_3_2_1_9_1","unstructured":"Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, and S. Sudarshan. 2002. Keyword Searching and Browsing in Databases using BANKS. In Proceedings of International Conference on Data Engineering (ICDE). 431--440."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of Annual Symposium on Combinatorial Pattern Matching (CPM). 10:1--10:19","author":"Bille Philip","year":"2021","unstructured":"Philip Bille, Inge Li Gortz, Max Rishoj Pedersen, and Teresa Anna Steiner. 2021. Gapped Indexing for Consecutive Occurrences. In Proceedings of Annual Symposium on Combinatorial Pattern Matching (CPM). 10:1--10:19."},{"key":"e_1_3_2_1_11_1","volume-title":"Fast Evaluation of Union-Intersection Expressions. In International Symposium on Algorithms and Computation (ISAAC). 739--750","author":"Bille Philip","year":"2007","unstructured":"Philip Bille, Anna Pagh, and Rasmus Pagh. 2007. Fast Evaluation of Union-Intersection Expressions. In International Symposium on Algorithms and Computation (ISAAC). 739--750."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13818-8_8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3116278.3116568"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101669"},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"An Almost Optimal Edit Distance Oracle","volume":"48","author":"Charalampopoulos Panagiotis","year":"2021","unstructured":"Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, and Oren Weimann. 2021. An Almost Optimal Edit Distance Oracle. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). 48:1--48:20.","journal-title":"Proceedings of International Colloquium on Automata, Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217026"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00248"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733040"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-019-00373-y"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142505"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00661-w"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1370949"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196979"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/77635.77639"},{"volume-title":"Proceedings of ACM Symposium on Principles of Database Systems (PODS). 247--260","author":"Eppstein David","key":"e_1_3_2_1_27_1","unstructured":"David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, and Manuel R. Torres. 2017. 2--3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. In Proceedings of ACM Symposium on Principles of Database Systems (PODS). 247--260."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2004.11920139"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 26--37","author":"Goldman Roy","year":"1998","unstructured":"Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, and Hector Garcia-Molina. 1998. Proximity Search in Databases. In Proceedings of Very Large Data Bases (VLDB). 26--37."},{"key":"e_1_3_2_1_31_1","volume-title":"Conditional Lower Bounds for Space\/Time Tradeoffs. In Algorithms and Data Structures Workshop (WADS). Springer, 421--436","author":"Goldstein Isaac","year":"2017","unstructured":"Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, and Ely Porat. 2017. Conditional Lower Bounds for Space\/Time Tradeoffs. In Algorithms and Data Structures Workshop (WADS). Springer, 421--436."},{"key":"e_1_3_2_1_32_1","volume-title":"On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. In International Symposium on Algorithms and Computation (ISAAC). 7:1--7:22","author":"Goldstein Isaac","year":"2019","unstructured":"Isaac Goldstein, Moshe Lewenstein, and Ely Porat. 2019. On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. In International Symposium on Algorithms and Computation (ISAAC). 7:1--7:22."},{"key":"e_1_3_2_1_33_1","volume-title":"Answering Spatial Multiple-Set Intersection Queries Using 2--3 Cuckoo Hash-Filters. CoRR","author":"Goodrich Michael T.","year":"2017","unstructured":"Michael T. Goodrich. 2017. Answering Spatial Multiple-Set Intersection Queries Using 2--3 Cuckoo Hash-Filters. CoRR , Vol. abs\/1708.09059 (2017)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDBM.2007.22"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983751"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 670--681","author":"Hristidis Vagelis","year":"2002","unstructured":"Vagelis Hristidis and Yannis Papakonstantinou. 2002. DISCOVER: Keyword Search in Relational Databases. In Proceedings of Very Large Data Bases (VLDB). 670--681."},{"volume-title":"Proceedings of International Conference on Database and Expert Systems Applications (DEXA). 360--374","author":"Huo Wenyu","key":"e_1_3_2_1_37_1","unstructured":"Wenyu Huo and Vassilis J. Tsotras. 2012. A Comparison of Top-k Temporal Keyword Querying over Versioned Text Collections. In Proceedings of International Conference on Database and Expert Systems Applications (DEXA). 360--374."},{"key":"e_1_3_2_1_38_1","volume-title":"Dynamic Set Intersection. In Algorithms and Data Structures Workshop (WADS). 470--481","author":"Kopelowitz Tsvi","year":"2015","unstructured":"Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2015. Dynamic Set Intersection. In Algorithms and Data Structures Workshop (WADS). 470--481."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch89"},{"key":"e_1_3_2_1_40_1","first-page":"1","article-title":"Towards Optimal Set-Disjointness and Set-Intersection Data Structures","volume":"168","author":"Kopelowitz Tsvi","year":"2020","unstructured":"Tsvi Kopelowitz and Virginia Vassilevska Williams. 2020. Towards Optimal Set-Disjointness and Set-Intersection Data Structures. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), Vol. 168. 74:1--74:16.","journal-title":"Proceedings of International Colloquium on Automata, Languages and Programming (ICALP)"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850588"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IDEAS.2000.880562"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293051"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90006-E"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902290"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.66"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_13"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0271-0"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.172"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2530060"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609562"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23"},"container-title":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:28Z","timestamp":1750178788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":53,"alternative-id":["10.1145\/3584372.3588663","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3588663","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}