Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The log-structured merge-tree (LSM-tree)
Acta Informatica
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Index Access with a Finite Buffer
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Grow and Post Index Trees: Roles, Techniques and Future Potential
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Techniques for Efficient Road-Network-Based Tracking of Moving Objects
IEEE Transactions on Knowledge and Data Engineering
AGILE: adaptive indexing for context-aware information filters
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
B-tree indexes for high update rates
ACM SIGMOD Record
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
LUGrid: Update-tolerant Grid-based Indexing for Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
| Hi-index | 0.00 |
An emerging class of database applications is characterized by frequent updates of low-dimensional data, e.g. coming from sensors that sample continuous real world phenomena. Traditional persistency requirements can be weakened in this setting of frequent updates, emphasizing a role of the main-memory in external storage index structures and enabling a higher update throughput. Moreover, in order for an index to be suitable for practical applications, efficient past-state queries should be supported without significantly penalizing other operations. These issues are not adequately addressed in the database research. We report on the RR-tree---our first step towards resolving them. Based on this, we outline a number of concrete short-term and more abstract longer-term future research directions.