• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Query evaluation techniques for large databases (1993)

Cached

  • Download as a PDF

Download Links

  • [www.csd.uoc.gr]
  • [www.cs.berkeley.edu]
  • [dis.unal.edu.co]
  • [www.eecs.umich.edu]
  • [www.cs.duke.edu]
  • [www.cs.ubc.ca]
  • [www.cs.ubc.ca]
  • [www.cs.ubc.ca]
  • [www.cs.ubc.ca]
  • [cs.ubc.ca]
  • [www.cs.columbia.edu]
  • [www.ics.uci.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.csee.umbc.edu]
  • [www.cs.berkeley.edu]
  • [web.eecs.umich.edu]
  • [www.cs.duke.edu]
  • [bnrg.cs.berkeley.edu]
  • [courses.cs.washington.edu]
  • [www.cs.washington.edu]
  • [infolab.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Goetz Graefe
Venue:ACM COMPUTING SURVEYS
Citations:766 - 11 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Graefe93queryevaluation,
    author = {Goetz Graefe},
    title = {Query evaluation techniques for large databases},
    journal = {ACM COMPUTING SURVEYS},
    year = {1993},
    volume = {25},
    pages = {73--170}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On the contrary, modern data models exacerbate it: In order to manipulate large sets of complex objects as efficiently as today’s database systems manipulate simple records, query processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database management software. This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and post-relational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.

Keyphrases

evaluation technique    large database    large set    wide array    post-relational database system    modern data model    complex query evaluation plan    database management system    acceptable performance    query execution facility    iterative execution    practical query evaluation technique    simple record    parallel query execution    new database management system    efficient algorithm    database system    special operator    extensible database system    hash-based set    architectural issue    complex object    database application domain    large data volume    database management software    solid understanding    query processing algorithm   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University