Sciweavers

72 search results - page 2 / 15
» On the complexity of query answering over incomplete XML doc...
Sort
View
ICEIS
2009
IEEE
13 years 11 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
XSYM
2007
Springer
150views Database» more  XSYM 2007»
13 years 11 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
ICDT
2007
ACM
126views Database» more  ICDT 2007»
13 years 11 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 6 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
SIGMOD
2003
ACM
240views Database» more  SIGMOD 2003»
14 years 5 months ago
XRANK: Ranked Keyword Search over XML Documents
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmug...