Sciweavers

6 search results - page 1 / 2
» Managing Efficiently Temporal Relations Through Indexed Span...
Sort
View
IJCAI
1989
13 years 6 months ago
Managing Efficiently Temporal Relations Through Indexed Spanning Trees
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...
Malik Ghallab, A. Mounir Alaoui
VLDB
2000
ACM
136views Database» more  VLDB 2000»
13 years 9 months ago
Managing Intervals Efficiently in Object-Relational Databases
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...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
SSD
2001
Springer
113views Database» more  SSD 2001»
13 years 9 months ago
Object-Relational Indexing for General Interval Relationships
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...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
CIKM
2009
Springer
13 years 9 months ago
Scalable indexing of RDF graphs for efficient join processing
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...
George H. L. Fletcher, Peter W. Beck
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
13 years 10 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
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...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...