메뉴 건너뛰기




Volumn , Issue , 1997, Pages 416-425

A region splitting strategy for physical database design of multidimensional file organizations

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DESIGN; QUERY LANGUAGES; QUERY PROCESSING; SOCIETIES AND INSTITUTIONS;

EID: 84994071322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (17)
  • 1
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley, J. L., "Multidimensional Binary Search Trees Used for Associative Searching," Comm. of the ACM, Vol. 18, No. 9, pp. 509-517, 1975.
    • (1975) Comm. of the ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 2
    • 0004092884 scopus 로고
    • Benjamin/Cummings Publishing Co., Redwood City, California, Second Ed
    • Elmasri, R. and Navathe, S. B., Fundamentals of Database Systems, Benjamin/Cummings Publishing Co., Redwood City, California, Second Ed., 1994.
    • (1994) Fundamentals of Database Systems
    • Elmasri, R.1    Navathe, S.B.2
  • 3
    • 0023980306 scopus 로고
    • Physical database design for relational databases
    • Mar
    • Finkelstein, S. et al., "Physical Database Design for Relational Databases," ACM Trans, on Database Systems, Vol. 13, No. 1, pp. 91-128, Mar. 1988.
    • (1988) ACM Trans, on Database Systems , vol.13 , Issue.1 , pp. 91-128
    • Finkelstein, S.1
  • 5
    • 0024718813 scopus 로고
    • The lsd tree: Spatial access to multidimensional point and non point objects
    • Aug
    • Henrich, A. et al., "The LSD tree: Spatial Access to Multidimensional Point and Non Point Objects," In Proc. Intl. Conf. on Very Large Data Bases, pp. 45-53, Aug. 1989.
    • (1989) Proc. Intl. Conf. on Very Large Data Bases , pp. 45-53
    • Henrich, A.1
  • 6
    • 0028405250 scopus 로고
    • G-tree: A new data structure for organizing multidimensional data
    • Apr
    • Kumar, A., "G-tree: A New Data Structure for Organizing Multidimensional Data," IEEE Trans, on Knowledge and Data Engineering, Vol. 6, No. 2, pp. 341-347, Apr. 1994.
    • (1994) IEEE Trans, on Knowledge and Data Engineering , vol.6 , Issue.2 , pp. 341-347
    • Kumar, A.1
  • 7
    • 84994115788 scopus 로고    scopus 로고
    • A physical database design method for multidimensional file organizations
    • KAIST, Nov
    • Lee, J. H. et al., A Physical Database Design Method for Multidimensional File Organizations, Technical Report CS/TR-96-104, Computer Science Department, KAIST, Nov. 1996.
    • (1996) Technical Report CS/TR-96-104, Computer Science Department
    • Lee, J.H.1
  • 8
    • 0025625409 scopus 로고
    • The hb-tree: A multiattribute indexing method with good guaranteed performance
    • Dec
    • Lomet, D. and Salzberg, B., "The hB-tree: A Multiattribute Indexing Method with Good Guaranteed Performance," ACM Trans, on Database Systems, Vol. 15, No. 4, pp. 625-658, Dec. 1990.
    • (1990) ACM Trans, on Database Systems , vol.15 , Issue.4 , pp. 625-658
    • Lomet, D.1    Salzberg, B.2
  • 9
    • 0027641975 scopus 로고
    • A balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristics
    • Aug
    • Nakamura, Y. et al., "A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics," IEEE Trans, on Knowledge and Data Engineering, Vol. 5, No. 4, pp. 682-694, Aug. 1993.
    • (1993) IEEE Trans, on Knowledge and Data Engineering , vol.5 , Issue.4 , pp. 682-694
    • Nakamura, Y.1
  • 10
    • 0021392590 scopus 로고
    • The grid file: An adaptable, symmetric multikey file structure
    • Mar
    • Nievergelt, J. et al., "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans, on Database Systems, Vol. 9, No. 1, pp. 38-71, Mar. 1984.
    • (1984) ACM Trans, on Database Systems , vol.9 , Issue.1 , pp. 38-71
    • Nievergelt, J.1
  • 11
    • 85010847034 scopus 로고
    • The k-d-b-tree: A search structure for large multidimensional dynamic indexes
    • Ann Arbor, Michigan, Apr
    • Robinson, J. T., "The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes," In Proc. Intl. Conf. on Management of Data, ACM SIGMOD, pp. 10-18, Ann Arbor, Michigan, Apr. 1981.
    • (1981) Proc. Intl. Conf. on Management of Data, ACM SIGMOD , pp. 10-18
    • Robinson, J.T.1
  • 12
    • 0001978055 scopus 로고
    • The buddy-tree: An efficient and robust access method for spatial data base systems
    • Brisbane, Australia, Aug
    • Seeger, B. and Krieger, H. P., "The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems," In Proc. Intl. Conf. on Very Large Data Bases, pp. 590-601, Brisbane, Australia, Aug. 1990.
    • (1990) Proc. Intl. Conf. on Very Large Data Bases , pp. 590-601
    • Seeger, B.1    Krieger, H.P.2
  • 13
    • 0021393083 scopus 로고
    • Separability-an approach to physical database design
    • Mar
    • Whang, K. Y. et al., "Separability-An Approach to Physical Database Design," IEEE Trans, on Computers, Vol. c-33, No. 3, pp. 209-222, Mar. 1984.
    • (1984) IEEE Trans, on Computers , Issue.3 , pp. 209-222
    • Whang, K.Y.1
  • 16
    • 0001997121 scopus 로고
    • Dynamic maintenance of data distribution for selectivity estimation
    • Jan
    • Whang, K.Y., Kim, S. W., and Wiederhold, G., "Dynamic Maintenance of Data Distribution for Selectivity Estimation," The VLDB Journal, Vol. 3, No. 1, pp. 29-51, Jan. 1994.
    • (1994) The VLDB Journal , vol.3 , Issue.1 , pp. 29-51
    • Whang, K.Y.1    Kim, S.W.2    Wiederhold, G.3
  • 17
    • 0022076368 scopus 로고
    • Adaptive record clustering
    • June
    • Yu, C. T. et al., "Adaptive Record Clustering," ACM Trans, on Database Systems, Vol. 10, No. 2, pp. 180-204, June 1985.
    • (1985) ACM Trans, on Database Systems , vol.10 , Issue.2 , pp. 180-204
    • Yu, C.T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.