The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
While information retrieval (IR) and databases (DB) have been developed independently, there have been emerging requirements that both data management and efficient text retrieva...
Jinsuk Kim, Du-Seok Jin, Yunsoo Choi, Chang-Hoo Je...
In this paper we consider data freshness and overload handling in embedded systems. The requirements on data management and overload handling are derived from an engine control so...
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...