메뉴 건너뛰기




Volumn 2287, Issue , 2002, Pages 269-286

Dynamic queries over mobile objects

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; QUERY PROCESSING; SEARCH ENGINES;

EID: 84883770165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (41)

References (28)
  • 2
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In ACM SIGMOD, 1990.
    • (1990) ACM SIGMOD
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 4
    • 0040377588 scopus 로고    scopus 로고
    • NiagaraCQ: A scalable continuous query system for internet databa ses
    • J. Chen, D. J. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A scalable continuous query system for internet databa ses. In ACM SIGMOD, 2000.
    • (2000) ACM SIGMOD
    • Chen, J.1    Dewitt, D.J.2    Tian, F.3    Wang, Y.4
  • 5
    • 0021615874 scopus 로고
    • R-tree: A dynamic index structure for spatial searching
    • A. Guttman. R-tree: a dynamic index structure for spatial searching. In ACM SIGMOD, 1984.
    • (1984) ACM SIGMOD
    • Guttman, A.1
  • 6
    • 0032089982 scopus 로고    scopus 로고
    • Incremental distance join algorithms for spatial databases
    • G. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In ACM SIGMOD, 1998.
    • (1998) ACM SIGMOD
    • Hjaltason, G.1    Samet, H.2
  • 10
    • 0025625409 scopus 로고
    • The hB-Tree: A multiattribute indexing method with good guaranteed performance
    • D. Lomet and B. Salzberg. The hB-Tree: A multiattribute indexing method with good guaranteed performance. ACM TODS, 15(4):625-658, 1990.
    • (1990) ACM TODS , vol.15 , Issue.4 , pp. 625-658
    • Lomet, D.1    Salzberg, B.2
  • 11
    • 0025444581 scopus 로고
    • The performance of a multiversion access method
    • D. Lomet and B. Salzberg. The performance of a multiversion access method. In ACM SIGMOD, 1990.
    • (1990) ACM SIGMOD
    • Lomet, D.1    Salzberg, B.2
  • 12
    • 0001690978 scopus 로고    scopus 로고
    • Capturing the uncertainty of moving-object representations
    • D. Pfoser and C. Jensen. Capturing the uncertainty of moving-object representations. In SSD, 1999.
    • (1999) SSD
    • Pfoser, D.1    Jensen, C.2
  • 13
    • 84877359020 scopus 로고    scopus 로고
    • Novel approaches to the indexing of moving object trajectories
    • D. Pfoser, C. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. In VLDB, 2000.
    • (2000) VLDB
    • Pfoser, D.1    Jensen, C.2    Theodoridis, Y.3
  • 15
    • 0242327268 scopus 로고    scopus 로고
    • Querying mobile objects in spatiotemporal databases
    • Redondo Beach, CA, USA
    • K. Porkaew, I. Lazaridis, and S. Mehrotra. Querying mobile objects in spatiotemporal databases. In SSTD 2001, Redondo Beach, CA, USA.
    • In SSTD 2001
    • Porkaew, K.1    Lazaridis, I.2    Mehrotra, S.3
  • 16
    • 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. In ACM SIGMOD, 1981.
    • (1981) ACM SIGMOD
    • Robinson, J.T.1
  • 18
    • 0036203292 scopus 로고    scopus 로고
    • Indexing of moving objects for location-based services
    • S. Saltenis and C. Jensen. Indexing of moving objects for location-based services. In ICDE(to appear), 2002.
    • (2002) Icde(To Appear)
    • Saltenis, S.1    Jensen, C.2
  • 20
    • 84894104746 scopus 로고    scopus 로고
    • Comparison of access methods for time-evolving data
    • B. Salzberg and V. Tsotras. Comparison of access methods for time-evolving data. ACM Computing Surveys, 31(2):158-221, 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.2 , pp. 158-221
    • Salzberg, B.1    Tsotras, V.2
  • 21
    • 0021644214 scopus 로고
    • The quadtree and related hierarchial data structures
    • H. Samet. The quadtree and related hierarchial data structures. ACM Computing Surveys, 16(2):187-260, 1984.
    • (1984) ACM Computing Surveys , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1
  • 22
    • 2442431247 scopus 로고
    • The R+ tree: A dynamic index for multi-dimensional objects
    • T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+ tree: A dynamic index for multi-dimensional objects. In VLDB, 1987.
    • (1987) VLDB
    • Sellis, T.1    Roussopoulos, N.2    Faloutsos, C.3
  • 24
    • 0005298186 scopus 로고    scopus 로고
    • K-nearest neighbor search for moving query point
    • Z. Song and N. Roussopoulos. K-nearest neighbor search for moving query point. In SSTD, 2001.
    • (2001) SSTD
    • Song, Z.1    Roussopoulos, N.2
  • 25
    • 0002772972 scopus 로고    scopus 로고
    • . A quadtree based dynamic attribute indexing method
    • J. Tayeb, O. Ulusoy, and O.Wolfson. A quadtree based dynamic attribute indexing method. Computer Journal, 41(3):185-200, 1998.
    • (1998) Computer Journal , vol.41 , Issue.3 , pp. 185-200
    • Tayeb, J.1    Ulusoy, O.2    Wolfson, O.3


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