Author:
Cho Hyung-Ju,Chung Chin-Wan
Subject
Computer Science Applications,Information Systems,Software
Reference18 articles.
1. N. Beckmann, H. Kriegel, R. Schneider, B. Seeger, The R∗-Tree: An Efficient and Robust Access Method for Points and Rectangles, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1990, pp. 322–331.
2. An adaptive indexing technique using spatio-temporal query workloads;Cho;Inform. Software Tech.,2004
3. J. Gray, A. Bosworth, A. Layman, H. Pirahesh, Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-total, in: Proceedings of International Conference on Data Engineering, 1996, pp. 152–159.
4. A. Guttman, R-Trees: a dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1984, pp. 47–57.
5. V. Harinarayan, A. Rajaraman, J. Ullman, Implementing data cubes efficiently, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1996, pp. 205–216.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献