Sciweavers

147 search results - page 30 / 30
» Logarithmic keying
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 4 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
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...
Ke Yi
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 10 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...