{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:31Z","timestamp":1725489271718},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374005"},{"type":"electronic","value":"9783642374012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37401-2_75","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T04:03:25Z","timestamp":1363925005000},"page":"782-793","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic Top-k Dominating Query over Sliding Windows"],"prefix":"10.1007","author":[{"given":"Xing","family":"Feng","sequence":"first","affiliation":[]},{"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"9","key":"75_CR2","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/TKDE.2010.78","volume":"22","author":"T. Bernecker","year":"2010","unstructured":"Bernecker, T., Kriegel, H.-P., Mamoulis, N., Renz, M., Z\u00fcfle, A.: Scalable probabilistic similarity ranking in uncertain databases. IEEE Trans. Knowl. Data Eng.\u00a022(9), 1234\u20131246 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"75_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-22351-8_3","volume-title":"Scientific and Statistical Database Management","author":"T. Bernecker","year":"2011","unstructured":"Bernecker, T., Kriegel, H.-P., Mamoulis, N., Renz, M., Zuefle, A.: Continuous inverse ranking queries in uncertain streams. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol.\u00a06809, pp. 37\u201354. Springer, Heidelberg (2011)"},{"key":"75_CR4","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421\u2013430 (2001)"},{"key":"75_CR5","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.N.: Sketching probabilistic data streams. In: Chan, C.Y., Ooi, B.C., Zhou, A. (eds.) SIGMOD Conference, pp. 281\u2013292. ACM (2007)","DOI":"10.1145\/1247480.1247513"},{"key":"75_CR6","unstructured":"Lange, K.: Numerical analysis for statisticians. Statistics and Computing (1999)"},{"key":"75_CR7","doi-asserted-by":"crossref","unstructured":"Lian, X., Chen, L.: Top-k dominating queries in uncertain databases. In: Kersten, M.L., Novikov, B., Teubner, J., Polutin, V., Manegold, S. (eds.) EDBT. ACM International Conference Proceeding Series, vol.\u00a0360, pp. 660\u2013671. ACM (2009)","DOI":"10.1145\/1516360.1516437"},{"key":"75_CR8","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD Conference, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"75_CR9","doi-asserted-by":"crossref","unstructured":"Shen, Z., Cheema, M.A., Lin, X., Zhang, W., Wang, H.: Efficiently monitoring top-k pairs over sliding windows. In: Kementsietsidis, A., Salles, M.A.V. (eds.) ICDE, pp. 798\u2013809. IEEE Computer Society (2012)","DOI":"10.1109\/ICDE.2012.89"},{"key":"75_CR10","unstructured":"Yiu, M.L., Mamoulis, N.: Efficient processing of top-k dominating queries on multi-dimensional data. In: VLDB, pp. 483\u2013494 (2007)"},{"key":"75_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: SIGMOD Conference, pp. 819\u2013832 (2008)","DOI":"10.1145\/1376616.1376698"},{"issue":"2","key":"75_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00778-009-0162-1","volume":"19","author":"W. Zhang","year":"2010","unstructured":"Zhang, W., Lin, X., Zhang, Y., Pei, J., Wang, W.: Threshold-based probabilistic top-k dominating queries. VLDB J.\u00a019(2), 283\u2013305 (2010)","journal-title":"VLDB J."},{"key":"75_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, W., Lin, X., Zhang, Y., Wang, W., Yu, J.X.: Probabilistic skyline operator over sliding windows. In: Ioannidis, Y.E., Lee, D.L., Ng, R.T. (eds.) ICDE, pp. 1060\u20131071. IEEE (2009)","DOI":"10.1109\/ICDE.2009.83"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37401-2_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T03:16:26Z","timestamp":1644635786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37401-2_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374005","9783642374012"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37401-2_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}