Sciweavers

184 search results - page 12 / 37
» A new range query algorithm for Universal B-trees
Sort
View
EDBT
2009
ACM
92views Database» more  EDBT 2009»
15 years 3 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 9 days ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
AI
2010
Springer
14 years 12 months ago
Property persistence in the situation calculus
We develop a new automated reasoning technique for the situation calculus that can handle a class of queries containing universal quantication over situation terms. Although such ...
Ryan F. Kelly, Adrian R. Pearce
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
15 years 4 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 12 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi