6 search results - page 1 / 2 » Managing Efficiently Temporal Relations Through Indexed Span... |
63
Voted
IJCAI
1989
15 years 1 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
VLDB
2000
ACM
15 years 3 months ago
2000
ACM
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
SSD
2001
Springer
15 years 4 months ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
113
click to vote
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
143
click to vote
SSDBM
2002
IEEE
15 years 4 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...