Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Very Large Data Bases Conference

• Publication date

  1998-08-24

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Comparison of access methods for time-evolving data

  1999cited by this paper
• Incremental Organization for Data Recording and Warehousing

  1997cited by this paper
• An overview of data warehousing and OLAP technology

  1997cited by this paper
• Concurrency and recovery in generalized search trees

  1997influential reference
• A Generic Approach to Bulk Loading Multidimensional Index Structures

  1997influential reference
• Performance of Concurrency Control Mechanisms in Centralized Database Systems

  1995cited by this paper
• Concurrency Control and Recovery Methods for B+-Tree Indexes: ARIES/KVL and ARIES/IM

  1995influential reference
• The Snapshot Index: An I/O-optimal access method for timeslice queries

  1995cited by this paper
• The TP-Index: a dynamic and efficient indexing mechanism for temporal databases

  1994cited by this paper
• The Time Index and the Monotonic B+-tree

  1993cited by this paper
• A Log-Structured History Data Access Method (LHAM)

  1993cited by this paper
• Temporal Databases: Theory, Design, and Implementation

  1993cited by this paper
• Key Range Locking Strategies for Improved Concurrency

  1993cited by this paper
• Transaction Processing: Concepts and Techniques

  1992cited by this paper
• Efficient implementation techniques for the time index

  1991cited by this paper
• The design and implementation of a log-structured file system

  1991cited by this paper
• Temporal databases status and research directions

  1990cited by this paper
• The performance of a multiversion access method

  1990cited by this paper
• Access methods for multiversion data

  1989cited by this paper
• Indexing techniques for historical databases

  1989cited by this paper
• The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time

  1987cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984cited by this paper
• VERSION

  1922cited by this paper
• The VLDB Journal c ○ Springer-Verlag 1996 An asymptotically optimal multiversion B-tree

  year unknowncited by this paper

• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines

  2023cites this paper
• Real-Time LSM-Trees for HTAP Workloads

  2021cites this paper
• Index-Accelerated Pattern Matching in Event Stores

  2021cites this paper
• EvenDB: optimizing key-value storage for spatial locality

  2020cites this paper
• Reconciling LSM-Trees with Modern Hard Drives using BlueFS

  2019cites this paper
• Accordion: Better Memory Organization for LSM Key-Value Stores

  2018cites this paper
• LSM-based storage techniques: a survey

  2018cites this paper
• Storage Engine Load Scheduler Query Engine Java API Network

  2017cites this paper
• SLA-basierte Konfiguration eines modularen Datenbanksystems für die Cloud

  2016cites this paper
• Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs

  2016cites this paper
• Resource-Efficient Data-Intensive System Designs for High Performance and Capacity

  2015cites this paper
• Optimizing Database Algorithms for Random-Access Block Devices

  2015cites this paper
• Scaling concurrent log-structured data stores

  2015cites this paper
• LSM-Based Storage and Indexing: An Old Idea with Timely Benefits

  2015cites this paper
• Online Updates on Data Warehouses via Judicious Use of Solid-State Storage

  2015cites this paper
• Transactions Chasing Scalability and Instruction Locality on Multicores

  2014cites this paper
• Gestion de données personnelles respectueuse de la vie privée

  2014cites this paper
• Scalable and dynamically balanced shared-everything OLTP with physiological partitioning

  2013cites this paper
• Fault Tolerance for Main-memory applications in the cloud

  2013cites this paper
• Snapshots in Large-Scale Distributed File Systems

  2013cites this paper
• Snapshots in large-scale distributed file systems

  2013cites this paper
• An efficient B+-tree design for main-memory database systems with strong access locality

  2013cites this paper
• Timeline index: a unified data structure for processing queries on temporal data in SAP HANA

  2013cites this paper
• Indexing and search on complex data warehouses and rapidly-changing data

  2012cites this paper
• Index maintenance for time-travel text search

  2012cites this paper
• A practical concurrent index for solid-state drives

  2012cites this paper
• Personal Data Server EngineDesign and performance considerations

  2012cites this paper
• Scalable Transaction Processing through Data-oriented Execution

  2012cites this paper
• MOVIES: indexing moving objects by shooting index images

  2011cites this paper
• Modern B-tree techniques

  2011cites this paper
• Scalable Distributed Time-Travel Text Search Masterarbeit im Fach Informatik Master's Thesis in Computer Science von / by

  2011cites this paper
• Efficient Updates for OLAP Range Queries on Flash Memory

  2011influential citation
• LOG ANALYSIS TECHNIQUE: PICVIZ

  2011cites this paper
• Exploiting the Interplay Between Memory and Flash Storage for Sensor Data Management

  2010cites this paper
• Tree indexing on solid state drives

  2010cites this paper
• A High Effective Indexing and Retrieval Method Providing Block-Level Timely Recovery to Any Point-in-Time

  2010influential citation
• Fast Loads and Queries

  2010cites this paper
• Temporal search in web archives

  2010cites this paper
• Exploiting the Interplay between Memory and Flash Storage in Embedded Sensor Devices

  2010cites this paper
• Indexing Moving Objects Using Short-Lived Throwaway Indexes

  2009influential citation
• Comparison of Tools for Data Mining and Retrieval in High Volume Data Stream

  2009cites this paper
• Historical data storage for large scale sensor networks

  2009cites this paper
• Rose: compressed, log-structured replication

  2008cites this paper
• Index de base de données

  2008cites this paper
• The partitioned exponential file for database storage management

  2007cites this paper
• Sampling-based randomization techniques for approximate query processing

  2007cites this paper
• Stasis: flexible transactional storage

  2006influential citation
• B-tree indexes for high update rates

  2006cites this paper
• Materialized Sample Views for Database Approximation

  2006cites this paper
• Online B-tree merging

  2005cites this paper
• Passive DNS Replication

  2005cites this paper
• TECHNICAL RESEARCH REPORT

  2004cites this paper
• Supporting temporal text-containment queries in temporal document databases

  2004cites this paper
• The vagabond approach to logging and recovery in transaction-time temporal object database systems

  2004cites this paper
• The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure

  2003cites this paper
• Sorting And Indexing With Partitioned B-Trees

  2003cites this paper
• Out from under the trees [linear file template]

  2002influential citation
• The LHAM log-structured history data access method

  2000cites this paper
• The vagabond temporal OID index: an index structure for OID indexing in temporal object database systems

  2000cites this paper
• A comparative study of log-only and in-place update based temporal object database systems

  2000cites this paper
• The BT-tree: A Branched and Temporal Access Method

  2000cites this paper
• Efficient Use of Signatures in Object-Oriented Database Systems

  1999cites this paper
• The Persistent Cache: Improving OID Indexing in Temporal Object-Oriented Database Systems

  1999cites this paper
• An Eecient Index Structure for Oid Indexing in Parallel Temporal Object-oriented Database Systems

  1999cites this paper
• The Vagabond Parallel Temporal Object-Oriented Database System: Versatile Support for Future Applications

  1999cites this paper
• A Performance Evaluation of Online Warehouse Update Algorithms

  1998cites this paper
• Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems

  1998cites this paper
• Indexing and search on complex data warehouses and rapidly-changing data

  year unknowncites this paper
• Scalable Transaction Processing through Data-oriented Execution

  year unknowncites this paper