Search For:

Displaying 1-15 out of 15 total
The Bw-Tree: A B-tree for new hardware platforms
Found in: 2013 IEEE International Conference on Data Engineering (ICDE 2013)
By Justin J. Levandoski,David B. Lomet,Sudipta Sengupta
Issue Date:April 2013
pp. 302-313
The emergence of new hardware and platforms has led to reconsideration of how data management systems are designed. However, certain basic functions such as key indexed access to records remain essential. While we exploit the common architectural layering ...
 
Multi-table search for B-tree files
Found in: Proceedings of the 1979 ACM SIGMOD international conference on Management of data (SIGMOD '79)
By David B. Lomet
Issue Date:May 1979
pp. 35-42
A new method of organizing index entries in nodes of a B-tree is presented. The method is designed specifically to work with variable length keys. Thus it is particularly suited to take advantage of the variable length entries that result when key compress...
     
Improving Transaction-Time DBMS Performance and Functionality
Found in: Data Engineering, International Conference on
By David B. Lomet, Feifei Li
Issue Date:April 2009
pp. 581-591
Immortal DB is a transaction time database system that is built into a commercial database system rather than being layered on top. This enables it to have performance that is very close to the performance of an unversioned current time database system. Ac...
 
Guest Editorial Introduction to the Special Section on the 16th International Conference on Data Engineering
Found in: IEEE Transactions on Knowledge and Data Engineering
By David B. Lomet, Gerhard Weikum
Issue Date:January 2001
pp. 5-6
No summary available.
 
Adapting microsoft SQL server for cloud computing
Found in: Data Engineering, International Conference on
By Philip A. Bernstein,Istvan Cseri,Nishant Dani,Nigel Ellis,Ajay Kalhan,Gopal Kakivaya,David B. Lomet,Ramesh Manne,Lev Novik,Tomas Talius
Issue Date:April 2011
pp. 1255-1263
Cloud SQL Server is a relational database system designed to scale-out to cloud computing workloads. It uses Microsoft SQL Server as its core. To scale out, it uses a partitioned database on a shared-nothing system architecture. Transactions are constraine...
 
Measuring and Optimizing a System for Persistent Database Sessions
Found in: Data Engineering, International Conference on
By Roger S. Barga, David B. Lomet
Issue Date:April 2001
pp. 0021
Abstract: High availability for both data and applications is rapidly becoming a business requirement. While database systems support recovery, providing high database availability, applications may still lose work because of server outages. When a server ...
 
High speed on-line backup when using logical log operations
Found in: Proceedings of the 2000 ACM SIGMOD international conference on Management of data (SIGMOD '00)
By David B. Lomet
Issue Date:May 2000
pp. 245-253
Media recovery protects a database from failures of the stable medium by maintaining an extra copy of the database, called the backup, and a media recovery log. When a failure occurs, the database is “restored” from the backup, and the media re...
     
Phoenix: making applications robust
Found in: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (SIGMOD '99)
By David B. Lomet, Roger Barga
Issue Date:May 1999
pp. 358-367
This paper describes a tool, called Nodose, we have developed to expedite the creation of robust wrappers. Nodose allows non-programmers to build components that can convert data from the source format to XML or another generic format. Further, the generat...
     
MLR: a recovery method for multi-level systems
Found in: Proceedings of the 1992 ACM SIGMOD international conference on Management of data (SIGMOD '92)
By David B. Lomet
Issue Date:June 1992
pp. 328-340
To achieve high concurrency in a database system has meant building a system that copes well with important special cases. Recent work on multi-level systems suggest a systematic path to high concurrency. A multi-level system using locks permits restrictiv...
     
A simple bounded disorder file organization with good performance
Found in: ACM Transactions on Database Systems (TODS)
By David B. Lomet
Issue Date:March 1988
pp. 525-551
A bounded-disorder (BD) file is one in which data are organized into nodes that are indexed, e.g., by means of a B-tree. The data nodes are multibucket nodes that are accessed by hashing. In this paper we present two important improvements to the BD organi...
     
Partial expansions for file organizations with an index
Found in: ACM Transactions on Database Systems (TODS)
By David B. Lomet
Issue Date:March 1987
pp. 65-84
A new way to increase file space in dynamically growing files is introduced in which substantial improvement in file utilization can be achieved. It makes use of partial expansions in which, instead of doubling the space associated with some part of the fi...
     
A high performance, universal, key associative access method
Found in: Proceedings of the 1983 ACM SIGMOD international conference on Management of data (SIGMOD '83)
By David B. Lomet
Issue Date:May 1983
pp. 120-133
A new file organization is proposed that combines the advantages of digital B-trees and extendible hashing methods into one organization that can be used universally. The method, like these predecessors, relies on digital searching. The key notions are: (i...
     
Bounded index exponential hashing
Found in: ACM Transactions on Database Systems (TODS)
By David B. Lomet
Issue Date:March 1983
pp. 136-165
Bounded index exponential hashing, a new form of extendible hashing, is described. It has the important advantages over most of the other extendible hashing variants of both (i) providing random access to any record of a file in close to one disk access an...
     
Multi-level locking with deadlock avoidance
Found in: Proceedings of the 1978 annual conference - Volume 2 (ACM '78)
By David B. Lomet
Issue Date:January 1978
pp. 862-867
The existence of multiple levels of resources in data base systems presents a problem when resources must be shared among contending users. For example, some users may be interested in an entire file while others are only interested in one or a few records...
     
A practical deadlock avoidance algorithm for data base systems
Found in: Proceedings of the 1977 ACM SIGMOD international conference on Management of data (SIGMOD '77)
By David B. Lomet
Issue Date:August 1977
pp. 122-127
A new algorithm is presented for avoiding system deadlocks. Because its performance has little dependence on the number of lockable resources, it is particularly well suited to use in data base systems which may have millions of individually lockable recor...
     
 1