{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:32Z","timestamp":1750306952244,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"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":[[2013,6,22]]},"DOI":"10.1145\/2463676.2463682","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"1105-1108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Query processing on prefix trees live"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Kissinger","sequence":"first","affiliation":[{"name":"TU Dresden, Dresden, Germany"}]},{"given":"Benjamin","family":"Schlegel","sequence":"additional","affiliation":[{"name":"TU Dresden, Dresden, Germany"}]},{"given":"Dirk","family":"Habich","sequence":"additional","affiliation":[{"name":"TU Dresden, Dresden, Germany"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"TU Dresden, Dresden, Germany"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"DexterDB. http:\/\/wwwdb.inf.tu-dresden.de\/dexter.  DexterDB. http:\/\/wwwdb.inf.tu-dresden.de\/dexter."},{"key":"e_1_3_2_1_2_1","unstructured":"TPC-H. http:\/\/www.tpc.org\/tpch\/.  TPC-H. http:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_3_2_1_3_1","first-page":"227","volume-title":"BTW","author":"Bohm M.","year":"2011","unstructured":"M. Bohm , B. Schlegel , P. B. Volk , U. Fischer , D. Habich , and W. Lehner . Efficient In-Memory Indexing with Generalized Prefix Trees . In BTW , pages 227 -- 246 , 2011 . M. Bohm, B. Schlegel, P. B. Volk, U. Fischer, D. Habich, and W. Lehner. Efficient In-Memory Indexing with Generalized Prefix Trees. In BTW, pages 227--246, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409360.1409380"},{"key":"e_1_3_2_1_5_1","first-page":"225","volume-title":"CIDR","author":"Boncz P. A.","year":"2005","unstructured":"P. A. Boncz , M. Zukowski , and N. Nes . MonetDB\/X100: Hyper-Pipelining Query Execution . In CIDR , pages 225 -- 237 , 2005 . P. A. Boncz, M. Zukowski, and N. Nes. MonetDB\/X100: Hyper-Pipelining Query Execution. In CIDR, pages 225--237, 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.273032"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2236584.2236587"},{"key":"e_1_3_2_1_8_1","volume-title":"CIDR","author":"Kissinger T.","year":"2013","unstructured":"T. Kissinger , B. Schlegel , D. Habich , and W. Lehner . QPPT: Query Processing on Prefix Trees . CIDR , 2013 . T. Kissinger, B. Schlegel, D. Habich, and W. Lehner. QPPT: Query Processing on Prefix Trees. CIDR, 2013."},{"key":"e_1_3_2_1_9_1","volume-title":"Efficiently Compiling Efficient Query Plans for Modern Hardware. PVLDB, 4(9):539--550","author":"Neumann T.","year":"2011","unstructured":"T. Neumann . Efficiently Compiling Efficient Query Plans for Modern Hardware. PVLDB, 4(9):539--550 , 2011 . T. Neumann. Efficiently Compiling Efficient Query Plans for Modern Hardware. PVLDB, 4(9):539--550, 2011."},{"key":"e_1_3_2_1_10_1","unstructured":"P. O'Neil B. O'Neil and X. Chen. Star Schema Benchmark. http:\/\/www.cs.umb.edu\/~poneil\/StarSchemaB.PDF.  P. O'Neil B. O'Neil and X. Chen. Star Schema Benchmark. http:\/\/www.cs.umb.edu\/~poneil\/StarSchemaB.PDF."}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York USA","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2463682","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2463682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:01Z","timestamp":1750235941000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2463682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":10,"alternative-id":["10.1145\/2463676.2463682","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2463682","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}