Temporal aggregation using a multidimensional index

Journal of Database Management

Volumn 18, Issue 2, 2007, Pages 62-79

  Woo, Joon Ho ^a,c   Lee, Byung Suk ^b,d,e   Lee, Min Jae ^a   Loh, Woong Kee ^a   Whang, Kyu Young ^a,f  

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

^b UNIVERSITY OF VERMONT   (United States)

^c Samsung SDS   (South Korea)

^d DARTMOUTH COLLEGE   (United States)

^e LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^f Advanced Information Technology Research Center (AITrc)

Author keywords

Multidimensional index; Temporal aggregation

Indexed keywords

FORESTRY; QUERY PROCESSING;

DATA POINTS; MULTIDIMENSIONAL INDEX; STATE-OF-THE-ART METHODS; TEMPORAL AGGREGATES; TEMPORAL AGGREGATION; TREE METHOD; TWO DIMENSIONAL SPACES;

AGGREGATES;

EID: 47349088866     PISSN: 10638016     EISSN: 15338010     Source Type: Journal    
DOI: 10.4018/jdm.2007040104     Document Type: Article

References (16)

1. Epstein, R. (1979). Techniques for processing of aggregates in relational database systems (Tech. Rep. UCB/ERL M7918). Berkeley, CA: University of California.
2. Gaede, V., & Gunther, O. (1998). Multi-dimensional access methods. ACM Computing Surveys, 30(2), 170-231.
3. Gendrano, J. A. G., Huang, B. C., Rodrigue, J. M., Moon, B., & Snodgrass, R. T. (1999). Parallel algorithms for computing temporal aggregates. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), (pp. 418-427).
4. Jensen, C. S., et al. (1998). The consensus glossary of temporal database concepts (February 1998 version). Temporal databases: research and practice. Lecture Notes in Computer Science (LNCS), 1399, 373-374.
5. Kim, J., Kang, S., & Kim, M. (1999). Effective remporal aggregation usin point-based trees. In Proceedings of the International Conference on Database and Expert Systems Applications (DEXA), (pp. 10 18-1030).
6. Kline, N., & Snodgrass, R. T. (1995). Computing remporal aggregates. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), Taipei, Taiwan, (pp. 222-231).
7. Moon, B., Lopez, I. F. V, & Immanuel, V (2000). Scalable algorithms for large temporal aggregation. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), San Diego, USA, (pp. 145-154).
8. Preparata, F. P., & Shamos, M. I. (1985). Computational geometry: An introduction. Berlin/Heidelberg, Germany: Springer-Verlag.
9. Robinson, J. T. (1981). The K-D-B-tree: A search structure for large multi-dimensional dynamic indexes. In Proceedings of the International Conference on Management of Data, ACM SIGMOD, New York, USA, (pp. 10- 18).
10. Song, J., Whang, K., Lee, Y., Lee, M., & Kim, S. (1999). Spatial join processing using corner transformation. IEEE Transactions on Knowledge and Data Engineering (TKDE), 11(4), 688-698.
11. Terenziani, P., & Snodgrass, R. T. (2004). Reconciling point-based and Interval-based semantics in temporal relational databases: A treatment of the telic/atelic distinction. IEEE Transactions on Knowledge and Data Engineering, 16(5), 540-551.
12. Trujillo, J., Luján-Mora, S., & Song, I.-Y. (2004).Applying UML and XML for designing and interchanging informa- tion for data warehouses and OLAP applications. Journal of Database Management, 15(1), 41-72.
13. Tuma, P. A. (1992). Implementing historical aggregates in TempIS, Unpublished master's thesis, Wayne State University.
14. Whang, K., & Krishnamurthy, R. (1991). The multilevel grid file a dynamic hierarchical multi-dimesional file structure. In Proceedings of the 2nd International Conference on Data-base Systems for Advanced Applications (DASFAA), Tokyo, Japan, (pp. 449-459).
15. Yang, J., & Widom, J. (2003). Incremental computation and maintenance of temporal aggregates. The VLDB Journal, 12(3), 262-283.
16. Ye, X., & Keane, J. A. (1997). Processing temporal aggregates in parallel. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Orlando, USA, (pp. 1373-1378).