메뉴 건너뛰기




Volumn , Issue , 2004, Pages 695-706

Approximation techniques for spatial data

Author keywords

[No Author keywords available]

Indexed keywords


EID: 3142676598     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007568.1007646     Document Type: Conference Paper
Times cited : (22)

References (30)
  • 1
    • 0033877659 scopus 로고    scopus 로고
    • Accurate estimation of the cost of spatial selections
    • A. Aboulnaga and J. F. Naughton. Accurate estimation of the cost of spatial selections. In Proc. ICDE, pages 123-134, 2000.
    • (2000) Proc. ICDE , pp. 123-134
    • Aboulnaga, A.1    Naughton, J.F.2
  • 2
    • 0345826314 scopus 로고    scopus 로고
    • Selectivity estimation in spatial databases
    • S. Acharya, V. Poosala, and S. Ramaswamy. Selectivity estimation in spatial databases. In Proc. SIGMOD, pages 13-24, 1999.
    • (1999) Proc. SIGMOD , pp. 13-24
    • Acharya, S.1    Poosala, V.2    Ramaswamy, S.3
  • 3
    • 0032678623 scopus 로고    scopus 로고
    • Tracking join and self-join sizes in limited storage
    • N. Alon, P. B. Gibbons, Y. Matias, and M. Szegedy. Tracking join and self-join sizes in limited storage. In Proc. PODS, pages 10-20, 1999.
    • (1999) Proc. PODS , pp. 10-20
    • Alon, N.1    Gibbons, P.B.2    Matias, Y.3    Szegedy, M.4
  • 4
    • 0029719644 scopus 로고    scopus 로고
    • The space complexity of approximating the frequency moments
    • N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. STOC, pages 20-29, 1996.
    • (1996) Proc. STOC , pp. 20-29
    • Alon, N.1    Matias, Y.2    Szegedy, M.3
  • 5
    • 0034996150 scopus 로고    scopus 로고
    • Selectivity estimation for spatial joins
    • N. An, Z.-Y. Yang, and A. Sivasubramaniam. Selectivity estimation for spatial joins. In Proc. ICDE, pages 368-375, 2001.
    • (2001) Proc. ICDE , pp. 368-375
    • An, N.1    Yang, Z.-Y.2    Sivasubramaniam, A.3
  • 7
    • 20744439022 scopus 로고    scopus 로고
    • Reductions in streaming algorithms, with an application to counting triangles in graphs
    • Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. SODA, pages 623-632, 2002.
    • (2002) Proc. SODA , pp. 623-632
    • Bar-Yossef, Z.1    Kumar, R.2    Sivakumar, D.3
  • 8
    • 0032035979 scopus 로고    scopus 로고
    • Self-spacial join selectivity estimation using fractal concepts
    • A. Belussi and C. Faloutsos. Self-spacial join selectivity estimation using fractal concepts. Proc. ACM TOIS, 16(2):161-201, 1998.
    • (1998) Proc. ACM TOIS , vol.16 , Issue.2 , pp. 161-201
    • Belussi, A.1    Faloutsos, C.2
  • 9
    • 0029752712 scopus 로고    scopus 로고
    • Parallel processing of spatial joins using R-trees
    • T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Parallel processing of spatial joins using R-trees. In Proc. ICDE, pages 258-265, 1996.
    • (1996) Proc. ICDE , pp. 258-265
    • Brinkhoff, T.1    Kriegel, H.-P.2    Seeger, B.3
  • 10
    • 84869158135 scopus 로고    scopus 로고
    • Finding frequent items in data streams
    • M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. ICALP, pages 693-703, 2002.
    • (2002) Proc. ICALP , pp. 693-703
    • Charikar, M.1    Chen, K.2    Farach-Colton, M.3
  • 11
    • 1142305378 scopus 로고    scopus 로고
    • What's hot and what's not: Tracking most frequent items dynamically
    • G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In Proc. PODS, pages 296-306, 2003.
    • (2003) Proc. PODS , pp. 296-306
    • Cormode, G.1    Muthukrishnan, S.2
  • 12
    • 35048819960 scopus 로고    scopus 로고
    • An improved data stream summary: The count-min sketch and its applications
    • G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. In LATIN, pages 29-38, 2004.
    • (2004) LATIN , pp. 29-38
    • Cormode, G.1    Muthukrishnan, S.2
  • 14
  • 16
    • 35048881542 scopus 로고    scopus 로고
    • Processing data-stream join aggregates using skimmed sketches
    • S. Ganguly, M. N. Garofalakis, and R. Rastogi. Processing data-stream join aggregates using skimmed sketches. In Proc. EDBT, pages 569-586, 2004.
    • (2004) Proc. EDBT , pp. 569-586
    • Ganguly, S.1    Garofalakis, M.N.2    Rastogi, R.3
  • 17
    • 0037622270 scopus 로고    scopus 로고
    • How to summarize the universe: Dynamic maintenance of quantiles
    • A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the universe: Dynamic maintenance of quantiles. In Proc. VLDB, pages 454-465, 2002.
    • (2002) Proc. VLDB , pp. 454-465
    • Gilbert, A.C.1    Kotidis, Y.2    Muthukrishnan, S.3    Strauss, M.4
  • 20
    • 0030675720 scopus 로고    scopus 로고
    • A cost model for estimating the performance of spatial joins using R-trees
    • Y.-W. Huang, N. Jing, and E. A. Rundensteiner. A cost model for estimating the performance of spatial joins using R-trees. In Proc. SSDBM, pages 30-38, 1997.
    • (1997) Proc. SSDBM , pp. 30-38
    • Huang, Y.-W.1    Jing, N.2    Rundensteiner, E.A.3
  • 21
    • 0033901672 scopus 로고    scopus 로고
    • Analyzing range queries on spatial data
    • J. Jin, N. An, and A. Sivasubramaniam. Analyzing range queries on spatial data. In Proc. ICDE, pages 525-534, 2000.
    • (2000) Proc. ICDE , pp. 525-534
    • Jin, J.1    An, N.2    Sivasubramaniam, A.3
  • 22
    • 5544234916 scopus 로고    scopus 로고
    • A cost model for interval intersection queries on RI-trees
    • H.-P. Kriegel, M. Pfeifle, M. Pötke, and T. Seidl. A cost model for interval intersection queries on RI-trees. In Proc. SSDBM, pages 131-141, 2002.
    • (2002) Proc. SSDBM , pp. 131-141
    • Kriegel, H.-P.1    Pfeifle, M.2    Pötke, M.3    Seidl, T.4
  • 23
    • 84944052718 scopus 로고    scopus 로고
    • Selectivity estimation of complex spatial queries
    • N. Mamoulis and D. Papadias. Selectivity estimation of complex spatial queries. In Proc. SSTD, pages 155-174, 2001.
    • (2001) Proc. SSTD , pp. 155-174
    • Mamoulis, N.1    Papadias, D.2
  • 24
    • 84976651595 scopus 로고
    • Topological relations in the world of minimum bounding rectangles: A study with R-trees
    • D. Papadias, Y. Theodoridis, T. K. Sellis, and M. J. Egenhofer. Topological relations in the world of minimum bounding rectangles: A study with R-trees. In Proc. SIGMOD, pages 92-103, 1995.
    • (1995) Proc. SIGMOD , pp. 92-103
    • Papadias, D.1    Theodoridis, Y.2    Sellis, T.K.3    Egenhofer, M.J.4
  • 25
    • 0036209207 scopus 로고    scopus 로고
    • Exploring spatial datasets with histograms
    • C. Sun, D. Agrawal, and A. El Abbadi. Exploring spatial datasets with histograms. In Proc. ICDE, pages 93-102, 2002.
    • (2002) Proc. ICDE , pp. 93-102
    • Sun, C.1    Agrawal, D.2    El Abbadi, A.3
  • 26
    • 84883759307 scopus 로고    scopus 로고
    • Selectivity estimation for spatial joins with geometric selections
    • C. Sun, D. Agrawal, and A. El Abbadi. Selectivity estimation for spatial joins with geometric selections. In Proc. EDBT, pages 609-626, 2002.
    • (2002) Proc. EDBT , pp. 609-626
    • Sun, C.1    Agrawal, D.2    El Abbadi, A.3
  • 29
    • 0029706786 scopus 로고    scopus 로고
    • A model for the prediction of R-tree performance
    • Y. Theodoridis and T. K. Sellis. A model for the prediction of R-tree performance. In Proc. PODS, pages 161-171, 1996.
    • (1996) Proc. PODS , pp. 161-171
    • Theodoridis, Y.1    Sellis, T.K.2
  • 30
    • 33747610636 scopus 로고    scopus 로고
    • Efficient cost models for spatial queries using R-trees
    • Y. Theodoridis, E. Stefanakis, and T. K. Sellis. Efficient cost models for spatial queries using R-trees. IEEE TKDE, 12(1), 2000.
    • (2000) IEEE TKDE , vol.12 , pp. 1
    • Theodoridis, Y.1    Stefanakis, E.2    Sellis, T.K.3


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