Sciweavers

929 search results - page 102 / 186
» Answering imprecise database queries: a novel approach
Sort
View
PVLDB
2010
225views more  PVLDB 2010»
14 years 6 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
GIS
2007
ACM
16 years 29 days ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 1 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 3 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
15 years 5 months ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola