{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T08:50:03Z","timestamp":1714294203333},"reference-count":37,"publisher":"Elsevier","isbn-type":[{"value":"9780120884698","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1016\/b978-012088469-8.50056-5","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T09:12:29Z","timestamp":1257498749000},"page":"624-635","source":"Crossref","is-referenced-by-count":2,"title":["Efficiency-Quality Tradeoffs for Vector Score Aggregation"],"prefix":"10.1016","author":[{"given":"Pavan Kumar C.","family":"Singitham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahathi S.","family":"Mahabhashyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-012088469-8.50056-5_bib1","unstructured":"P.K. Agarwal, J. Erickson. Geometric Range Searching and Its Relatives. In CRC Handbook of Computational Geometry, 1997."},{"key":"10.1016\/B978-012088469-8.50056-5_bib2","series-title":"Proceedings of ACM SIGMOD","first-page":"322","article-title":"The R*-tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/B978-012088469-8.50056-5_bib3","series-title":"Proc. of the 22th VLDB Conference","article-title":"The x-tree: An index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/B978-012088469-8.50056-5_bib4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1137\/1037127","article-title":"Using Linear Algebra for Intelligent Information Retrieval","volume":"37","author":"Berry","year":"1995","journal-title":"SIAM Review"},{"key":"10.1016\/B978-012088469-8.50056-5_bib5","doi-asserted-by":"crossref","unstructured":"S. Bhatia, J. Deogun. Cluster characterization in Information retrieval. ACM-SAC 1993 Indiana USA, 721-727.","DOI":"10.1145\/162754.167178"},{"issue":"4","key":"10.1016\/B978-012088469-8.50056-5_bib6","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1006\/jcss.2002.1828","article-title":"Query strategies for priced information","volume":"64","author":"Charikar","year":"2002","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-012088469-8.50056-5_bib7","series-title":"IFIP 2.6 3rd Working Conference on Visual Database Systems (VDB-3)","article-title":"Querying multimedia data from multiple repositories by content: the Garlic project","author":"Cody","year":"1995"},{"key":"10.1016\/B978-012088469-8.50056-5_bib8","unstructured":"M.-J. Condorcet. Essai sur l'application de l'analyse a la probabilite des decisions rendues a la pluralite des voix, 1785."},{"key":"10.1016\/B978-012088469-8.50056-5_bib9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/B978-012088469-8.50056-5_bib10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","article-title":"Multidimensional Search Problems","volume":"5","author":"Dobkin","year":"1976","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/B978-012088469-8.50056-5_bib11","series-title":"Proceedings of WWW10","article-title":"Rank aggregation methods for the web","author":"Dwork","year":"2001"},{"key":"10.1016\/B978-012088469-8.50056-5_bib12","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/B978-012088469-8.50056-5_bib13","series-title":"37th Annual Symposium on Foundations of Computer Science","article-title":"Efficient Information Gathering on the Internet","author":"Etzioni","year":"1996"},{"issue":"1","key":"10.1016\/B978-012088469-8.50056-5_bib14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jcss.1998.1600","article-title":"Combining Fuzzy information from multiple systems","volume":"58","author":"Fagin","year":"1999","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-012088469-8.50056-5_bib15","first-page":"682","article-title":"Allowing users to weight search terms","author":"Fagin","year":"2000","journal-title":"RIAO (Recherche d'Informations Assistee par Ordinateur)"},{"key":"10.1016\/B978-012088469-8.50056-5_bib16","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(99)00224-8","article-title":"A formula for incorporating weights into scoring rules","volume":"239","author":"Fagin","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-012088469-8.50056-5_bib17","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(03)00026-6","article-title":"Optimal aggregation algorithms for middleware","volume":"66","author":"Fagin","year":"2003","journal-title":"J. Computer and System Sciences"},{"key":"10.1016\/B978-012088469-8.50056-5_bib18","series-title":"Proceedings of ACM SIGMOD","article-title":"Efficient similarity search and classification via rank aggregation","author":"Fagin","year":"2003"},{"key":"10.1016\/B978-012088469-8.50056-5_bib19","doi-asserted-by":"crossref","DOI":"10.1007\/BF00962238","article-title":"Efficient and Effective Querying by Image Content","author":"Faloutsos","year":"1994","journal-title":"Journal of Intelligent Information Systems"},{"key":"10.1016\/B978-012088469-8.50056-5_bib20","article-title":"Approximate Nearest Neighbor Searching in Multimedia Databases","author":"Ferhatosmanoglu","year":"2000"},{"key":"10.1016\/B978-012088469-8.50056-5_bib21","series-title":"Proceedings of ACM SIGMOD","first-page":"47","article-title":"R-trees: a dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/B978-012088469-8.50056-5_bib22","series-title":"Fast query search in large dimension database","author":"Hafner","year":"1998"},{"key":"10.1016\/B978-012088469-8.50056-5_bib23","series-title":"Proc. of 30th STOC","first-page":"604","article-title":"Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality","author":"Indyk","year":"1998"},{"key":"10.1016\/B978-012088469-8.50056-5_bib24","series-title":"Proceedings of ACM SIGMOD","article-title":"The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries","author":"Katayama","year":"1997"},{"key":"10.1016\/B978-012088469-8.50056-5_bib25","series-title":"Proc. 29th ACM Symposium on Theory of Computing","article-title":"Two algorithms for nearest-neighbor search in high dimensions","author":"Kleinberg","year":"1997"},{"issue":"4","key":"10.1016\/B978-012088469-8.50056-5_bib26","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","article-title":"The TV-tree: An Index Structure for High Dimensional Data","volume":"3","author":"Lin","year":"1992","journal-title":"VLDB Journal"},{"key":"10.1016\/B978-012088469-8.50056-5_bib27","series-title":"Proceedings of VLDB","article-title":"Optimized Query Execution in Large Search Engines with Global Page Ordering","author":"Long","year":"2003"},{"key":"10.1016\/B978-012088469-8.50056-5_bib28","author":"Luenberger","year":"1997"},{"key":"10.1016\/B978-012088469-8.50056-5_bib29","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","year":"1990","journal-title":"Journal of Algorithms"},{"key":"10.1016\/B978-012088469-8.50056-5_bib30","series-title":"The SMART Retrieval System\u2014Experiments in automatic document processing","author":"Salton","year":"1971"},{"key":"10.1016\/B978-012088469-8.50056-5_bib31","article-title":"The R+-Tree: A Dynamic Index For Multi-Dimensional Objects","author":"Sellis","year":"1987","journal-title":"VLDB Journal"},{"key":"10.1016\/B978-012088469-8.50056-5_bib32","series-title":"Proceedings of WWW conference","article-title":"Efficient cluster representation in similar document search","author":"Sitarama","year":"2004"},{"key":"10.1016\/B978-012088469-8.50056-5_bib33","author":"Witten","year":"1994","journal-title":"Managing Gigabytes: Compressing and Indexing Documents and Images"},{"key":"10.1016\/B978-012088469-8.50056-5_bib34","series-title":"Proceedings of the 12th Intl. Conf. on Data Engineering","article-title":"Similarity Indexing with the SS-tree","author":"White","year":"1996"},{"key":"10.1016\/B978-012088469-8.50056-5_bib35","series-title":"IEEE Internati onal Conference on Multimedia and Expo","article-title":"ClusterTree: Integration of Cluster Representation and Nearest Neighbor Search for Large Datasets with High Dimensionality","author":"Yu","year":"2000"},{"key":"10.1016\/B978-012088469-8.50056-5_bib36_1","unstructured":"Text Retrieval Conference series"},{"key":"10.1016\/B978-012088469-8.50056-5_bib37_1","unstructured":"Citeseer Scientific Digital Library"}],"container-title":["Proceedings 2004 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T17:42:43Z","timestamp":1558633363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780120884698500565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9780120884698"],"references-count":37,"URL":"https:\/\/doi.org\/10.1016\/b978-012088469-8.50056-5","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}