Corpus ID: 5317474

Database System Implementation

@inproceedings{GarciaMolina2000DatabaseSI,
  title={Database System Implementation},
  author={H. Garcia-Molina and J. Ullman and J. Widom},
  year={2000}
}
From the Publisher: Three well-known computer scientists at Stanford University-Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom-have written one of the most comprehensive books on database system implementation. Hector Garcia- Molina pioneered this book at Stanford as a second database systems course for computer science majors and industry-based professionals. It focuses on the implementation of database systems, including storage structures, query processing, and transaction… Expand
XML database engines
TLDR
Issues involved in implementing the query engine for a native XML database are focused on and the issues of data storage, indexing, and query evaluation are discussed in relation to existing XML database systems such as Lore, XSet, and QuiXote. Expand
Rakesh Malhotra Xml Database Engines (under the Direction of John A. Miller) All Rights Reserved Xml Database Engines
XML databases lie at the conjunction of two disparate themes and have to address issues related to both. On one hand there is the traditional database field of structured data, query languages,Expand
Integrating Pattern Mining in Relational Databases
TLDR
Virtual mining views are introduced, which can be queried as if they were traditional relational tables (or views) and every time the database system accesses one of these virtual mining views, a mining algorithm is triggered to materialize all tuples needed to answer the query. Expand
Introduction to physical database design
TLDR
The database life cycle shows steps that are needed in a methodical approach to database design from logical design to physical design that is based on maximizing the performance of the database under various workloads. Expand
Finite Cursor Machines in Database Query Processing
  • J. Bussche
  • Computer Science
  • Abstract State Machines
  • 2004
TLDR
A database system is often concerned with the processing of lists of tuples in a single scan, using constant amount of memory, and single-scan processing is a must. Expand
An AGENDA for testing relational database applications
Database systems play an important role in nearly every modern organization, yet relatively little research effort has focused on how to test them. This paper discusses issues arising in testingExpand
Materialized Sample Views for Database Approximation
TLDR
This paper presents experimental results that demonstrate the utility of the ACE tree and proposes a new file organization called the appendability, combinability, and exponentiality (ACE) tree that is suitable for organizing and indexing a sample view. Expand
Materialized Sample Views for Database Approximation
TLDR
This paper presents experimental results that demonstrate the utility of the ACE tree and proposes a new file organization called the appendability, combinability, and exponentiality (ACE) tree that is suitable for organizing and indexing a sample view. Expand
Supporting Efficient Parametric Search of E-Commerce Data: A Loosely-Coupled Solution
TLDR
SAL is described, a Search Assistant Layer that can be implemented outside a database engine to accommodate the urgent need for efficient parametric search on e-commerce data and results show that dramatic performance improvement is provided by SAL for search queries. Expand
Statistics on query expressions in relational database management systems
TLDR
This thesis shows how to modify query optimizers to exploit the additional statistical information provided by SITs without significantly increasing optimization time, and studies a spectrum of alternatives to create SITS, which balance efficiency of construction and accuracy of the resulting estimators. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
The preprocessor
2 Algebraic Laws for Improving Query Plans ............ 337 7
  • 2 Algebraic Laws for Improving Query Plans ............ 337 7
2 Choosing a Join Method
  • 2 Choosing a Join Method
2.2 Polygraphs and the Test for View-Serializability ..... 553 10.2.3 Testing for View-Seriali
  • 552 10.2.1 View Equivalence ....................... 552 101 Deadlock Detection by Timeout .............. 558 10.3.2 The Waits-For Graph .................... 559 10.3.3 Deadlock Prevention by Ordering Elements
307 6
  • 307 6
366 7.4.1 Estimating Sizes of Intermediate Relations
  • 367 7.4.2 Estimating the Size of a Projection ............. 368 7.4.3 Estimating the Size
421 8 Coping With System Failures 423
  • 421 8 Coping With System Failures 423
433 8.2.2 The Undo-Logging Rules
  • Log Records
451 8.4.1 The Undo/Redo Rules
  • 451 8.4.1 The Undo/Redo Rules
...
1
2
3
4
...