Sciweavers

1782 search results - page 270 / 357
» Processing Queries over Distributed XML Databases
Sort
View
WWW
2006
ACM
14 years 9 months ago
Time-dependent semantic similarity measure of queries using historical click-through data
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the...
Qiankun Zhao, Steven C. H. Hoi, Tie-Yan Liu, Soura...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
14 years 11 days ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
DOLAP
2010
ACM
13 years 6 months ago
Towards OLAP query reformulation in peer-to-peer data warehousing
Inter-business collaborative contexts prefigure a distributed scenario where companies organize and coordinate themselves to develop common and shared opportunities. Traditional b...
Matteo Golfarelli, Federica Mandreoli, Wilma Penzo...
SSDBM
2007
IEEE
111views Database» more  SSDBM 2007»
14 years 3 months ago
Duplicate Elimination in Space-partitioning Tree Indexes
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref
IJCAI
1997
13 years 10 months ago
Efficiently Executing Information-Gathering Plans
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
Marc Friedman, Daniel S. Weld