707 search results - page 49 / 142 » Processing queries on tree-structured data efficiently |
206
Voted
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
247
Voted
VLDB
2005
ACM
16 years 2 months ago
2005
ACM
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
207
Voted
ICDE
1999
IEEE
16 years 3 months ago
1999
IEEE
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
107
Voted
WWW
2009
ACM
16 years 3 months ago
2009
ACM
In a traditional keyword-search system in XML data, a user composes a keyword query, submits it to the system, and retrieves relevant subtrees. In the case where the user has limi...
142
click to vote
COMAD
2008
15 years 3 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...