Patent
Efficient optimistic concurrency control and lazy queries for B-trees and other database structures
Reads0
Chats0
TLDR
In this article, the authors present a system and methods for fine-granularity concurrency control in a parallel database, where very fine granularity (at the level of B-tree records) is implemented in a b-tree.Abstract:
The present invention relates to a system and methods for fine-granularity concurrency control in a parallel database. Very fine granularity (at the level of B-tree records) is implemented in a B-tree. Our method applies to B-trees, B-trees with variable keys, and their applications, such as semantic and object-oriented databases. Our method involves accumulating a transaction and then "optimistically" validating it, while attaining high efficiency with maximum semantic safety. "Lazy queries"--an efficient method for finding the intersection of two large queries--is provided for the system.read more
Citations
More filters
Patent
Read, write, and recovery operations for replicated data
TL;DR: In this article, the read, write and recovery operations for replicated data are provided, using first and second timestamps to coordinate the operations among the designated devices (101, 102).
Patent
Computer method and system for concurrency control using dynamic serialization ordering
TL;DR: In this article, a serialization ordering between a database transaction and other database transactions based on the intended use of the database system resource by the database transaction is asserted between the DB transactions and other DB transactions, then communicated to a node in the distributed database system that needs to know the serialization order to perform concurrency control.
Patent
Selective pessimistic locking for a concurrently updateable database
TL;DR: In this article, the authors proposed a selective locking concurrency control that selectively applies transaction serialization and locking only when transaction conflicts are detected, which avoids livelock transaction failures and provides deterministic transaction completion without the computational expense of a conventional pessimistic concurrency controlling.
Patent
Redundant data assigment in a data storage system
TL;DR: In this paper, the authors present techniques for assignment and layout of redundant data in data storage system. But the data to be assigned may include a group of data segments and when the number of nodes (102) is less than M, the group is divided to form a group with a reduced requirement.
Patent
Hybrid Push/Pull Execution of Continuous SQL Queries
George A. Mihaila,Ioana Stanoi +1 more
TL;DR: In this paper, a computer-implemented method for hybrid push/pull of continuous structured query language queries is presented, where the stream input comprises events of interest, builds and a state machine and stream plans, based on an original query.
References
More filters
Journal ArticleDOI
Ubiquitous B-Tree
TL;DR: The major variations of the B-tree are discussed, especially the B+-tree, contrasting the merits and costs of each implementation and illustrating a general purpose access method that uses a B- tree.
Proceedings ArticleDOI
Efficient optimistic concurrency control using loosely synchronized clocks
TL;DR: An efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage and transactional support are provided by servers, which outperforms adaptive callback locking for low to moderate contention workloads, and scales better with the number of clients.
Patent
Data system with distributed tree indexes and method for maintaining the indexes
TL;DR: In this article, a data server organizes data according to a tree index structure, where memory pages used to store data are indexed by higher level index nodes in the tree structure.
Journal ArticleDOI
Observations on optimistic concurrency control schemes
TL;DR: A number of general properties of optimistic concurrency control schemes is derived, and their advantages and drawbacks w.r.t. two-phase locking approaches are discussed.
Patent
Concurrency-control method and apparatus in a database management system utilizing key-valued locking
David B. Lomet,Russell J. Green +1 more
TL;DR: In this article, the concurrency control mechanisms in a database management system achieves high concurrency by using a lock-mode set larger than that conventionally employed for multi-granularity locking.