This work is a proposal for a database index structure that has been specifically designed to
support the evaluation of XPath queries. As such, the index is capable to support all XPath …

It is infeasible for a sensor database to contain the exact value of each sensor at all points in
time. This uncertainty is inherent in these systems due to measurement and sampling errors …

We consider the problems of computing aggregation queries in temporal databases and of
maintaining materialized temporal aggregate views efficiently. The latter problem is …

Caching approximate values instead of exact values presents an opportunity for
performance gains in exchange for decreased precision. To maximize the performance …

Publisher Summary Relational query processors derive much of their effectiveness from the
awareness of specific table properties like sort order, size, or absence of duplicate tuples …

This article is a proposal for a database index structure, the XPath accelerator, that has been
specifically designed to support the evaluation of XPath path expressions. As such, the …

Indexing intervals is a fundamental problem, finding a wide range of applications, most
notably in temporal and uncertain databases. We propose HINT, a novel and efficient in …

Ordered (key-value) maps are an important and widely-used data type for large-scale data
processing frameworks. Beyond simple search, insertion and deletion, more advanced …

对XML 数据建立有效的索引, 是左右XML 数据处理性能的重要因素. 深入地讨论了目前XML
索引技术的研究现状, 将XML 索引技术分为两大类: 节点记录类索引(本身还可以分为3 …

Each tuple in a valid-time relation includes an interval attribute T that represents the tuple's
valid time. The overlap join between two valid-time relations determines all pairs of tuples …