793 search results - page 80 / 159 » Validity-Sensitive Querying of XML Databases |
166
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
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...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In relational database management systems indexes are used to accelerate specific queries. The selection of indexes is an important task when tuning a database which is ...
JIDM
2010
14 years 8 months ago
2010
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...