Optimal splitters for temporal and multi-version databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2013, Pages 109-120

  Le, Wangchao ^a   Li, Feifei ^a   Tao, Yufei ^b,c   Christensen, Robert ^a  

^a UNIVERSITY OF UTAH   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Multi version databases; Optimal splitters; Temporal data

Indexed keywords

BASELINE METHODS; LOAD BALANCING ALGORITHMS; MULTI-VERSION; OPTIMAL SPLITTERS; PARALLEL AND DISTRIBUTED PROCESSING; REAL DATA SETS; STORAGE SPACES; TEMPORAL DATA;

DATA HANDLING; DIGITAL STORAGE; OPTIMIZATION;

DATABASE SYSTEMS;

EID: 84880569291     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463676.2465310     Document Type: Conference Paper

References (23)

1. P. K. Agarwal, L. Arge, and K. Yi. An optimal dynamic interval stabbing-max data structure. In SODA, pages 803-812, 2005.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. CACM, 31(9):1116-1127, 1988.
3. A. Anagnostopoulos, M. Vlachos, M. Hadjieleftheriou, E. Keogh, and P. S. Yu. Global distance-based segmentation of trajectories. In KDD, 2006.
4. L. Arge, O. Procopiuc, and J. S. Vitter. Implementing I/O-efficient data structures using TPIE. In ESA, 2002.
5. L. Arge and J. S. Vitter. Optimal external memory interval management. SIAM Journal on Computing, 32(6):1488-1508, 2003.
6. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. VLDBJ, 5(4):264-275, 1996.
7. Q. Chen, L. Chen, X. Lian, Y. Liu, and J. X. Yu. Indexable PLA for efficient similarity search. In VLDB, 2007.
8. J. Chomicki, D. Toman, and M. H. Böhlen. Querying ATSQL databases with temporal logic. ACM TODS, 26(2):145-178, 2001.
9. M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamir, and S. Zaks. Minimizing total busy time in parallel scheduling with application to optical networks. In IPDPS, 2009.
10. C.-T. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. In SIGMOD, pages 73-88, 1997.
11. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB, 1998.
12. E. Keogh and et. al. The UCR time series classification/clustering homepage. www.cs.ucr.edu/?eamonn/time-series-data.
13. E. J. Keogh, S. Chu, D. Hart, and M. J. Pazzani. An online algorithm for segmenting time series. In ICDM, 2001.
14. S. Khanna, S. Muthukrishnan, and S. Skiena. Efficient array partitioning. In ICALP, pages 616-626, 1997.
15. N. Koudas, S. Muthukrishnan, and D. Srivastava. Optimal histograms for hierarchical range queries. In PODS, pages 196-204, 2000.
16. H.-P. Kriegel, M. Pötke, and T. Seidl. Managing intervals efficiently in object-relational databases. In VLDB, 2000.
17. D. Lomet, M. Hong, R. Nehme, and R. Zhang. Transaction time indexing with version compression. PVLDB, 1(1):870-881, 2008.
18. S. Muthukrishnan and T. Suel. Approximation algorithms for array partitioning problems. J. Algorithms, 54(1):85-104, 2005.
19. T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos, and W. Truppel. Online amnesic approximation of streaming time series. In ICDE, 2004.
20. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In SIGMOD, 1996.
21. K. A. Ross and J. Cieslewicz. Optimal splitters for database partitioning with size bounds. In ICDT, pages 98-110, 2009.
22. Y. Tao and D. Papadias. MV3R-Tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, 2001.
23. J. Yang and J. Widom. Incremental computation and maintenance of temporal aggregates. The VLDB Journal, 12(3):262-283, 2003.