메뉴 건너뛰기




Volumn 19, Issue 5, 2007, Pages 663-678

Indexing spatio-temporal trajectories with efficient polynomial approximations

Author keywords

Access methods; Spatio temporal databases

Indexed keywords

ACCESS METHODS; ONLINE PROCESSING; SPATIO-TEMPORAL DATABASES;

EID: 33947669847     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.1006     Document Type: Article
Times cited : (55)

References (37)
  • 3
    • 0025444516 scopus 로고
    • Implementation of Overlapping B-trees for Time and Space Efficient Representation
    • F. Burton, J. Kollias, V. Kollias, and D. Matsakis, "Implementation of Overlapping B-trees for Time and Space Efficient Representation," The Computer J., vol. 33, no. 3, pp. 279-280, 1990.
    • (1990) The Computer J , vol.33 , Issue.3 , pp. 279-280
    • Burton, F.1    Kollias, J.2    Kollias, V.3    Matsakis, D.4
  • 4
    • 3142777878 scopus 로고    scopus 로고
    • Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
    • Y. Cai and R. Ng, "Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials," Proc. ACM SIGMOD, pp. 599-610, 2004.
    • (2004) Proc. ACM SIGMOD , pp. 599-610
    • Cai, Y.1    Ng, R.2
  • 6
    • 33947709258 scopus 로고    scopus 로고
    • L. Chung, B. Worthington, R. Horst, and J. Gray, Windows 2000 Disk IO Performance, Microsoft Technical Report MS-TR-2000-55, 2000.
    • L. Chung, B. Worthington, R. Horst, and J. Gray, "Windows 2000 Disk IO Performance," Microsoft Technical Report MS-TR-2000-55, 2000.
  • 7
    • 0027983227 scopus 로고
    • Beyond Uniformity and Independence: Analysis of R-Trees Using the Concept of Fractal Dimension
    • C. Faloutsos and I. Kamel, "Beyond Uniformity and Independence: Analysis of R-Trees Using the Concept of Fractal Dimension," Proc. Symp. Principles of Database. Systems (PODS '94), pp. 4-13, 1994.
    • (1994) Proc. Symp. Principles of Database. Systems (PODS '94) , pp. 4-13
    • Faloutsos, C.1    Kamel, I.2
  • 8
  • 10
    • 0021615874 scopus 로고
    • R-Trees: A Dynamic Index Structure for Spatial Searching
    • A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 47-57, 1984.
    • (1984) Proc. ACM SIGMOD , pp. 47-57
    • Guttman, A.1
  • 16
    • 0031678569 scopus 로고    scopus 로고
    • Designing Access Methods for Bitemporal Databases
    • Jan./Feb
    • A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 1-20, Jan./Feb. 1998.
    • (1998) IEEE Trans. Knowledge and Data Eng , vol.10 , Issue.1 , pp. 1-20
    • Kumar, A.1    Tsotras, V.J.2    Faloutsos, C.3
  • 17
    • 0031673005 scopus 로고    scopus 로고
    • The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
    • Jan./Feb
    • M.-L. Lo and C.V. Ravishankar, "The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 136-152, Jan./Feb. 1998.
    • (1998) IEEE Trans. Knowledge and Data Eng , vol.10 , Issue.1 , pp. 136-152
    • Lo, M.-L.1    Ravishankar, C.V.2
  • 20
    • 33947684732 scopus 로고    scopus 로고
    • Federal Communications Commision
    • Federal Communications Commision, "Enhanced 911," http://www.fcc.gov/911/enhanced/, 2005.
    • (2005) Enhanced , vol.911
  • 24
    • 3142783648 scopus 로고    scopus 로고
    • STRIPES: An Efficient Index for Predicted Trajectories
    • J.M. Patel, Y. Chen, and V.P. Chakka, "STRIPES: An Efficient Index for Predicted Trajectories," Proc. ACM SIGMOD, pp. 637-646, 2004.
    • (2004) Proc. ACM SIGMOD , pp. 637-646
    • Patel, J.M.1    Chen, Y.2    Chakka, V.P.3
  • 29
    • 35248848370 scopus 로고    scopus 로고
    • SEB-Tree: An Approach to Index Continuously Moving Objects
    • Z. Song and N. Roussopoulos, "SEB-Tree: An Approach to Index Continuously Moving Objects," Mobile Data Management, pp. 340-344, 2003.
    • (2003) Mobile Data Management , pp. 340-344
    • Song, Z.1    Roussopoulos, N.2
  • 30
    • 3142713119 scopus 로고    scopus 로고
    • Prediction and Indexing of Moving Objects with Unknown Motion Patterns
    • Y. Tao, C. Faloutsos, D. Papadias, and B. Liu, "Prediction and Indexing of Moving Objects with Unknown Motion Patterns," Proc. ACM SIGMOD, pp. 611-622, 2004.
    • (2004) Proc. ACM SIGMOD , pp. 611-622
    • Tao, Y.1    Faloutsos, C.2    Papadias, D.3    Liu, B.4
  • 31
    • 84944314495 scopus 로고    scopus 로고
    • MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
    • Y. Tao and D. Papadias, "MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries," Proc. Very Large Data Bases Conf. (VLDB '01), pp. 431-440, 2001.
    • (2001) Proc. Very Large Data Bases Conf. (VLDB '01) , pp. 431-440
    • Tao, Y.1    Papadias, D.2
  • 32
    • 85009167046 scopus 로고    scopus 로고
    • The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries
    • Y. Tao, D. Papadias, and J. Sun, "The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries," Proc. Very Large Data Bases Conf. (VLDB '03), pp. 790-801, 2003.
    • (2003) Proc. Very Large Data Bases Conf. (VLDB '03) , pp. 790-801
    • Tao, Y.1    Papadias, D.2    Sun, J.3
  • 33
    • 0041401233 scopus 로고    scopus 로고
    • Cost Models for Overlapping and Multiversion Structures
    • Y. Tao, D. Papadias, and J. Zhang, "Cost Models for Overlapping and Multiversion Structures," ACM Trans. Database Systems, vol. 27, no. 3, pp. 299-342, 2002.
    • (2002) ACM Trans. Database Systems , vol.27 , Issue.3 , pp. 299-342
    • Tao, Y.1    Papadias, D.2    Zhang, J.3
  • 36
    • 0003137122 scopus 로고
    • RT-Tree: An Improved R-Tree Index Structure for Spatiotemporal Databases
    • X. Xu, J. Han, and W. Lu, "RT-Tree: An Improved R-Tree Index Structure for Spatiotemporal Databases," Proc. Int'l Symp. Spatial Data Handling, 1990.
    • (1990) Proc. Int'l Symp. Spatial Data Handling
    • Xu, X.1    Han, J.2    Lu, W.3


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