Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data.

@inproceedings{DBLP:conf/vldb/OlstonW00,
  author    = {Chris Olston and
               Jennifer Widom},
  editor    = {Amr El Abbadi and
               Michael L. Brodie and
               Sharma Chakravarthy and
               Umeshwar Dayal and
               Nabil Kamel and
               Gunter Schlageter and
               Kyu-Young Whang},
  title     = {Offering a Precision-Performance Tradeoff for Aggregation Queries
               over Replicated Data},
  booktitle = {VLDB 2000, Proceedings of 26th International Conference on Very
               Large Data Bases, September 10-14, 2000, Cairo, Egypt},
  publisher = {Morgan Kaufmann},
  year      = {2000},
  isbn      = {1-55860-715-3},
  pages     = {144-155},
  ee        = {db/conf/vldb/OlstonW00.html},
  crossref  = {DBLP:conf/vldb/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

• Download PDF file (www.vldb.org, Darmstadt, Germany)
• Download PDF file (www.acm.org, New York, USA)

Printed Edition

References

[1]

Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne: On the Representation and Querying of Sets of Possible Worlds. SIGMOD Conference 1987: 34-48 BibTeX

[2]

Rafael Alonso, Daniel Barbará, Hector Garcia-Molina, Soraya Abad: Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems. EDBT 1988: 443-468 BibTeX

[3]

Daniel Barbará, Hector Garcia-Molina: The Demarcation Protocol: A Technique for Maintaining Linear Arithmetic Constraints in Distributed Database Systems. EDBT 1992: 373-388 BibTeX

[4]

Michael Benedikt, Leonid Libkin: Exact and Approximate Aggregation in Constraint Query. PODS 1999: 102-113 BibTeX

[5]

Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX

[6]

Alexander Brodsky, Yoram Kornatzky: The LyriC Language: Querying Constraint Objects. SIGMOD Conference 1995: 35-46 BibTeX

[7]

Alexander Brodsky, Victor E. Segal, Jia Chen, Pavel A. Exarkhopoulo: The CCUBE Constraint Object-Oriented Database System. SIGMOD Conference 1999: 577-579 BibTeX

[8]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0
BibTeX

[9]

Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom: Computing the median with uncertainty. STOC 2000: 602-607 BibTeX

[10]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[11]

Phillip B. Gibbons, Yossi Matias: New Sampling-Based Summary Statistics for Improving Approximate Query Answers. SIGMOD Conference 1998: 331-342 BibTeX

[12]

Jim Gray, Pat Helland, Patrick E. O'Neil, Dennis Shasha: The Dangers of Replication and a Solution. SIGMOD Conference 1996: 173-182 BibTeX

[13]

Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Konyala, Lloyd Noronha, Sashi Parthasarathy, J. B. Park, Albert Vernon: Scalable Trigger Processing. ICDE 1999: 266-275 BibTeX

[14]

Joseph M. Hellerstein, Ron Avnur, Andy Chou, Christian Hidber, Chris Olston, Vijayshankar Raman, Tali Roth, Peter J. Haas: Interactive data Analysis: The Control Project. IEEE Computer 32(8): 51-59(1999) BibTeX

[15]

Joseph M. Hellerstein, Peter J. Haas, Helen J. Wang: Online Aggregation. SIGMOD Conference 1997: 171-182 BibTeX

[16]

Yixiu Huang, Robert H. Sloan, Ouri Wolfson: Divergence Caching in Client Server Architectures. PDIS 1994: 131-139 BibTeX

[17]

Oscar H. Ibarra, Chul E. Kim: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. J. ACM 22(4): 463-468(1975) BibTeX

[18]

...

[19]

...

[20]

Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. PODS 1990: 299-313 BibTeX

[21]

Gabriel M. Kuper: Aggregation in Constraint Databases. PPCP 1993: 166-173 BibTeX

[22]

...

[23]

Felix Naumann, Ulf Leser, Johann Christoph Freytag: Quality-driven Integration of Heterogenous Information Systems. VLDB 1999: 447-458 BibTeX

[24]

...

[25]

Chris Olston, Allison Woodruff, Alexander Aiken, Michael Chu, Vuk Ercegovac, Mark Lin, Mybrid Spalding, Michael Stonebraker: DataSplash. SIGMOD Conference 1998: 550-552 BibTeX

[26]

Viswanath Poosala, Venkatesh Ganti: Fast Approximate Query Answering Using Precomputed Statistics. ICDE 1999: 252 BibTeX

[27]

Robert L. Read, Donald S. Fussell, Abraham Silberschatz: A Multi-Resolution Relational Data Model. VLDB 1992: 139-150 BibTeX

[28]

Elke A. Rundensteiner, Lubomir Bic: Aggregates in Possibilistic Databases. VLDB 1989: 287-295 BibTeX

[29]

Ouri Wolfson, Bo Xu, Sam Chamberlain, Liqin Jiang: Moving Objects Databases: Issues and Solutions. SSDBM 1998: 111-122 BibTeX

Referenced by

1. Bo Xu, Ouri Wolfson, Sam Chamberlain: Cost Based Data Dissemination in Broadcast Networks with Disconnection. ICDT 2001: 114-128