486 search results - page 61 / 98 » An Efficient Path Index for Querying Semi-structured Data |
196
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
202
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
DKE
1998
14 years 11 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
117
click to vote
SIGMOD
2010
ACM
14 years 6 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
108
click to vote
DASFAA
2010
IEEE
15 years 5 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...