{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:16Z","timestamp":1750307356509,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,11]],"date-time":"2011-07-11T00:00:00Z","timestamp":1310342400000},"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":[[2011,7,11]]},"DOI":"10.1145\/2002259.2002296","type":"proceedings-article","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T12:25:09Z","timestamp":1310732709000},"page":"279-290","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Complex pattern ranking (CPR)"],"prefix":"10.1145","author":[{"given":"Xinxin","family":"Wang","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junehwa","family":"Song","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376634"},{"key":"e_1_3_2_1_2_1","volume-title":"K *: A directed on-the-fly algorithm for finding the k shortest paths. Technical report","author":"Aljazzar H.","year":"2008","unstructured":"H. Aljazzar and S. Leue . K *: A directed on-the-fly algorithm for finding the k shortest paths. Technical report , Univ. of Konstanz , 2008 . H. Aljazzar and S. Leue. K *: A directed on-the-fly algorithm for finding the k shortest paths. Technical report, Univ. of Konstanz, 2008."},{"key":"e_1_3_2_1_3_1","first-page":"475","volume-title":"VLDB","author":"Bast H.","year":"2006","unstructured":"H. Bast , D. Majumdar , R. Schenkel , M. Theobald , and G. Weikum . Io-top-k: Index-access optimized top-k query processing . In VLDB , pages 475 -- 486 , 2006 . H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum. Io-top-k: Index-access optimized top-k query processing. In VLDB, pages 475--486, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564727"},{"key":"e_1_3_2_1_5_1","volume-title":"VLDB","author":"Das G.","year":"2007","unstructured":"G. Das , D. Gunopulos , N. Koudas , and N. Sarkas . Ad-hoc top-k query answering for data streams . In VLDB , 2007 . G. Das, D. Gunopulos, N. Koudas, and N. Sarkas. Ad-hoc top-k query answering for data streams. In VLDB, 2007."},{"key":"e_1_3_2_1_6_1","volume-title":"A new implementation of yen's ranking loopless paths algorithm. 4OR","author":"de Queiros Vieira Martins E.","year":"2000","unstructured":"E. de Queiros Vieira Martins , E. Queir , V. Martins , M. Margarida ,and M. M. B. Pascoal . A new implementation of yen's ranking loopless paths algorithm. 4OR , 2000 . E. de Queiros Vieira Martins, E. Queir, V. Martins, M. Margarida,and M. M. B. Pascoal. A new implementation of yen's ranking loopless paths algorithm. 4OR, 2000."},{"key":"e_1_3_2_1_7_1","volume-title":"CIDR","author":"Demers A.","year":"2007","unstructured":"A. Demers , J. Gehrke , and P. Biswanath . Cayuga: A general purpose event monitoring system . In CIDR , 2007 . A. Demers, J. Gehrke, and P. Biswanath. Cayuga: A general purpose event monitoring system. In CIDR, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365697"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375677"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237715"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/565117.565143"},{"key":"e_1_3_2_1_12_1","first-page":"622","volume-title":"ITCC","author":"G\u00fctzer U.","year":"2001","unstructured":"U. G\u00fctzer , W.-T. Balke , and W. Kie\u00dfing . Towards efficient multi-feature queries in heterogeneous environments . In ITCC , pages 622 -- 628 , 2001 . U. G\u00fctzer, W.-T. Balke, and W. Kie\u00dfing. Towards efficient multi-feature queries in heterogeneous environments. In ITCC, pages 622--628, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646064"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871502"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764149.1764163"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2008.60"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_3_2_1_19_1","volume-title":"An efficient algorithm for k shortest simple paths. Networks, page 411","author":"M. H.","year":"1982","unstructured":"M. H. Katoh N, Lbaraki T. An efficient algorithm for k shortest simple paths. Networks, page 411 , 1982 . M. H. Katoh N, Lbaraki T. An efficient algorithm for k shortest simple paths. Networks, page 411, 1982."},{"key":"e_1_3_2_1_20_1","volume-title":"Management science, page 401","author":"Lawler E.","year":"1972","unstructured":"E. Lawler . A procedure for computing the k best solutions to discrete optimisation problems and its application to the shortest path problem. Management science, page 401 , 1972 . E. Lawler. A procedure for computing the k best solutions to discrete optimisation problems and its application to the shortest path problem. Management science, page 401, 1972."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2007.35"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/846218.847271"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807187"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206049.1206054"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142520"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920875"}],"event":{"name":"DEBS '11: The 5th ACM International Conference on Distributed Event-based system","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"New York New York USA","acronym":"DEBS '11"},"container-title":["Proceedings of the 5th ACM international conference on Distributed event-based system"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2002259.2002296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2002259.2002296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:20Z","timestamp":1750245740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2002259.2002296"}},"subtitle":["evaluating top-k pattern queries over event streams"],"short-title":[],"issued":{"date-parts":[[2011,7,11]]},"references-count":26,"alternative-id":["10.1145\/2002259.2002296","10.1145\/2002259"],"URL":"https:\/\/doi.org\/10.1145\/2002259.2002296","relation":{},"subject":[],"published":{"date-parts":[[2011,7,11]]},"assertion":[{"value":"2011-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}