Sciweavers

176 search results - page 16 / 36
» Supporting ranking queries on uncertain and incomplete data
Sort
View
BTW
2003
Springer
140views Database» more  BTW 2003»
14 years 22 days ago
An Ontology for Domain-oriented Semantic Similarity Search on XML Data
Abstract: Query languages for XML such as XPath or XQuery support Boolean retrieval where a query result is a (possibly restructured) subset of XML elements or entire documents tha...
Anja Theobald
SEMWEB
2010
Springer
13 years 5 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
DEBU
2000
147views more  DEBU 2000»
13 years 7 months ago
Adaptive Query Processing for Internet Applications
As the area of data management for the Internet has gained in popularity, recent work has focused on effectively dealing with unpredictable, dynamic data volumes and transfer rate...
Zachary G. Ives, Alon Y. Levy, Daniel S. Weld, Dan...
VLDB
1999
ACM
87views Database» more  VLDB 1999»
13 years 11 months ago
Query Optimization for XML
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect...
Jason McHugh, Jennifer Widom
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang