Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Performance Evaluation
Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
Operation specific locking in B-trees
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Performance analysis of centralized databases with optimistic concurrency control
Performance Evaluation
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximate analysis of reader and writer access to a shared resource
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
B-trees with inserts and deletes: why free-at-empty is better than merge-at-half
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Semantically-based concurrancy control for search structures
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Stochastic Analysis of Computer Storage
Stochastic Analysis of Computer Storage
The performance of concurrent data structure algorithms
The performance of concurrent data structure algorithms
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Quantitative evaluation of a transaction facility for knowledge base management system
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Implementing deletion in B+-trees
ACM SIGMOD Record
Asynchronous shared memory search structures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Using two B+-trees to efficiently process inclusion spatial queries (extended abstract)
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
Deleting Keys of B-trees in Parallel
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
Proceedings of the 27th International Conference on Very Large Data Bases
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
Analysis of locking behavior in three real database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Improved Concurrency Control Techniques for Multi-dimensional Index Structures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Consistent and compact data management in distributed storage systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing
Online reorganization of databases
ACM Computing Surveys (CSUR)
HOBI: Hierarchically Organized Bitmap Index for Indexing Dimensional Data
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
A concurrency control algorithm for nearest neighbor query
Information Sciences: an International Journal
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
A concurrent Blink-tree algorithm using a cooperative locking protocol
BNCOD'03 Proceedings of the 20th British national conference on Databases
Efficient bulk-loading on dynamic metric access methods
Information Systems
Time-HOBI: indexing dimension hierarchies by means of hierarchically organized bitmaps
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Time-HOBI: Index for optimizing star queries
Information Systems
Data structures for multiversion data warehouse
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |