메뉴 건너뛰기




Volumn , Issue , 2010, Pages 243-254

Processing proximity relations in road networks

Author keywords

constraint processing; location constraint; location query; location based services; publish subscribe; road networks

Indexed keywords

CONSTRAINT PROCESSING; CONTINUOUS QUERIES; LOCATION UPDATE; LOCATION-BASED SERVICES; MOVING OBJECT INDEXING; MOVING OBJECTS; ON-LINE GAMING; PUBLISH/SUBSCRIBE; REAL WORLD DATA; ROAD NETWORK; SPATIOTEMPORAL QUERIES; TRAVEL COSTS; TRAVEL TIME;

EID: 77954734049     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807196     Document Type: Conference Paper
Times cited : (36)

References (30)
  • 1
    • 77954753282 scopus 로고    scopus 로고
    • Cabspotting. http://cabspotting.org.
  • 3
    • 8344271254 scopus 로고    scopus 로고
    • Buddy Tracking - Efficient Proximity Detection among Mobile Friends
    • Arnon Amir et al. Buddy Tracking - Efficient Proximity Detection Among Mobile Friends. In INFOCOM, 2004.
    • (2004) INFOCOM
    • Amir, A.1
  • 4
    • 77954719401 scopus 로고    scopus 로고
    • J. Basch
    • Ph.D. thesis, Stanford University, Computer Science Dept.
    • J. Basch. Kinetic Data Structures. Ph.D. thesis, Stanford University, Computer Science Dept., 1999.
    • (1999) Kinetic Data Structures
  • 5
    • 34548749756 scopus 로고    scopus 로고
    • Efficient Evaluation of All-Nearest-Neighbors Queries
    • Y. Chen and J. M. Patel. Efficient Evaluation of All-Nearest-Neighbors Queries. In ICDE, 2007.
    • (2007) ICDE
    • Chen, Y.1    Patel, J.M.2
  • 6
    • 33745630711 scopus 로고    scopus 로고
    • An Efficient and Scalable Approach to CNN Queries in a Road Network
    • H.-J. Cho and C.-W. Chung. An Efficient and Scalable Approach to CNN Queries in a Road Network. In VLDB, 2005.
    • (2005) VLDB
    • Cho, H.-J.1    Chung, C.-W.2
  • 7
    • 77954751998 scopus 로고    scopus 로고
    • Closest pair queries in spatial databases
    • A. Corral et al. Closest pair queries in spatial databases. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Corral, A.1
  • 8
    • 0034826382 scopus 로고    scopus 로고
    • Filtering algorithms and implementation for very fast publish/subscribe systems
    • F. Fabret et al. Filtering algorithms and implementation for very fast publish/subscribe systems. In SIGMOD, 2001.
    • (2001) SIGMOD
    • Fabret, F.1
  • 9
  • 10
    • 83455256876 scopus 로고    scopus 로고
    • Distance Indexing on Road Networks
    • H. Hu, D. L. Lee, and V. C. S. Lee. Distance Indexing on Road Networks. In VLDB, 2006.
    • (2006) VLDB
    • Hu, H.1    Lee, D.L.2    Lee, V.C.S.3
  • 11
    • 84940859893 scopus 로고    scopus 로고
    • iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
    • H. V. Jagadish et al. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. In ACM TODS05.
    • ACM TODS05
    • Jagadish, H.V.1
  • 12
    • 84983469675 scopus 로고    scopus 로고
    • Query and Update Efficient B+-Tree Based Indexing of Moving Objects
    • C. S. Jensen, D. Lin, and B. C. Ooi. Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In VLDB, 2004.
    • (2004) VLDB
    • Jensen, C.S.1    Lin, D.2    Ooi, B.C.3
  • 13
    • 26444554225 scopus 로고    scopus 로고
    • Continuous K Nearest Neighbor Queries in Spatial Network Database
    • M. R. Kolahdouzan and C. Shahahi. Continuous K Nearest Neighbor Queries in Spatial Network Database. In STDBM, 2004.
    • (2004) STDBM
    • Kolahdouzan, M.R.1    Shahahi, C.2
  • 14
    • 29844438853 scopus 로고    scopus 로고
    • Conceptuual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
    • K. Mouratidis et al. Conceptuual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Mouratidis, K.1
  • 15
    • 84893838632 scopus 로고    scopus 로고
    • Continuous Nearest Neighbor Monitoring in Road Networks
    • K. Mouratidis et al. Continuous Nearest Neighbor Monitoring in Road Networks. In VLDB, 2006.
    • (2006) VLDB
    • Mouratidis, K.1
  • 16
    • 85012217314 scopus 로고    scopus 로고
    • Query Processing in Spatial Network Databases
    • D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query Processing in Spatial Network Databases. In VLDB, 2003.
    • (2003) VLDB
    • Papadias, D.1    Zhang, J.2    Mamoulis, N.3    Tao, Y.4
  • 17
    • 0036808476 scopus 로고    scopus 로고
    • Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects
    • S. Prabhakar et al. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. In IEEE Trans. Computers, 2002.
    • (2002) IEEE Trans. Computers
    • Prabhakar, S.1
  • 18
    • 57149143446 scopus 로고    scopus 로고
    • Scalable network distance browsing in spatial databases
    • H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD, 2008.
    • (2008) SIGMOD
    • Samet, H.1    Sankaranarayanan, J.2    Alborzi, H.3
  • 21
    • 29844455744 scopus 로고    scopus 로고
    • Efficient Processing of Continual Range Queries for Location-Aware Mobile Services
    • K.-L.Wu et al. Efficient Processing of Continual Range Queries for Location-Aware Mobile Services. ISF'05.
    • ISF'05
    • Wu, K.-L.1
  • 23
    • 84856873000 scopus 로고    scopus 로고
    • Efficient constraint processing for highly personalized location based services
    • Zhengdao Xu and H.-A. Jacobsen. Efficient constraint processing for highly personalized location based services. In VLDB, 2004.
    • (2004) VLDB
    • Xu, Z.1    Jacobsen, H.-A.2
  • 24
    • 24144443986 scopus 로고    scopus 로고
    • Efficient constraint processing for location-aware computing
    • Zhengdao Xu and H. A. Jacobsen. Efficient constraint processing for location-aware computing. In MDM, 2005.
    • (2005) MDM
    • Xu, Z.1    Jacobsen, H.A.2
  • 25
    • 33644591423 scopus 로고    scopus 로고
    • A framework for location information processing
    • Zhengdao Xu and H. A. Jacobsen. A framework for location information processing. In MDM, 2005.
    • (2005) MDM
    • Xu, Z.1    Jacobsen, H.A.2
  • 26
    • 77954722665 scopus 로고    scopus 로고
    • L-ToPSS: Constraint processing system supporting efficient location based services
    • Zhengdao Xu and H. A. Jacobsen. L-ToPSS: Constraint processing system supporting efficient location based services. In MobiSys, 2005.
    • (2005) MobiSys
    • Xu, Z.1    Jacobsen, H.A.2
  • 27
    • 35448987759 scopus 로고    scopus 로고
    • Adaptive Location Constraint Processing
    • Zhengdao Xu and H.-A. Jacobsen. Adaptive Location Constraint Processing. In SIGMOD, 2007.
    • (2007) SIGMOD
    • Xu, Z.1    Jacobsen, H.-A.2
  • 28
    • 34548759039 scopus 로고    scopus 로고
    • Evaluating Proximity Relations under Uncertainty
    • Zhengdao Xu and H.-A. Jacobsen. Evaluating Proximity Relations Under Uncertainty. In ICDE, 2007.
    • (2007) ICDE
    • Xu, Z.1    Jacobsen, H.-A.2
  • 29
    • 67649657668 scopus 로고    scopus 로고
    • Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams
    • Zhengdao Xu and H.-A. Jacobsen. Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams. In ICDE, 2009.
    • (2009) ICDE
    • Xu, Z.1    Jacobsen, H.-A.2
  • 30
    • 85011066999 scopus 로고    scopus 로고
    • Graph Indexing: Tree+Delta >=Graph
    • P. Zhao, J. X. Yu, and P. S. Yu. Graph Indexing: Tree+Delta >=Graph. In VLDB, 2007.
    • (2007) VLDB
    • Zhao, P.1    Yu, J.X.2    Yu, P.S.3


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