A database cache for high performance and fast restart in database systems
ACM Transactions on Database Systems (TODS)
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Elimination algorithms for data flow analysis
ACM Computing Surveys (CSUR)
ACM Transactions on Database Systems (TODS)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Implementing large production systems in a DBMS environment: concepts and algorithms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Algorithms (2nd ed.)
Solving implication problems in database applications
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Compiling complex database transition triggers
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
Rosolving conflicts in global storage design through replication
ACM Transactions on Database Systems (TODS)
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
The interpreted-compiled range of AI/DB systems
ACM SIGMOD Record
Principles of Database Systems
Principles of Database Systems
Database Design
Estimating block transfers and join sizes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Common expression analysis in database applications
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Multiple Query Processing in Deductive Databases using Query Graphs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Knowledge-based Integrity Constraint Validation
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
MOBY: An Architecture for Distributed Expert Database Systems
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
The use of controlled redundancy in self-adaptive databases (temporaries, derived, packrat, r-tree, texture analysis)
A predicate-based caching scheme for client-server database architectures
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
In this paper a new method to improve the utilization of main memory systems is presented. The new method is based on prestoring in main memory a number of query answers, each evaluated out of a single memory page. To this end, the ideas of page-answers and page-traces are formally described and their properties analyzed. The query model used here allows for selection, projection, join, recursive queries as well as arbitrary combinations. We also show how to apply the approach under update traffic. This concept is especially useful in managing the main memories of an important class of applications. This class includes the evaluation of triggers and alerters, performance improvement of rule-based systems, integrity constraint checking, and materialized views. These applications are characterized by the existence at compile time of a predetermined set of queries, by a slow but persistent update traffic, and by their need to repetitively reevaluate the query set. The new approach represents a new type of intelligent database caching, which contrasts with traditional caching primarily in that the cache elements are derived data and as a consequence, they overlap arbitrarily and do not have a fixed length. The contents of the main memory cache are selected based on the data distribution within the database, the set of fixed queries to preprocess, and the paging characteristics. Page-answers and page-traces are used as the smallest indivisible units in the cache. An efficient heuristic to select a near optimal set of page-answers and page-traces to populate the main memory has been developed, implemented, and tested. Finally, quantitative measurements of performance benefits are reported.