메뉴 건너뛰기




Volumn 1057 LNCS, Issue , 1996, Pages 592-614

Declustering spatial databases on a multi-computer architecture

Author keywords

Parallel data bases; Shared nothing architecture; Spatial access methods

Indexed keywords

DATABASE SYSTEMS; DECISION TREES; NETWORK ARCHITECTURE; TIME SERIES ANALYSIS;

EID: 84897744798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014180     Document Type: Conference Paper
Times cited : (24)

References (44)
  • 1
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • September
    • Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. Proc. of VLDB Conf., pages 487-499, September 1994.
    • (1994) Proc. of VLDB Conf. , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • September
    • J.L. Bentley. Multidimensional binary search trees used for associative searching. CACM, 18(9):509-517, September 1975.
    • (1975) CACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 5
    • 0027621672 scopus 로고
    • Efficient processing of spatial joins using r-trees
    • May
    • Thomas Brinkhoff, Hans-Peter Kriegel, and Bernhard Seeger. Efficient processing of spatial joins using r-trees. Proc. of ACM SIGMOD, pages 237-246, May 1993.
    • (1993) Proc. of ACM SIGMOD , pp. 237-246
    • Brinkhoff, T.1    Kriegel, H.-P.2    Seeger, B.3
  • 6
    • 0025447750 scopus 로고
    • The r*-tree: An efficient and robust access method for points and rectangles
    • May
    • N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD, pages 322-331, May 1990.
    • (1990) ACM SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 7
    • 0000768333 scopus 로고
    • Measured capacity of an ethernet: Myths and reality
    • David Boggs, Jeffrey C. Mogul, and Christopher A. Kent. Measured capacity of an ethernet: Myths and reality. WRL Research Report 88/4, 1988.
    • (1988) WRL Research Report , vol.88 , Issue.4
    • Boggs, D.1    Mogul, J.C.2    Kent, C.A.3
  • 8
    • 0002260865 scopus 로고
    • Declustering objects for visualization
    • August, to appear
    • Ling Tony Chen and Doron Rotem. Declustering objects for visualization. Proc. VLDB Conf, August 1993. to appear.
    • (1993) Proc. VLDB Conf
    • Chen, L.T.1    Rotem, D.2
  • 11
    • 0020098779 scopus 로고
    • Disk allocation for cartesian product files on multiple disk systems
    • March
    • H.C. Du and J.S. Sobolewski. Disk allocation for cartesian product files on multiple disk systems. ACM Trans. Database Systems (TODS), 7(1):82-101, March 1982.
    • (1982) ACM Trans. Database Systems (TODS) , vol.7 , Issue.1 , pp. 82-101
    • Du, H.C.1    Sobolewski, J.S.2
  • 14
    • 0027983227 scopus 로고
    • Beyond uniformity and independence: Analysis of r-trees using the concept of fractal dimension
    • May. Also available as CS-TR-3198, UMIACS-TR-93-130
    • Christos Faloutsos and Ibrahim Kamel. Beyond uniformity and independence: Analysis of r-trees using the concept of fractal dimension. Proc. A CM SIGACT-SIGMOD-SIGART PODS, pages 4-13, May 1994. Also available as CS-TR-3198, UMIACS-TR-93-130.
    • (1994) Proc. Acm Sigact-Sigmod-Sigart Pods , pp. 4-13
    • Faloutsos, C.1    Kamel, I.2
  • 18
    • 84976747179 scopus 로고
    • The bang file: A new kind of grid file
    • May
    • Michael Freeston. The bang file: a new kind of grid file. Proc. of ACM SIGMOD, pages 260-269, May 1987.
    • (1987) Proc. of ACM SIGMOD , pp. 260-269
    • Freeston, M.1
  • 19
    • 84976765201 scopus 로고
    • A general solution of the n-dimensional b-tree problem
    • May
    • Michael Freeston. A general solution of the n-dimensional b-tree problem. Proc. of ACM-SIGMOD, pages 80-91, May 1995.
    • (1995) Proc. of ACM -SIGMOD , pp. 80-91
    • Freeston, M.1
  • 20
    • 0020249952 scopus 로고
    • An effective way to represent quadtrees
    • December
    • I. Gargantini. An effective way to represent quadtrees. Comm. of ACM (CACM), 25(12):905-910, December 1982.
    • (1982) Comm. of ACM (CACM) , vol.25 , Issue.12 , pp. 905-910
    • Gargantini, I.1
  • 21
    • 84976712175 scopus 로고
    • A performance analysis of alternative multi-attribute declustering strategies
    • June
    • Shahram Ghandeharizadeh, David J. DeWitt, and W. Qureshi. A performance analysis of alternative multi-attribute declustering strategies. SIGMOD Conf., June 1992.
    • (1992) SIGMOD Conf.
    • Ghandeharizadeh, S.1    De Witt, D.J.2    Qureshi, W.3
  • 22
    • 84897684906 scopus 로고
    • The cell tree: An index for geometric data
    • Univ. of California, Berkeley, December
    • O. Gunther. The cell tree: an index for geometric data. Memorandum No. UCB/ERL M86/89, Univ. of California, Berkeley, December 1986.
    • (1986) Memorandum No. UCB/ERL M86/89
    • Gunther, O.1
  • 24
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • June
    • A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD, pages 47-57, June 1984.
    • (1984) Proc. ACM SIGMOD , pp. 47-57
    • Guttman, A.1
  • 26
    • 0025446215 scopus 로고
    • Linear clustering of objects with multiple attributes
    • May
    • H.V. Jagadish. Linear clustering of objects with multiple attributes. ACM SIGMOD Conf., pages 332-342, May 1990.
    • (1990) ACM SIGMOD Conf. , pp. 332-342
    • Jagadish, H.V.1
  • 27
    • 84976711647 scopus 로고
    • Parallel r-trees
    • June. Also available as Tech. Report UMIACS TR 92-1, CS-TR-2820
    • Ibrahim Kamel and Christos Faloutsos. Parallel r-trees. Proc. of ACM SIGMOD Conf., pages 195-204, June 1992. Also available as Tech. Report UMIACS TR 92-1, CS-TR-2820.
    • (1992) Proc. of ACM SIGMOD Conf. , pp. 195-204
    • Kamel, I.1    Faloutsos, C.2
  • 29
    • 0002842113 scopus 로고
    • Hilbert r-tree: An improved r-tree using fractals
    • Santiago, Chile, September
    • Ibrahim Kamel and Christos Faloutsos. Hilbert r-tree: an improved r-tree using fractals. In Proc. of VLDB Conference, pages 500-509, Santiago, Chile, September 1994.
    • (1994) Proc. of VLDB Conference , pp. 500-509
    • Kamel, I.1    Faloutsos, C.2
  • 30
    • 84944068462 scopus 로고
    • Optimal file distribution for partial match retrieval
    • June
    • M.H. Kim and S. Pramanik. Optimal file distribution for partial match retrieval. Proc. ACM SIGMOD Conf., pages 173-182, June 1988.
    • (1988) Proc. ACM SIGMOD Conf. , pp. 173-182
    • Kim, M.H.1    Pramanik, S.2
  • 31
    • 84976678680 scopus 로고
    • Segment indexes: Dynamic indexing techniques for multi-dimensional interval data
    • May
    • Curtis P. Kolovson and Michael Stonebraker. Segment indexes: Dynamic indexing techniques for multi-dimensional interval data. Proc. ACM SIGMOD, pages 138-147, May 1991.
    • (1991) Proc. ACM SIGMOD , pp. 138-147
    • Kolovson, C.P.1    Stonebraker, M.2
  • 32
    • 0025625409 scopus 로고
    • The hb-tree: A multiattribute indexing method with good guaranteed performance
    • December
    • David B. Lomet and Betty Salzberg. The hb-tree: a multiattribute indexing method with good guaranteed performance. ACM TODS, 15(4):625-658, December 1990.
    • (1990) ACM TODS , vol.15 , Issue.4 , pp. 625-658
    • Lomet, D.B.1    Salzberg, B.2
  • 33
    • 0021392590 scopus 로고
    • The grid file: An adaptable, symmetric multikey file structure
    • March
    • J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM TODS, 9(1):38-71, March 1984.
    • (1984) ACM TODS , vol.9 , Issue.1 , pp. 38-71
    • Nievergelt, J.1    Hinterberger, H.2    Sevcik, K.C.3
  • 35
    • 84976784176 scopus 로고
    • Spatial query processing in an object-oriented database system
    • May
    • J. Orenstein. Spatial query processing in an object-oriented database system. Proc. ACM SIGMOD, pages 326-336, May 1986.
    • (1986) Proc. ACM SIGMOD , pp. 326-336
    • Orenstein, J.1
  • 36
    • 0022286609 scopus 로고
    • Direct spatial search on pictorial databases using packed r-trees
    • May
    • N. Roussopoulos and D. Leifker. Direct spatial search on pictorial databases using packed r-trees. Proc. ACM SIGMOD, May 1985.
    • (1985) Proc. ACM SIGMOD
    • Roussopoulos, N.1    Leifker, D.2
  • 37
    • 85010847034 scopus 로고
    • The k-d-b-tree: A search structure for large multidimensional dynamic indexes
    • J.T. Robinson. The k-d-b-tree: a search structure for large multidimensional dynamic indexes. Proc. ACM SIGMOD, pages 10-18, 1981.
    • (1981) Proc. ACM SIGMOD , pp. 10-18
    • Robinson, J.T.1
  • 39
    • 0000561280 scopus 로고
    • The r+ tree: A dynamic index for multi-dimensional objects
    • England, September. also available as SRC-TR-87-32, UMIACS-TR-87-3, CS-TR-1795
    • T. Sellis, N. Roussopoulos, and C. Faloutsos. The r+ tree: a dynamic index for multi-dimensional objects. In Proc. 13th International Conference on VLDB, pages 507-518, England, September 1987. also available as SRC-TR-87-32, UMIACS-TR-87-3, CS-TR-1795.
    • (1987) Proc. 13th International Conference on VLDB , pp. 507-518
    • Sellis, T.1    Roussopoulos, N.2    Faloutsos, C.3
  • 42
    • 0345149138 scopus 로고
    • Application Mathematics Research Staff, Statistical Research Division, U.S. Bureau of the Census, December
    • M. White. N-Trees: Large Ordered Indexes for Multi-Dimensional Space. Application Mathematics Research Staff, Statistical Research Division, U.S. Bureau of the Census, December 1981.
    • (1981) Large Ordered Indexes for Multi-Dimensional Space
    • White. N-Trees, M.1
  • 43
    • 0023401397 scopus 로고
    • On multiple random accesses and physical data placement in dynamic files
    • August
    • J.-H. Wang, T.-S. Yuen, and D.H.-C. Du. On multiple random accesses and physical data placement in dynamic files. IEEE Trans, on Software Engineering, SE-13(8):977-987, August 1987.
    • (1987) IEEE Trans, on Software Engineering , vol.SE-13 , Issue.8 , pp. 977-987
    • Wang, J.-H.1    Yuen, T.-S.2    Du, D.H.-C.3
  • 44
    • 84976732525 scopus 로고
    • Dynamic file allocation in disk arrays
    • May
    • Gerhard Weikum, Peter Zabback, and Peter Scheuermann. Dynamic file allocation in disk arrays. Proc. ACM SIGMOD, pages 406-415, May 1991.
    • (1991) Proc. ACM SIGMOD , pp. 406-415
    • Weikum, G.1    Zabback, P.2    Scheuermann, P.3


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