Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An Online Algorithm for Segmenting Time Series
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Time Sequence Indexing for Arbitrary Lp Norms
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Transaction Timestamping in (Temporal) Databases
Proceedings of the 27th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
SEB-tree: An Approach to Index Continuously Moving Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
On nearest neighbor indexing of nonlinear trajectories
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Online Amnesic Approximation of Streaming Time Series
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Immortal DB: transaction time support for SQL server
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Global distance-based segmentation of trajectories
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Indexable PLA for efficient similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
iSAX: indexing and mining terabyte sized time series
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Online Interval Skyline Queries on Time Series
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Improving Transaction-Time DBMS Performance and Functionality
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Best position algorithms for efficient top-k query processing
Information Systems
Proceedings of the VLDB Endowment
Handling temporal information in web search engines
ACM SIGMOD Record
Discovering influential data objects over time
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
The database community has devoted extensive amount of efforts to indexing and querying temporal data in the past decades. However, insufficient amount of attention has been paid to temporal ranking queries. More precisely, given any time instance t, the query asks for the top-k objects at time t with respect to some score attribute. Some generic indexing structures based on R-trees do support ranking queries on temporal data, but as they are not tailored for such queries, the performance is far from satisfactory. We present the Seb-tree, a simple indexing scheme that supports temporal ranking queries much more efficiently. The Seb-tree answers a top-k query for any time instance t in the optimal number of I/Os in expectation, namely, $${O\left({\rm log}_B\,\frac{N}{B}+\frac{k}{B}\right)}$$ I/Os, where N is the size of the data set and B is the disk block size. The index has near-linear size (for constant and reasonable k max values, where k max is the maximum value for the possible values of the query parameter k), can be constructed in near-linear time, and also supports insertions and deletions without affecting its query performance guarantee. Most of all, the Seb-tree is especially appealing in practice due to its simplicity as it uses the B-tree as the only building block. Extensive experiments on a number of large data sets, show that the Seb-tree is more than an order of magnitude faster than the R-tree based indexes for temporal ranking queries.