Sciweavers

353 search results - page 49 / 71
» Processing Top-k Join Queries
Sort
View
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 8 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 2 months ago
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast
We present a demo of ESTER, a search engine that combines the ease of use, speed and scalability of full-text search with the powerful semantic capabilities of ontologies. ESTER s...
Holger Bast, Fabian M. Suchanek, Ingmar Weber
CIKM
2004
Springer
14 years 1 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
SIGMOD
2005
ACM
360views Database» more  SIGMOD 2005»
14 years 8 months ago
NaLIX: an interactive natural language interface for querying XML
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy ...
Yunyao Li, Huahai Yang, H. V. Jagadish
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 1 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis