Sciweavers

458 search results - page 7 / 92
» Multi-query Optimization for Distributed Similarity Query Pr...
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 7 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
CIKM
2007
Springer
14 years 1 months ago
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
Tao-Young Fu, Wen-Chih Peng, Wang-Chien Lee
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 7 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
KR
1992
Springer
13 years 11 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer