Sciweavers

353 search results - page 60 / 71
» Processing Top-k Join Queries
Sort
View
WIDM
2004
ACM
14 years 1 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 8 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
PVLDB
2010
158views more  PVLDB 2010»
13 years 6 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
14 years 9 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
SIGIR
2003
ACM
14 years 1 months ago
SETS: search enhanced by topic segmentation
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghav...