Sciweavers

154 search results - page 10 / 31
» Exploiting Similarity of Subqueries for Complex Query Optimi...
Sort
View
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 8 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
MM
2009
ACM
177views Multimedia» more  MM 2009»
14 years 2 months ago
Transfer non-metric measures into metric for similarity search
Similarity search is widely used in multimedia retrieval systems to find the most similar ones for a given object. Some similarity measures, however, are not metric, leading to e...
Danzhou Liu, Kien A. Hua
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 5 days ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
DBISP2P
2005
Springer
82views Database» more  DBISP2P 2005»
14 years 1 months ago
Range Query Optimization Leveraging Peer Heterogeneity in DHT Data Networks
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
Nikos Ntarmos, Theoni Pitoura, Peter Triantafillou
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
12 years 10 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...