Filters








10 Hits in 6.8 sec

The Snapshot Index: An I/O-Optimal access method for timeslice queries

Vassilis J. Tsotras, Nickolas Kangelaris
1995 Information Systems  
This is the first I I O-optimal access method for this problem using O(n/b) space and O(1) updating (in the expected amortized sense due to the use of hashing.)  ...  We present an access method for timeslice queries that reconstructs a past state s(t) of a time-evolving collection of objects, in O(log" n + Is(t)l/b) I/O '8, where Is(t)1 denotes the size of the collection  ...  Sellis for kindly providing us with access to the computing facilities of his laboratory at the National TechnicaI University of Athens, where some of the simulations were performed while the second author  ... 
doi:10.1016/0306-4379(95)00011-r fatcat:j5rns3b7yrfcvivncffwizmzka

Bi-temporal Timeline Index: A data structure for Processing Queries on bi-temporal data

Martin Kaufmann, Peter M. Fischer, Norman May, Chang Ge, Anil K. Goel, Donald Kossmann
2015 2015 IEEE 31st International Conference on Data Engineering  
In this paper, we present the Bi-temporal Timeline Index, which supports a broad range of temporal operators and exploits the special properties of an in-memory column store database system.  ...  Comprehensive performance experiments with the TPC-BiH benchmark show that algorithms based on the Bi-temporal Timeline Index outperform significantly both existing commercial database systems and state-of-the-art  ...  Not being bound by I/O optimizations permits a drastic simplification in the index design as well as better support for modern hardware.  ... 
doi:10.1109/icde.2015.7113307 dblp:conf/icde/KaufmannFMGGK15 fatcat:fvyxhxytkjakrots63pzly5itq

Comparison of access methods for time-evolving data

Betty Salzberg, Vassilis J. Tsotras
1999 ACM Computing Surveys  
This paper compares different indexing techniques proposed for supporting efficient access to temporal data.  ...  The purpose of the paper is to identify the difficult problems in accessing temporal data and describe how the different methods aim to solve them.  ...  An interesting open problem is whether an I/O optimal solution exists for the "range/point/-" query (valid range timeslices).  ... 
doi:10.1145/319806.319816 fatcat:box27sww4zcy7bva6nfa75xdpi

Efficient snapshot retrieval over historical graph data

U. Khurana, A. Deshpande
2013 2013 IEEE 29th International Conference on Data Engineering (ICDE)  
for retrieving snapshots of the graph as of any timepoint in the past or evolution histories of individual nodes or neighborhoods; and (2) a Temporal Graph Analysis Framework (TAF), for expressing complex  ...  temporal analytical tasks and for executing them in an efficient and scalable manner using Apache Spark.  ...  Snapshot index [39] is an I/O optimal solution to the problem of snapshot retrieval for transaction-time databases.  ... 
doi:10.1109/icde.2013.6544892 dblp:conf/icde/KhuranaD13 fatcat:7zgoe2txena55lxfgm56ro2w3y

Storing and Analyzing Historical Graph Data at Scale [article]

Udayan Khurana, Amol Deshpande
2015 arXiv   pre-print
retrieving snapshots of the graph as of any timepoint in the past or evolution histories of individual nodes or neighborhoods; and a Spark-based Temporal Graph Analysis Framework (TAF), for expressing  ...  The work on large-scale graph analytics to date has largely focused on the study of static properties of graph snapshots.  ...  Snapshot index [50] is an I/O optimal solution to the problem of snapshot retrieval for transaction-time databases.  ... 
arXiv:1509.08960v1 fatcat:nagvtvgi3fdq7oelhxu3xu6uha

Designing access methods for bitemporal databases

A. Kumar, V.J. Tsotras, C. Faloutsos
1998 IEEE Transactions on Knowledge and Data Engineering  
The partial-persistence methodology reduces bitemporal queries to partial persistence problems for which an efficient access method is then designed.  ...  In this paper we examine the issues involved in designing efficient access methods for bitemporal databases and propose the partial-persistence and the double-tree methodologies.  ...  Seeger for kindly providing us with the R* and MVB-tree code, and R. Snodgrass and C. Jensen for their suggestions for a 3-part bitemporal query terminology.  ... 
doi:10.1109/69.667079 fatcat:rgemu4wgorcdbpsskl63t5zspa

Optimized algorithms for predictive range and KNN queries on moving objects

Rui Zhang, H.V. Jagadish, Bing Tian Dai, Kotagiri Ramamohanarao
2010 Information Systems  
We theoretically show that our algorithms based on the Transformed Minkowski Sum are optimal in terms of the number of tree node accesses.  ...  However, not much attention is paid to two other important query types: the predictive range query and the predictive k nearest neighbor query.  ...  Acknowledgment We would like to thank the authors of [4] for providing us the source code of their work, which we used in our performance study.  ... 
doi:10.1016/j.is.2010.05.004 fatcat:hjrfmo4hujb7paqsrt5jm5xumi

Hashing methods for temporal data

G. Kollios, V.J. Tsotras
2002 IEEE Transactions on Knowledge and Data Engineering  
External dynamic hashing has been used in traditional database systems as a fast method to answer membership queries.  ...  Given a dynamic set S of objects, a membership query asks whether an object with identity k is in the most current S. This paper addresses the more general problem of Temporal Hashing.  ...  Seeger for kindly providing us with the R* and MVB-tree code. Part of this work was performed while V.J.  ... 
doi:10.1109/tkde.2002.1019221 fatcat:ggs6gkmgarcxbjtzu3fgar64ey

Efficient Snapshot Retrieval over Historical Graph Data [article]

Udayan Khurana, Amol Deshpande
2012 arXiv   pre-print
We develop analytical models for both the storage space needed and the snapshot retrieval times to aid in choosing the right parameters for a specific scenario.  ...  Along with the original graph data, DeltaGraph can also maintain and index auxiliary information; this functionality can be used to extend the structure to efficiently execute queries like subgraph pattern  ...  Tsotras and Kangelaris [37] present snapshot index, an I/O optimal solution to the problem for transaction-time databases.  ... 
arXiv:1207.5777v1 fatcat:3g2nwuo6gnh4vjzug7qb43vwzu

Access Methods for Temporal Databases

Bela Stantic, University, My, Abdul Sattar
2018
Therefore, an obvious research question is: can we develop more robust and more efficient access methods for temporal databases than the existing ones?  ...  However, the lack of efficient access methods is perhaps one of the reasons why commercial RDBMS vendors have been reluctant to adopt the advances in temporal database research.  ...  Research problems It remains an open problem to find theoretically I/O optimal solutions for the various bitemporal queries, like the "*//point/point" and "*//range/point" queries.  ... 
doi:10.25904/1912/1541 fatcat:lp7zpcnpwnh3dpfxfuy5r7llle