|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Thomas A. Mueck, Manfred J. Schauer, "Optimizing Sort Order Query Execution in Balanced and Nested Grid Files," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 2, pp. 246-260, April, 1995. | |||
| BibTex | x | ||
| @article{ 10.1109/69.382295, author = {Thomas A. Mueck and Manfred J. Schauer}, title = {Optimizing Sort Order Query Execution in Balanced and Nested Grid Files}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {2}, issn = {1041-4347}, year = {1995}, pages = {246-260}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.382295}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Optimizing Sort Order Query Execution in Balanced and Nested Grid Files IS - 2 SN - 1041-4347 SP246 EP260 EPD - 246-260 A1 - Thomas A. Mueck, A1 - Manfred J. Schauer, PY - 1995 KW - Disk access plans KW - heuristic optimization KW - internal database structures KW - multiattribute search structures KW - query processing KW - sort order queries. VL - 7 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
Two algorithms for the construction of appropriate disk access plans are proposed, namely a greedy approach and a heuristic divide-and-conquer approach. Both approaches yield considerable I/O savings compared to straightforward query processing without consideration of any directory order information. The former performs well for small buffer page allocations, i.e., for a small number of buffer pages relative to the number of data buckets processed in the query. The latter is superior to the greedy algorithm with respect to the total number of I/O operations and with respect to the overall maximum of buffer pages needed to achieve the minimal number of disk I/O operations.
Both approaches rely on a binary trie as a temporary data structure. This trie is used as an explicit representation of the order information. The storage consumption of the temporary data structure is shown to be negligible in realistic cases. Even for pathological cases with respect to degenerated balanced and nested grid files, reasonable upper bounds can be given.
[1] M.W. Freeston,“Data structures for knowledge bases: Multi-dimensional Fileorganizations,” Technical report no. TR-KB-13, ECRC München, 1986.
[2] M. Freeston, “The BANG File: A New Kind of Grid File,” Proc. ACM SIGMOD Conf. Management of Data, 1987.
[3] M.W. Freeston,“Advances in the design of the BANG file,” Proc. Third Int’l Conf. Foundations of Data Organization and Algorithms,Paris, 1989.
[4] O. Guenther and A. Buchmann, "Research Issues in Spatial Databases," ACM SIGMOD Record, vol. 19, no. 4, pp. 61-67, 1990.
[5] O. Guenther,“Efficient structures for geometric data management,” Lecture notes in Computer Science no. 337, Springer Verlag, 1988.
[6] K.H. Hinrichs,“The grid file system: Implementation and case studies ofapplications,” Doctoral thesis 7734, ETH Zürich, 1985.
[7] L. Harada,M. Nakano,M. Kitsuregawa,, and M. Takagi,“Query processing method for multi-attribute clustered relations,” Proc. 16th VLDB Conf.,Brisbane, 1990.
[8] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[9] D. Lomet and B. Salzberg, "The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance," ACM Trans. Database Systems. vol. 15, no. 4, pp. 625-658, Dec. 1990.
[10] K. Mehlhorn,Data structures and algorithms, vol. 1, Teubner Verlag, 1984.
[11] T.A. Mueck and M.J. Schauer,“Sorting in the BANG-file,” Technical Report ISI-InfoSys-109-91, Dept. of Information Systems,Univ. of Vienna, 1991.
[12] R. Ng,C. Faloutsos,, and T. Sellis,“Flexible buffer allocation based on marginal gains,” Proc. 1991 ACM SIGMOD Conf.,Denver, 1991.
[13] J. Nievergelt,“7+−2 criteria for assessing and comparing spatial data structures,” in A. Buchmann, O. Guenther, T.R. Smith, and Y.F. Wang eds. Design and Implementation of Large Spatial Databases, Lecture notes inComputer Science no. 409, Springer Verlag, 1990.
[14] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Systems, vol. 9, no. 1, pp. 38-71, Mar. 1984.
[15] E.J. Otoo,“Balanced multidimensional extendible hash tree,” Proc. Fifth ACM SIGACT/ SIGMOD Symp. Principles of Database Systems, 1986.
[16] E.A. Ozkarahan and M. Ouksel,“Dynamic and order preserving data partitioning for databasemachines,” Proc. 11th VLDB Conf.,Stockholm, 1985.
[17] J.T. Robinson, “The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 10-18, 1981.
[18] B. Salzberg, File Structures. Prentice Hall, 1988.
[19] B. Salzberg and D.B. Lomet,“Spatial database access methods,” SIGMOD RECORD vol. 20, no. 3, ACM Press, 1991.
[20] D. Schneider and D. DeWitt, “A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment,” ACM SIGMOD Record, vol. 18, no. 2, pp. 110-121, June 1989.
[21] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[22] J. Witzmann, The DING file, master thesis, Dept. of Information Systems,Univ. of Vienna, 1991.