{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:39:10Z","timestamp":1725550750005},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292449"},{"type":"electronic","value":"9783540316657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564126_54","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"527-535","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Processing of Ranked Queries with Sweeping Selection"],"prefix":"10.1007","author":[{"given":"Wen","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.P.: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In: SIGMOD 1998 (1998)","DOI":"10.1145\/276304.276318"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: ICDE 2001 (2001)","DOI":"10.1109\/ICDE.2001.914855"},{"key":"54_CR3","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 1990 (1990)","DOI":"10.1145\/93597.98741"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"Chang, Y.C., Bergman, L.D., Castelli, V., Li, C.S., Lo, M.L., Smith, J.R.: Onion Technique:Indexing for Linear Optimization Queries. In: SIGMOD 2000 (2000)","DOI":"10.1145\/342009.335433"},{"key":"54_CR5","unstructured":"Chaudhuri, S., Gravano, L.: Evaluating Top-k Selection Queries. In: VLDB 1999 (1999)"},{"key":"54_CR6","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C.E., et al.: Introduction to Algorithms. The MIT Press, Cambridge (2001)"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Fagin, R.: Fuzzy Queries in Multimedia Database Systems. In: PODS 1998 (1998)","DOI":"10.1145\/275487.275488"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Fagin., R., et al.: Optimal Aggregation Algorithms for Middleware. In: PODS 2001 (2001)","DOI":"10.1145\/375551.375567"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD 1984 (1984)","DOI":"10.1145\/602259.602266"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"Guha, S., et al.: Merging the Results of Approximate Match Operations. In: VLDB 2004 (2004)","DOI":"10.1016\/B978-012088469-8.50057-7"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries. In: SIGMOD 2001 (2001)","DOI":"10.1145\/375663.375690"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB J. 2004 (2004)","DOI":"10.1007\/s00778-003-0099-8"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Jin, W., Han, J.: Martin Ester Mining Thick Skylines over Large Databases. In: PKDD 2004 (2004)","DOI":"10.1007\/978-3-540-30116-5_25"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y.F., Fu, G., Seeger, B.: An Optimal and Progressive Algorithm for Skyline Queries. In: SIGMOD 2003 (2003)","DOI":"10.1145\/872757.872814"},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD 1995 (1995)","DOI":"10.1145\/223784.223794"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Tsaparas, P., et al.: Ranked Join Indices. In: ICDE 2003 (2003)","DOI":"10.1109\/ICDE.2003.1260799"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Wimmers, E.L., Haas, L.M., Roth, M.T., Braendli, C.: Using Fagin\u2019s Algorithm for Merging Ranked Results in Multimedia Middleware. In: CoopIS (1999)","DOI":"10.1109\/COOPIS.1999.792176"},{"key":"54_CR18","unstructured":"White, D.A., Jain, R.: Similarity Indexiug with the SS-tree. In: ICDE 1996 (1996)"},{"key":"54_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for large databases. In: SIGMOD 1996 (1996)","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:53:02Z","timestamp":1605642782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11564126_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}