Query evaluation techniques for large databases
G Graefe - ACM Computing Surveys (CSUR), 1993 - dl.acm.org
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 …
algorithms for accessing and manipulating large sets and sequences will be required to …
Version models for software configuration management
After more than 20 years of research and practice in software configuration management
(SCM), constructing consistent configurations of versioned software products still remains a …
(SCM), constructing consistent configurations of versioned software products still remains a …
[BOK][B] Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Transactional Information Systems is the long-awaited, comprehensive work from leading
scientists in the transaction processing field. Weikum and Vossen begin with a broad look at …
scientists in the transaction processing field. Weikum and Vossen begin with a broad look at …
Memory coherence in shared virtual memory systems
The memory coherence problem in designing and implementing a shared virtual memory on
loosely coupled multiprocessors is studied in depth. Two classes of algorithms, centralized …
loosely coupled multiprocessors is studied in depth. Two classes of algorithms, centralized …
[BOK][B] Building product models: computer environments, supporting design and construction
CM Eastman - 2018 - taylorfrancis.com
Building Product Models thoroughly presents the concepts, technology, and methods now
used to work out what will become the building product model-a new, digital representation …
used to work out what will become the building product model-a new, digital representation …
[PDF][PDF] Read-copy update: Using execution history to solve concurrency problems
PE McKenney, JD Slingwine - Parallel and Distributed Computing and …, 1998 - Citeseer
PE McKenney, Senior Member, IEEE, and JD Slingwine Abstract—The problems of
synchronization overhead, contention, and deadlock can pose serious challenges to those …
synchronization overhead, contention, and deadlock can pose serious challenges to those …
Weak consistency: a generalized theory and optimistic implementations for distributed transactions
A Adya - 1999 - dspace.mit.edu
Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed
Transactions Atul Adya Page 1 Weak Consistency: A Generalized Theory and Optimistic …
Transactions Atul Adya Page 1 Weak Consistency: A Generalized Theory and Optimistic …
An asymptotically optimal multiversion B-tree
B Becker, S Gschwind, T Ohler, B Seeger… - The VLDB Journal, 1996 - Springer
In a variety of applications, we need to keep track of the development of a data set over time.
For maintaining and querying these multiversion data efficiently, external storage structures …
For maintaining and querying these multiversion data efficiently, external storage structures …
[BOK][B] Computer-supported cooperative work
UM Borghoff, JH Schlichter, UM Borghoff, JH Schlichter - 2000 - Springer
Contemporary literature is overflowing with technical terms defining various aspects of
computer-supported cooperative work. In the following chapter, we will introduce these …
computer-supported cooperative work. In the following chapter, we will introduce these …
[BOK][B] Process-centered requirements engineering
K Pohl - 1997 - dl.acm.org
From the Publisher: This book presents frameworks, models, and tool environments for
process-centered requirements engineering. First, it gives a comprehensive overview of the …
process-centered requirements engineering. First, it gives a comprehensive overview of the …