Sciweavers

1038 search results - page 67 / 208
» Space-Bounded Query Approximation
Sort
View
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
16 years 5 months ago
Pointwise-Dense Region Queries in Spatio-temporal Databases
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
Jinfeng Ni, Chinya V. Ravishankar
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 4 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
ACL
2011
14 years 8 months ago
Fine-Grained Class Label Markup of Search Queries
We develop a novel approach to the semantic analysis of short text segments and demonstrate its utility on a large corpus of Web search queries. Extracting meaning from short text...
Joseph Reisinger, Marius Pasca
ICDT
2010
ACM
125views Database» more  ICDT 2010»
15 years 8 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 6 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...