Query processing in main memory database management systems

Lehman, Tobin J.; Carey, Michael J.

doi:10.1145/16894.16878

Cited by 115 publications

(69 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This section summarizes related work on index structures. In particular, they are Linked List, AVL Tree [18], and T Tree [19]. Figure 2 shows the structure of a linked list.…”

Section: Motivationmentioning

confidence: 99%

“…The performance of this index structure is often poor when exact match queries or range queries occur. An AVL tree [18] is a self-balancing binary search tree, and it is said being height-balanced. The heights of any two child AVL subtrees of any node differ by at most one, as shown in Fig.…”

Section: Motivationmentioning

confidence: 99%

“…Some of the many MMDB designs are open source databases such as H2DB [1] and HSQLDB [2]. Although many excellent designs and research results using DB index designs have been proposed [5,17,18,19], few of them utilize the domain characteristics of many RFID applications and, at the same time, explore the "main-memory" characteristics of main-memory database systems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Signature-based Grid Index Design for RFID Main-Memory Databases

Liao

Suei

et al. 2008

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

A large-scaled RFID application often needs a highly efficient database system in data processing. This research is motivated by the strong demand of an efficient index structure design for main-memory database systems of RFID applications. In this paper, a signature-based grid index structure is proposed for efficient data queries and storage. An efficient methodology is proposed to locate duplicates and to execute batch deletions and range queries based on application domain knowhow. The capability of the design is implemented in an open source main-memory database system H2 and evaluated by realistic workloads of RFID applications.

show abstract

“…This section summarizes related work on index structures. In particular, they are Linked List, AVL Tree [18], and T Tree [19]. Figure 2 shows the structure of a linked list.…”

Section: Motivationmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Signature-based Grid Index Design for RFID Main-Memory Databases

Liao

Suei

et al. 2008

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

show abstract

“…The T-tree (Lehman & Carey, 1986) is an indexing structure developed for main memory databases where data is accessed via pointers rather than read from disk and where space efficiency is an important consideration. Services in our testbed maintain data in memory, and therefore the T-tree would appear to be an especially suitable structure.…”

Section: T-treementioning

confidence: 99%

Scalability of indexing structures in a production systems testbed for computational research

Moses

Gruenwald

2005

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…Coupling the use of large main memories and support for complex queries requires a new ap proach to physical database design and query optimization. One ap proach that is being currently investigated is to make the database memory resident [DK084,Gr85], and design a query optimizer that takes advantage of memory residency [AHK85,Bi86,LC86,Sh86].…”

Section: Introductionmentioning

confidence: 99%

Performance of complex queries in Main Memory Database Systems

Bitton

Hanrahan²,

Turbyfill

1987

1987 IEEE Third International Conference on Data Engineering

View full text Add to dashboard Cite

Memory residence can buy both functionality and performance for a database management system. In this paper, we present a description and a benchmark of an experimental implementation of a Main Memory Database System (MMDBS) that was designed to support complex interactive queries. We describe and evaluate the main mem ory database structures and query processing algorithms implemented in this prototype. Our measurements and analysis, focused on aggre gates and joins, include both memory requirements and response time, since there is a clear trade-off between space and time in the design of a MMDBS. In contrast to conventional Disk-based Database Systems (DDBS's), we found that an MMDBS can efficiently execute complex relational queries. We identify strategies that exploit memory residence effectively. We also identified a number of performance problems re lated to query optimization in main memory and memory management for MMDBS's. INTRODUCTIONTwo major factors are defining new directions of research in data base management systems. One is the availability of very large and in expensive main memories. In the last year alone, the size of memory boards has doubled, and over the past 20 years, the price of main memory has decreased by a factor of 100. The other factor is the de mand for increased functionality and performance, particularly from new types of applications. Traditionally, database systems were used in large business applications. Today, integrated office systems, engi neering applications and artificial intelligence also require database management support. The "wish-list" for this new type of database systems include the support of complex objects [SR86], time manage ment [LDE84] and more powerful query languages [BR86].While a new generation of database systems seems necessary to answer these needs, this generation will most likely try to build on and extend relational database systems, which are mature and successful.However, the profile of a "typical" query mix will include queries that may be far more complex and unexpected than the "debit-credit" benchmark transaction (An85]. In particular, complex relational que ries involving multiple joins and aggregates, ad hoc queries and recur sive queries must be efficiently supported. Coupling the use of large main memories and support for complex queries requires a new ap proach to physical database design and query optimization. One ap proach that is being currently investigated is to make the database memory resident [DK084, Gr85], and design a query optimizer that takes advantage of memory residency [AHK85, Bi86, LC86, Sh86].In this paper, we present an experimental performance study of a Main Memory Database System (MMDBS) prototype, which is the foundation of the Office-By-Example (OBE) system [Z182, WAB86,Wh85] developed at the IBM T. J. Watson Research Center. To our knowledge, this is the first benchmark of a MMDBS. We focus on three problems:1.How much more feasible are complex, ad hoc interactive queries on a MMDBS (than on disk based database...

show abstract

Query processing in main memory database management systems

Cited by 115 publications

References 0 publications

A Signature-based Grid Index Design for RFID Main-Memory Databases

A Signature-based Grid Index Design for RFID Main-Memory Databases

Scalability of indexing structures in a production systems testbed for computational research

Performance of complex queries in Main Memory Database Systems

Contact Info

Product

Resources

About