|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| D. Rotem, A. Segev, "Algorithms for Multidimensional Partitioning of Static Files," IEEE Transactions on Software Engineering, vol. 14, no. 11, pp. 1700-1710, November, 1988. | |||
| BibTex | x | ||
| @article{ 10.1109/32.9056, author = {D. Rotem and A. Segev}, title = {Algorithms for Multidimensional Partitioning of Static Files}, journal ={IEEE Transactions on Software Engineering}, volume = {14}, number = {11}, issn = {0098-5589}, year = {1988}, pages = {1700-1710}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.9056}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Algorithms for Multidimensional Partitioning of Static Files IS - 11 SN - 0098-5589 SP1700 EP1710 EPD - 1700-1710 A1 - D. Rotem, A1 - A. Segev, PY - 1988 KW - database theory; multidimensional partitioning; static files; multidimensional file partitioning; search attribute space; physical disk locations; range queries; file organizations; static algorithm; storage utilization; database management systems; database theory; file organisation VL - 14 JA - IEEE Transactions on Software Engineering ER - | |||
The problem of multidimensional file partitioning (MDFP) arises in large databases that are subject to frequent range queries on one or more attributes. In an MDFP scheme, the search attribute space is partitioned into cells, which are mapped to physical disk locations. This mapping preserves the order of the search attribute values so that range queries can be answered most efficiently, while maintaining good performance for other types of queries. Recently, MDFP schemes have been suggested to include both dynamic and static file organizations. Optimal and heuristic MDFP algorithms are developed for the static case. The results of extensive computational experiments show that the proposed heuristics perform better than known static ones. It is also shown that incorporating a static algorithm into a dynamic MDFP such as a grid file at conversion and/or periodical reorganization points significantly improves the resulting storage utilization of the data file and decreases the size of the directory file.
[1] A. V. Aho and J. D. Ullman, "Optimal partial match retrieval when fields are independently specified,"ACM TODS, vol. 4, no. 2, pp. 168-179, June 1979.
[2] J. L. Bentley, "Multidimensional binary search trees in database applications,"IEEE Trans. Software Eng., vol. SE-5, pp. 330-340, 1979.
[3] A. Bolour, "Optimality properties of multiple key hashing functions,"J. ACM, vol. 26, no. 2, pp. 196-210, Apr. 1979.
[4] G. Held and M. Stonebraker, "B-trees re-examined,"Commun. ACM, vol. 21, no. 2, pp. 139-143, Feb. 1978.
[5] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[6] T. H. Merret, "Multidimensional paging for efficient database querying," inProc. ICMOD 1978, 1978, pp. 277-290.
[7] T. H. Merret and E. J. Otoo, "Dynamic multipaging: A storage structure for large shared data banks," inImproving Database Usability and Responsiveness, P. Scheurmann, ed. New York: Academic, 1982, pp. 237-256.
[8] T. H. Merrett,Relational Information System. Reston, VA: Reston Publishing, 1984.
[9] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[10] E. A. Ozkarahan and M. Ouksel, "Dynamic and order preserving data partitioning for database machines," inProc. VLDB, Stockholm, Sweden, 1985, pp. 358-368.
[11] E. Ozkarahan,Database Machines and Database Management. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[12] M. Regnier, "Analysis of grid file algorithms,"Bit, vol. 25, pp. 335-337, 1985.
[13] J. T. Robinson, "The K-D-B tree: A search structure for large multidimensional dynamic indexes," inProc. VLDB, 1981, pp. 10-18.
[14] P. Scheuermann and M. Ouksel, "Multidimensional B-trees for associative searching in database systems,"Inform. Syst., vol. 7, no. 2, pp. 123-137, 1982.
[15] M. K. Vernon, E.D. Lazowska, and J. Zahorjan, "An accurate and efficient performance analysis technique for multiprocessor snooping cache-consistency protocols," inProc. 15th Annu. Int. Symp. Comput. Architecture, Honolulu, HI, May 1988, pp. 308-315.
[16] A. Shoshani and K. Kawagoe, "Temporal data management," inProc. VLDB, Kyoto, Japan, 1986, pp. 79-88.
[17] P. Valduries and Y. Viemont, "A multikey hashing scheme using predicate trees,"ACM-SIGMOD Rec., vol. 14, no. 2, 1984.