659 search results - page 3 / 132 » Indexing and Querying A Large Database of Typed Intervals |
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
ICDE
2008
IEEE
14 years 6 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...
DEXA
2008
Springer
13 years 7 months ago
2008
Springer
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
SSDBM
2002
IEEE
13 years 10 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...