Sciweavers

358 search results - page 1 / 72
» On a model of indexability and its bounds for range queries
Sort
View
JACM
2002
55views more  JACM 2002»
13 years 4 months ago
On a model of indexability and its bounds for range queries
Joseph M. Hellerstein, Elias Koutsoupias, Daniel P...
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 5 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
VLDB
2007
ACM
122views Database» more  VLDB 2007»
14 years 5 months ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
EDBT
2006
ACM
145views Database» more  EDBT 2006»
14 years 5 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
TKDE
1998
126views more  TKDE 1998»
13 years 4 months ago
Dictionary: A New Access Method for Query Processing in Object-Oriented Databases
—We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and asso...
Wang-Chien Lee, Dik Lun Lee