Sciweavers

9414 search results - page 198 / 1883
» Adaptive Query Processing
Sort
View
CCCG
2008
15 years 4 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 10 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
IPPS
2008
IEEE
15 years 9 months ago
Supporting high performance bioinformatics flat-file data processing using indices
As an essential part of in vitro analysis, biological database query has become more and more important in the research process. A few challenges that are specific to bioinformat...
Xuan Zhang, Gagan Agrawal
SEDE
2010
15 years 1 months ago
Metadata Services for Distributed Event Stream Processing Agents
Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such ...
Mahesh B. Chaudhari, Suzanne W. Dietrich
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 4 months ago
Location-based Spatial Queries with Data Sharing in Wireless Broadcast Environments
Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with th...
Wei-Shinn Ku, Roger Zimmermann, Haixun Wang