• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Optimal Aggregation Algorithms for Middleware (2001)

Cached

  • Download as a PDF

Download Links

  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [www.almaden.ibm.com]
  • [www.almaden.ibm.com]
  • [www.cs.fiu.edu]
  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [www.almaden.ibm.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ronald Fagin , Amnon Lotem Y , Moni Naor Z
Venue:In PODS
Citations:431 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Fagin01optimalaggregation,
    author = {Ronald Fagin and Amnon Lotem Y and Moni Naor Z},
    title = {Optimal Aggregation Algorithms for Middleware},
    booktitle = {In PODS},
    year = {2001},
    pages = {102--113}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract: Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). There is some monotone aggregation function, orcombining rule, such as min or average, that combines the individual grades to obtain an overall grade. To determine the top k objects (that have the best overall grades), the naive algorithm must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm (“Fagin’s Algorithm”, or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably simple algorithm (“the threshold algorithm”, or TA) that is optimal in a much stronger sense than FA. We show that TA is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability worst-case sense, but over every database. Unlike FA, which requires large buffers (whose size may grow unboundedly as the database size grows), TA requires only a small, constant-size buffer. TA allows early stopping, which yields, in a precise sense, an approximate version of the top k answers.

Citations

2198 Fuzzy sets - Zadeh - 1965
1566 Randomized Algorithms - MOTWANI, RAGHAVAN - 1995
1095 Automatic text processing: The transformation, analysis, and retrieval of information by computer - Salton
682 Amortized efficiency of list update and paging rules - Sleator, Tarjan - 1985
549 R.: Online Computation and Competitive Analysis - Borodin, El-Yaniv - 1998
499 Approximation Algorithms for NP-hard Problems - Hochbaum, editor - 1997
479 QBIC project: querying images by content, using color, texture, and shape. Storage and Retrieval for Image and Video Databases - Niblack, Barber, et al. - 1993
318 Probabilistic computations: Towards a unified measure of complexity - Yao - 1977
296 Combining fuzzy information from multiple systems - Fagin - 1999
172 Evaluating top-k queries over web-accessible databases - Marian, Bruno, et al.
119 Optimizing multi-feature queries for image databases - Güntzer, Balke, et al.
95 Towards heterogeneous multimedia information systems: the Garlic approach - Carey, Haas, et al.
74 Optimizing Queries over Multimedia Repositories - Chaudhuri, Gravano - 1996
73 RxW: A Scheduling Approach for Large-Scale On-Demand Data Broadcast - Aksoy, Franklin - 1999
63 Query processing issues in image (multimedia) databases - Nepal, Ramakrishna - 1999
60 Supporting incremental join queries on ranked inputs - Natsev, Chang, et al. - 2001
51 Adaptive set intersections, unions, and differences - Demaine, Munro - 2000
49 Fuzzy set theory – and its - Zimmermann - 1996
46 Online Computation and Competitive Analysis Cambridge - Borodin, El-Yaniv - 1998
41 An optimal algorithm for Monte Carlo estimation - Dagum, Karp, et al. - 2000
36 Knowledge-based programs - Fagin, Halpern, et al. - 1997
31 Towards efficient multi-feature queries in heterogeneous environments - Güntzer, Balke, et al. - 2001
14 Using Fagin's algorithm for merging ranked results in multimedia middleware - Wimmers, Haas, et al. - 1999
13 One, two, three.., infinity: Lower bounds for parallel computation - FICH, HEIDE, et al. - 1985
1 Fuzzy Set Theory, 3rd Edition - Zimmermann - 1996
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University