Sciweavers

1160 search results - page 21 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
102
Voted
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
15 years 7 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
231
Voted
GIS
2005
ACM
16 years 3 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
144
Voted
CLUSTER
2005
IEEE
15 years 8 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
122
Voted
ICDCN
2009
Springer
15 years 7 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
216
Voted
VLDB
2002
ACM
139views Database» more  VLDB 2002»
16 years 2 months ago
TIMBER: A native XML database
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman...