Proceedings of the sixteenth international conference on Very large databases
Proceedings of the sixteenth international conference on Very large databases
Parallel database systems: the future of database processing or a passing fad?
ACM SIGMOD Record - Directions for future database research & development
Database systems: achievements and opportunities
Communications of the ACM
ACM Transactions on Database Systems (TODS)
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallelism in relational data base systems: architectural issues and design approaches
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
An Efficient Hybrid Join Algorithm: A DB2 Prototype
Proceedings of the Seventh International Conference on Data Engineering
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Compensation-based on-line query processing
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Two techniques for on-line index modification in shared nothing parallel databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Efficient transaction support for dynamic information retrieval systems
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
A method for on-line reorganization of a database
IBM Systems Journal
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient resumption of interrupted warehouse loads
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On-line reorganization in object databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Towards self-tuning data placement in parallel database systems
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Safely and Efficiently Updating References During On-line Reorganization
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Repeating History Beyond ARIES
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Principles of Transaction-Based On-Line Reorganization
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
OODB Bulk Loading Revisited: The Partitioned-List Approach
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On the Analysis of On-Line Database Reorganization
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Group Updates for Red-Black Trees
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Technique for Upgrading Database Machines Online
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Relaxed multi-way trees with group updates
Journal of Computer and System Sciences - Special issu on PODS 2001
Transaction support for indexed summary views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Efficient bulk insertion into a distributed ordered table
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Concurrency control and recovery for multiversion database structures
Proceedings of the 2nd PhD workshop on Information and knowledge management
Transactions on the multiversion B+-tree
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Online reorganization of databases
ACM Computing Surveys (CSUR)
Asynchronous view maintenance for VLSD databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Concurrent updating transactions on versioned data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Feeding frenzy: selectively materializing users' event feeds
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
New algorithms for join and grouping operations
Computer Science - Research and Development
Foundations and Trends in Databases
Deferred maintenance of indexes and of materialized views
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Optimizing index deployment order for evolving OLAP
Proceedings of the 15th International Conference on Extending Database Technology
| Hi-index | 0.00 |
As relational DBMSs become more and more popular and as organizations grow, the sizes of individual tables are increasing dramatically. Unfortunately, current DBMSs do not allow updates to be performed on a table while an index (e.g., a B+-tree) is being built for that table, thereby decreasing the systems' availability. This paper describes two algorithms in order to relax this restriction. Our emphasis has been to maximize concurrency, minimize overheads and cover all aspects of the problem. Builds of both unique and nonunique indexes are handled correctly. We also describe techniques for making the index-build operations restartable, without loss of all work, in case a system failure were to interrupt the completion of the creation of the index. In this connection, we also present algorithms for making a long sort of operation restartable. These include algorithms for the sort and merge phases of sorting.