Sciweavers

242 search results - page 1 / 49
» An Efficient Method for Indexing Now-relative Bitemporal dat...
Sort
View
VLDB
1998
ACM
87views Database» more  VLDB 1998»
13 years 8 months ago
R-Tree Based Indexing of Now-Relative Bitemporal Data
Rasa Bliujute, Christian S. Jensen, Simonas Salten...
ADC
2004
Springer
88views Database» more  ADC 2004»
13 years 8 months ago
An Efficient Method for Indexing Now-relative Bitemporal data
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
Bela Stantic, Sankalp Khanna, John Thornton
TIME
1997
IEEE
13 years 8 months ago
On Effective Data Clustering in Bitemporal Databases
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...
Jong Soo Kim, Myoung-Ho Kim
VLDB
2002
ACM
99views Database» more  VLDB 2002»
13 years 4 months ago
An Efficient Method for Performing Record Deletions and Updates Using Index Scans
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...
C. Mohan
PVLDB
2010
122views more  PVLDB 2010»
12 years 11 months ago
ZINC: Efficient Indexing for Skyline Computation
We present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered at...
Bin Liu, Chee-Yong Chan