The hBn-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation * (2009)
Georgios Evangelidis, David Lomet, Betty Salzberg
We describe a new access method, the hB”-tree, an adaptation of the hB-tree index to the constraints of the II-tree. The II-trees, a generalization of the Blink-trees, provide high concurrency with...
The Performance of the hB-pi Tree (2009)
The hB-pi tree is a multi-attribute index method which combines the hB tree, a multi-attribute access structure and the II-tree, an abstract index with efficient concurrency and recovery methods. The...
A Survey, Online Reorganization, Ibm Products, H. Sockut, Balakrishna R. Iyer, Lucien Dimino, ...
The Bulletin of the Technical Committee on Data Engineering is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and...
Xiaowei Sun, Rui Wang, Betty Salzberg
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such merging be done online,...
List of Supported Students and Staff (2008)
Betty Salzberg, Betty Salzberg, Xiaowei Sun, Yu Chen, Ph. D. Students
Project Award Information
– Limited memory (logarithmic) – Any-time (2008)
M. Faloutsos, Christos Faloutsos (cmu, Michalis Faloutsos (ucr, M. Faloutsos, ...
• Single-link traffic characterization – AWSOM (patterns in a single sequence) – SELFIS (Long-range dependencies) • Topology and virus propagation • (Traffic matrix)
Abstract Access Method Concurrency with Recovery (2008)
Providing high concurrency in B+-trees has been studied extensively. But few efforts have been doc-umented for combining concurrency methods with a recovery scheme that preserves well-formed trees...
ABSTRACT Online Event-driven Subsequence Matching over Financial Data Streams (2008)
Huanmei Wu, Betty Salzberg, Donghui Zhang
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online subsequence...
INSTITUTE OF PHYSICS PUBLISHING PHYSICS IN MEDICINE AND BIOLOGY (2008)
Huanmei Wu, Gregory C Sharp, Betty Salzberg, David Kaeli, Hiroki Shirato, Steve B Jiang
A finite state model for respiratory motion analysis in
Masaru Kitsuregawa, Betty Salzberg, Gonzalo Navarro, Ricardo Baeza-yates, Erkki Sutinen, Jorma Tarhio, ...
IntegratingDiverseInformationManagementSystems:ABriefSurvey..................................
On-Line Reorganization: A Position Paper (2008)
Betty Salzberg, Chendong Zou, Rivka Ladin
Introduction On-line reorganization is and will be a major problem for transaction systems of the 1990s and the 2000s. Mainframes are rapidly being replaced by workstation farms. Most large software...
Ron Fryer, Eugene Ding, Lucien Dimino, Ganesan Gopal, T. K. Rengarajan, David B. Lomet, ...
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters,...
Server-initiated Document, Dissemination Www, Azer Bestavros, Carlos Cunha, David B. Lomet, Michael Franklin, ...
Engineering is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology....
On-Line Reorganization: A Position Paper (2007)
Betty Salzberg And, Betty Salzberg, Chendong Zou, Rivka Ladin
Introduction On-line reorganization is and will be a major problem for transaction systems of the 1990s and the 2000s. Mainframes are rapidly being replaced by workstation farms. Most large software...
Dynamic Hierarchical Clustering (2007)
Chendong Zou And, Chendong Zou, Betty Salzberg, Rivka Ladin
We describe a new method for dynamically clustering hierarchical data which maintains good clustering in the presence of insertions and deletions. This method, which we call Enc, encodes the...
The BT-Forest: A Branched and Temporal Access Method (2007)
Betty Salzberg, David Lomet, Manuel Barrena, L. Jiang, Linan Jiang
We combine the ideas of time-varying data and branching versions to produce a new (paginated) access method, the BT-Forest. It is fully persistent in that it captures all the past states of a B +...
This Work, Georgios Evangelidis, Georgios Evangelidis, David Lomet, David Lomet, Betty Salzberg, ...
We describe a new access method, the hB P -tree, an adaptation of the Lomet and Salzberg hB-tree index to the constraints of their P-tree . The P-trees, a generalization of the B link -trees of...
March Vol No, P. M. Deshp, J. F. Naughton, K. Ramasamy, A. Shukla, K. Tufte, ...
"OLAP" or multi-dimensional analysis workloads present a number of interesting challenges and opportunities for database developers and researchers. While the OLAP goal of extremely fast...
September Vol No, Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, Interactive Spatial, Directories Brian, ...
This paper describes the design of an object-oriented geographic information system called GODOT (Geographic Data Management With Object-Oriented Techniques). GODOT has a four-layer architecture,...
September Vol No, Laurent Amsaleg, Michael J. Franklin, Anthony Tomasic, Tolga Urhan, Processing Top N, ...
In a wide-area environment, the time required to obtain data from remote sources can vary unpredictably due to network congestion, link failure or other problems. Traditional techniques for query...
June Vol No, Born Parallel, Carrie Ballinger, Ron Fryer, Anant Jhingran, Timothy Malkemus, ...
This paper describes query optimization and processing in DB2 Parallel Edition -- a full function, parallel, scalable database system from IBM. We give a brief overview of the components, and delve...
June Vol No, Letter Special, Betty Salzberg, Born Parallel, Carrie Ballinger, Ron Fryer, ...
This paper describes query optimization and processing in DB2 Parallel Edition -- a full function, parallel, scalable database system from IBM. We give a brief overview of the components, and delve...
June Vol No, Born Parallel, Carrie Ballinger, Ron Fryer, Anant Jhingran, Timothy Malkemus, ...
This paper describes query optimization and processing in DB2 Parallel Edition -- a full function, parallel, scalable database system from IBM. We give a brief overview of the components, and delve...
March Vol No, P. M. Deshp, J. F. Naughton, K. Ramasamy, A. Shukla, K. Tufte, ...
"OLAP" or multi-dimensional analysis workloads present a number of interesting challenges and opportunities for database developers and researchers. While the OLAP goal of extremely fast...
September Vol No, Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, High Performance, ...
This paper describes the design of an object-oriented geographic information system called GODOT (Geographic Data Management With Object-Oriented Techniques). GODOT has a four-layer architecture,...
September Vol No, Hans-peter Kriegel, Thomas Brinkhoff, Ralf Schneider, Interactive Spatial, Directories Brian, ...
This paper describes the design of an object-oriented geographic information system called GODOT (Geographic Data Management With Object-Oriented Techniques). GODOT has a four-layer architecture,...
March Vol, P. M. Deshp, J. F. Naughton, K. Ramasamy, A. Shukla, K. Tufte, ...
"OLAP" or multi-dimensional analysis workloads present a number of interesting challenges and opportunities for database developers and researchers. While the OLAP goal of extremely fast...
Dynamic Hierarchical Clustering (2007)
Chendong Zou, Betty Salzberg, Rivka Ladin
We describe a new method for dynamically clustering hierarchical data which maintains good clustering in the presence of insertions and deletions. This method, which we call Enc, encodes the...
Versioned Backups and Index Concurrency Results of Work-in-Progress (2007)
We have been investigating two areas of interest in transaction processing: using a temporal index for backing up a database and breaking up index node structure changes into
Masaru Kitsuregawa, Betty Salzberg, Mary Fern, Atsuyuki Morishima, Dan Suciu, Wang-chiew Tan, ...
The Bulletin of the Technical Committee on Data Engineering is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and...
Spatial, temporal and spatio-temporal databases - hot issues and directions for PhD research (2004)
Roddick, John F., Hoel, Erik, Egenhofer, Max J., Papadias, Dimitris, Salzberg, Betty
Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpinned by a robust...
Spatial, Temporal and Spatio-Temporal Databases – Hot Issues and Directions for (2004)
John F. Roddick, Max J. Egenhofer, Erik Hoel, Dimitris Papadias, Betty Salzberg
Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpinned by a robust...
Spatial, Temporal and Spatio-Temporal Databases – Hot Issues and Directions for (2004)
John F. Roddick, Max J. Egenhofer, Erik Hoel, Dimitris Papadias, Betty Salzberg
Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpinned by a robust...
On spatial-range closest-pair query (2003)
Jing Shan, Donghui Zhang, Betty Salzberg
Abstract. An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes two objects of the closest pair come from two different data...
A Database System to Advance Subsurface Sensing and Imaging (2002)
Huanmei Wu, Becky Norum, Betty Salzberg, David Kaeli
The CenSSIS Image Database System is a scientific database that enables effective collaboration, scientific data sharing and accelerates fundamental research. We describe a state-of-the-art system...
The BT-Tree: A Branched and Temporal Access Method (2000)
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal data with branched time...
The BT-Tree: A Branched and Temporal Access Method (2000)
Linan Jiang, Betty Salzberg, David Lomet, Manuel Barrena
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal data with branched time...
The BT-Tree: A Branched and Temporal Access Method (1999)
Linan Jiang, Betty Salzberg, David Lomet, Manuel Barrena
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal data with branched time...
-tree: A Multi-attribute Index Supporting Concurrency, Recovery and Node Consolidation (1997)
Corresponding Betty Salzberg, Georgios Evangelidis Giorgos, Georgios Evangelidis, David Lomet, David Lomet, Betty Salzberg, ...
We propose a new multi-attribute index. Our approach combines the hB-tree, a multi-attribute index, and the \Pi-tree, an abstract index which offers efficient concurrency and recovery methods. We...
-Tree: A Multi-Attribute Index Supporting Concurrency, Recovery and Node Consolidation (1997)
Georgios Evangelidis, David Lomet, Betty Salzberg
.<F3.733e+05> We propose a new multi-attribute index. Our approach combines the hB-tree, a multi-attribute index, and the<F3.768e+05><F3.733e+05> #-tree, an abstract index which...
David B. Lomet, Michael Franklin, Joseph Hellerstein, Betty Salzberg
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters,...
Safely and Efficiently Updating References During On-line Reorganization (1996)
Chendong Zou Washington, Betty Salzberg
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-line reorganization algorithm which...
On-line Reorganization of Sparsely-populated B+-trees (1996)
In this paper, we present an efficient method to do online reorganization of sparsely-populated B + -trees. It reorganizes the leaves first, compacting in short operations groups of leaves with the...
On-line Reorganization of Sparsely-populated B + -trees (1996)
In this paper, we present an efficient method to do on-line reorganization of sparsely-populated B + -trees. Our method locks a minimum number of pages to do reorganization. It reorganizes the leaves...
Safely and Efficiently Updating References During On-line Reorganization (1996)
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-line reorganization algorithm which...
DSDT: Durable Scripts Containing Database Transactions (1996)
Betty Salzberg, Dimitri Tombroff
DSDT is a programming tool for writing durable scripts which contain short ACID transactions as components. The context of the script is made durable by writing a log record whenever an event occurs...
Efficiently Updating References During On-line Reorganization (1996)
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. When records are moved during an on-line reorganization of a database,...
Michael A. Olson, Wei Michael Hong, Michael Ubell, Michael Stonebraker, Miron Livny, Raghu Ramakrishnan, ...
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters,...
Back to the Future: Dynamic Hierarchical Clustering (1995)
Chendong Zou Washington, Betty Salzberg, Rivka Ladin
We describe a new method for dynamically clustering hierarchical data which maintains good clustering within disk pages in the presence of insertions and deletions. This simple but effective method,...
Back to the Future: Dynamic Hierarchical Clustering (1995)
Chendong Zou, Betty Salzberg, Rivka Ladin
We describe a new method for dynamically clustering hierarchical data which maintains good clustering within disk pages in the presence of insertions and deletions. This simple but effective method,...
-tree: A Concurrent and Recoverable Multi-attribute Access Method (1994)
Georgios Evangelidis College, Georgios Evangelidis, David Lomet, Betty Salzberg
We describe a new access method, the hB \Pi -tree, an adaptation of an hB-tree index [LS90] to the constraints of a \Pi-tree [LS92]. \Pi-trees, a generalization of B link -trees [LY81], provide very...
Node Deletion in the . . . (1994)
Georgios Evangelidis, David Lomet, Betty Salzberg
The problem of node deletion in the hB \Pi -tree, a multi-attribute point data indexing method, is addressed. The hB \Pi -tree is a modified hB-tree [LS90] that provides concurrency and recovery and...
A Concurrent and Recoverable Multi-attribute Access Method 1 (1994)
Georgios Evangelidis, David Lomet, Betty Salzberg, Georgios Evangelidis, David Lomet, Betty Salzberg
The Cambridge laboratory became operational in 1988 and is located at One Kendall Square, near MIT. CRL engages in computing research to extend the state of the computing art in areas likely to be...
Using the Holey Brick Tree for Spatial Data in General Purpose DBMSs (1993)
Georgios Evangelidis, Betty Salzberg
There is leverage to be gained by bringing spatial data within the purview of general purpose database systems. A spatial access method embedded in a general purpose DBMS would have several...
David Lomet, David Lomet, Betty Salzberg, Betty Salzberg
Rollback databases are multiversion databases that use transaction time to identify the versions of the data. Such databases support queries that request information "as-of" some specific...
Principles of Transaction-Based On-Line Reorganization (1992)
For very large databases such as those used by banks and airlines, cost considerations may forbid shutting down the service for a long period of time and reorganizing off-line. Similarly, the size of...
Concurrency and Recovery for Index Trees (1991)
David Lomet, David Lomet, Betty Salzberg, Betty Salzberg
Providing high concurrency in B + -trees has been studied extensively. But few efforts have been documented for combining concurrency methods with a recovery scheme that preserves well-formed trees...
Concurrency and Recovery for Index Trees (1991)
.<F3.733e+05> Although many suggestions have been made for concurrency in B<F3.733e+05> +<F3.733e+05> -trees, few of these have considered recovery as well. We describe an approach...
Media Recovery with Time-Split (1991)
David Lomet, Betty Salzberg, David Lomet, Betty Salzberg
The Cambridge laboratory became operational in 1988 and is located at One Kendall Square, near MIT. CRL engages in computing research to extend the state of the computing art in areas likely to be...
Concurrency and Recovery for Index Trees (1991)
David Lomet, David Lomet, Betty Salzberg, Betty Salzberg
The Cambridge laboratory became operational in 1988 and is located at One Kendall Square, near MIT. CRL engages in computing research to extend the state of the computing art in areas likely to be...
The performance of a multiversion access method (1990)
The Time-Split B-tree is an integrated index structure for a versioned timestamped database. It gradually migrates data from a current database to an historical database, records migrating when nodes...
The hB-tree: A multiattribute indexing method with good guaranteed performance (1990)
A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-B-tree of Robinson [15] but has additional desirable properties. The hB-tree internode search and...
Branched and Temporal Index Structures
this paper, we combine the ideas of time-varying data and branching versions to produce and compare two new indexing structures: the BT (Branched and Temporal) Forest and the PBT-Tree (the Persistent...
Media Recovery with Time-Split B-trees
Modern database systems provide media recovery by taking periodic backups and applying a transaction log to the backup to bring the data up-to-date. A multi-versioned database is one that retains and...