{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T12:07:48Z","timestamp":1747397268973,"version":"3.40.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T00:00:00Z","timestamp":1356652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00778-012-0303-9","type":"journal-article","created":{"date-parts":[[2012,12,27]],"date-time":"2012-12-27T05:36:09Z","timestamp":1356586569000},"page":"519-542","source":"Crossref","is-referenced-by-count":4,"title":["Top-k queries over web applications"],"prefix":"10.1007","volume":"22","author":[{"given":"Daniel","family":"Deutch","sequence":"first","affiliation":[]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[]},{"given":"Neoklis","family":"Polyzotis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,28]]},"reference":[{"key":"303_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Senellart, P.: Querying and updating probabilistic information in xml. In: Proceedings of EDBT (2006)","DOI":"10.1007\/11687238_62"},{"key":"303_CR2","unstructured":"Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for top-k queries. In: Proceedings of VLDB (2007)"},{"key":"303_CR3","unstructured":"Bast, H., Majumdar, D., Schenkel, R., Theobald, M., Weikum, G.: Io-top-k: index-access optimized top-k query processing. In: Proceedings of VLDB (2006)"},{"key":"303_CR4","unstructured":"Beeri, C., Eyal, A., Kamenkovich, S., Milo, T.: Querying business processes. In: Proceedings of VLDB (2006)"},{"issue":"1","key":"303_CR5","first-page":"770","volume":"3","author":"M Benedikt","year":"2010","unstructured":"Benedikt, M., Kharlamov, E., Olteanu, D., Senellart, P.: Probabilistic xml via markov chains. PVLDB 3(1), 770\u2013781 (2010)","journal-title":"PVLDB"},{"key":"303_CR6","unstructured":"Business Process Execution Language for Web Services. http:\/\/www.ibm.com\/developerworks\/library\/ws-bpel\/"},{"key":"303_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, S., Kimelfeld, B.: Querying parse trees of stochastic context-free grammars. In: ICDT, pp. 62\u201375 (2010)","DOI":"10.1145\/1804669.1804680"},{"key":"303_CR8","doi-asserted-by":"crossref","unstructured":"Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. In: Proceedings of VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50076-0"},{"key":"303_CR9","doi-asserted-by":"crossref","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of a*. J, ACM 32(3) (1985)","DOI":"10.1145\/3828.3830"},{"key":"303_CR10","doi-asserted-by":"crossref","unstructured":"Deutch, D., Milo, T.: Type inference and type checking for queries on execution traces. In: Proceedings of VLDB (2008)","DOI":"10.14778\/1453856.1453898"},{"key":"303_CR11","doi-asserted-by":"crossref","unstructured":"Deutch, D., Milo, T.: Evaluating top-k queries over business processes. In: ICDE, pp. 1195\u20131198 (2009)","DOI":"10.1109\/ICDE.2009.199"},{"key":"303_CR12","doi-asserted-by":"crossref","unstructured":"Deutch, D., Milo, T.: Top-k projection queries for probabilistic business processes. In: Proceedings of ICDT (2009)","DOI":"10.1145\/1514894.1514923"},{"key":"303_CR13","doi-asserted-by":"crossref","unstructured":"Deutch, D., Milo, T., Polyzotis, N., Yam, T.: Optimal top-k query evaluation for weighted business processes. PVLDB 3(1), 940\u2013951 (2010)","DOI":"10.14778\/1920841.1920960"},{"key":"303_CR14","doi-asserted-by":"crossref","unstructured":"Deutch, D., Milo, T., Yam, T.: Goal-oriented web-site navigation for on-line shoppers (demonstration). PVLDB 2(2) (2009)","DOI":"10.14778\/1687553.1687613"},{"key":"303_CR15","doi-asserted-by":"crossref","unstructured":"Ding, B., Xu Yu, J., Wang, S., Qin, L., Zhang, X, Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp. 836\u2013845 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"303_CR16","unstructured":"Ebay. http:\/\/www.ebay.com\/"},{"key":"303_CR17","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Finding the $$k$$ shortest paths. In: Proceedings of 35th Symposium Foundations of Computer Science. IEEE, pp. 154\u2013165 (1994)","DOI":"10.1109\/SFCS.1994.365697"},{"key":"303_CR18","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Algorithmic verification of recursive probabilistic state machines. In: Proceedings of TACAS (2005)","DOI":"10.1007\/978-3-540-31980-1_17"},{"key":"303_CR19","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations. JACM 56(1) (2009)","DOI":"10.1145\/1462153.1462154"},{"key":"303_CR20","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top-k lists. In: Proceedings of SODA (2003)","DOI":"10.1137\/S0895480102412856"},{"key":"303_CR21","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4) (2003)","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"303_CR22","unstructured":"Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Proceedings of IJCAI (1999)"},{"key":"303_CR23","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)","DOI":"10.1145\/1391729.1391730"},{"key":"303_CR24","volume-title":"Estimating Software Costs","author":"T Jones","year":"2007","unstructured":"Jones, T.: Estimating Software Costs. McGraw-Hill, New York (2007)"},{"key":"303_CR25","volume-title":"Finite Markov Chains","author":"JG Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Berlin (1976)"},{"key":"303_CR26","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In: Proceedings of PODS, pp. 173\u2013182 (2006)","DOI":"10.1145\/1142351.1142377"},{"key":"303_CR27","unstructured":"Kimelfeld, B., Sagiv, Y.: Matching twigs in probabilistic xml. In: Proceedings of VLDB (2007)"},{"key":"303_CR28","doi-asserted-by":"crossref","unstructured":"Klein, D., Manning, C.D.: Accurate unlexicalized parsing. In: ACL (2003)","DOI":"10.3115\/1075096.1075150"},{"key":"303_CR29","doi-asserted-by":"crossref","unstructured":"Koudas, N., Srivastava, D.: Data stream query processing: a tutorial. In: Proceedings of VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50128-2"},{"key":"303_CR30","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0885-2308(90)90022-X","volume":"4","author":"K Lary","year":"1990","unstructured":"Lary, K., Young, S.J.: The estimation of stochastic context-free grammars using the inside-outside algrithm. Comput. Speech Lang. 4, 35\u201356 (1990)","journal-title":"Comput. Speech Lang."},{"key":"303_CR31","doi-asserted-by":"crossref","unstructured":"Nevsetvril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism. Eur. J. Comb. 27(6) (2006)","DOI":"10.1016\/j.ejc.2005.01.010"},{"key":"303_CR32","doi-asserted-by":"crossref","unstructured":"Oates, T., Doshi, S., Huang, F.: Estimating maximum likelihood parameters for stochastic context-free graph grammars. In: Proceedings of ILP (2003)","DOI":"10.1007\/978-3-540-39917-9_19"},{"key":"303_CR33","doi-asserted-by":"crossref","unstructured":"Pirolli, P.L.T., Pitkow, J.E.: Distributions of surfers\u2019 paths through the world wide web: empirical characterizations. World Wide Web 2(1\u20132) (1999)","DOI":"10.1023\/A:1019288403823"},{"key":"303_CR34","doi-asserted-by":"crossref","unstructured":"Re, C., Dalvi, N.N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: Proceedings of ICDE (2007)","DOI":"10.1109\/ICDE.2007.367934"},{"key":"303_CR35","doi-asserted-by":"crossref","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5 (1975)","DOI":"10.1002\/net.1975.5.3.237"},{"key":"303_CR36","unstructured":"Sanghai, S., Domingos, P., Weld, D.: Dynamic probabilistic relational models. In: Proceedings of IJCAI (2003)"},{"key":"303_CR37","unstructured":"Yahoo! shopping. http:\/\/shopping.yahoo.com\/"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0303-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-012-0303-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0303-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T15:08:39Z","timestamp":1745939319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-012-0303-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,28]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s00778-012-0303-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2012,12,28]]}}}