메뉴 건너뛰기




Volumn , Issue , 2013, Pages 50-57

SLIM: A scalable location-sensitive information monitoring service

Author keywords

Information monitoring; Proactive location based services; Spatial triggers

Indexed keywords

INFORMATION ANALYSIS; LOCATION; MONITORING; SCALABILITY; TELECOMMUNICATION SERVICES; WEB SERVICES; WEBSITES;

EID: 84891820706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2013.17     Document Type: Conference Paper
Times cited : (1)

References (25)
  • 1
    • 2442617843 scopus 로고    scopus 로고
    • Issues in Data Stream Management
    • L. Golab and M. Özsu, "Issues in Data Stream Management," ACM SIGMOD Record, vol. 32, no. 2, pp. 5-14, 2003.
    • (2003) ACM SIGMOD Record , vol.32 , Issue.2 , pp. 5-14
    • Golab, L.1    Özsu, M.2
  • 3
    • 29844431650 scopus 로고    scopus 로고
    • A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects
    • H. Hu, J. Xu, and D. Lee, "A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects," in ACM SIGMOD, 2005, pp. 479-490.
    • (2005) ACM SIGMOD , pp. 479-490
    • Hu, H.1    Xu, J.2    Lee, D.3
  • 4
    • 85012111044 scopus 로고    scopus 로고
    • Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates
    • G. Iwerks, H. Samet, and K. Smith, "Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates," in VLDB, 2003, pp. 512-523.
    • (2003) VLDB , pp. 512-523
    • Iwerks, G.1    Samet, H.2    Smith, K.3
  • 5
    • 28044449142 scopus 로고    scopus 로고
    • SEA-CNN: Scalable Processing of Continuous k-Nearest Neighbor Queries in Spatio-Temporal Databases
    • X. Xiong, M. Mokbel, and W. Aref, "SEA-CNN: Scalable Processing of Continuous k-Nearest Neighbor Queries in Spatio-Temporal Databases," in ICDE, 2005, pp. 643-654.
    • (2005) ICDE , pp. 643-654
    • Xiong, X.1    Mokbel, M.2    Aref, W.3
  • 6
    • 85012170387 scopus 로고    scopus 로고
    • Maximizing the Output Rate of Multi-way Join Queries over Streaming Information Sources
    • S. Viglas, J. Naughton, and J. Burger, "Maximizing the Output Rate of Multi-way Join Queries over Streaming Information Sources," in VLDB, 2003, pp. 285-296.
    • (2003) VLDB , pp. 285-296
    • Viglas, S.1    Naughton, J.2    Burger, J.3
  • 7
    • 34250689975 scopus 로고    scopus 로고
    • Continuous Query Processing in Data Streams using Duality of Data and Queries
    • H. Lim, J. Lee, M. Lee, K. Whang, and I. Song, "Continuous Query Processing in Data Streams using Duality of Data and Queries," in ACM SIGMOD, 2006, pp. 313-324.
    • (2006) ACM SIGMOD , pp. 313-324
    • Lim, H.1    Lee, J.2    Lee, M.3    Whang, K.4    Song, I.5
  • 9
    • 0018480749 scopus 로고
    • The Ubiquitous B-tree
    • D. Comer, "The Ubiquitous B-tree," ACM Computing Surveys, vol. 11, pp. 121-137, 1979.
    • (1979) ACM Computing Surveys , vol.11 , pp. 121-137
    • Comer, D.1
  • 10
    • 0025447750 scopus 로고
    • The R*-tree: An Efficient and Robust Access Method for Points and Rectangles
    • N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles," in ACM SIGMOD, 1990, pp. 322-331.
    • (1990) ACM SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.2    Schneider, R.3    Seeger, B.4
  • 12
    • 1142279455 scopus 로고    scopus 로고
    • An Optimal and Progressive Algorithm for Skyline Queries
    • D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An Optimal and Progressive Algorithm for Skyline Queries," in SIGMOD, 2003.
    • (2003) SIGMOD
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 13
    • 0344756892 scopus 로고    scopus 로고
    • Efficient Progressive Skyline Computation
    • K. Tan, P. Eng, and B. Ooi, "Efficient Progressive Skyline Computation," in VLDB, 2001.
    • (2001) VLDB
    • Tan, K.1    Eng, P.2    Ooi, B.3
  • 16
    • 85018204196 scopus 로고    scopus 로고
    • Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
    • M. Gruteser and D. Grunwald, "Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking," in MobiSys, 2003, pp. 31-42.
    • (2003) MobiSys , pp. 31-42
    • Gruteser, M.1    Grunwald, D.2
  • 18
    • 33745830397 scopus 로고    scopus 로고
    • Place-Its: A Study of Location-Based Reminders on Mobile Phones
    • T. Sohn, K. Li, G. Lee, I. Smith, J. Scott, and W. Griswold, "Place-Its: A Study of Location-Based Reminders on Mobile Phones," in UbiComp, 2005.
    • (2005) UbiComp
    • Sohn, T.1    Li, K.2    Lee, G.3    Smith, I.4    Scott, J.5    Griswold, W.6
  • 20
    • 52649087605 scopus 로고    scopus 로고
    • WebCQ - Detecting and Delivering Information Changes on the Web
    • L. Liu, C. Pu, and W. Tang, "WebCQ - Detecting and Delivering Information Changes on the Web," in CIKM, 2000, pp. 512-519.
    • (2000) CIKM , pp. 512-519
    • Liu, L.1    Pu, C.2    Tang, W.3
  • 22
    • 36949013219 scopus 로고    scopus 로고
    • A Geometric Approach to Monitoring Threshold Functions over Distributed Data Streams
    • I. Sharfman, A. Schuster, and D. Keren, "A Geometric Approach to Monitoring Threshold Functions over Distributed Data Streams," ACM Transactions on Database Systems, vol. 32, no. 4, pp. 23-38, 2007.
    • (2007) ACM Transactions on Database Systems , vol.32 , Issue.4 , pp. 23-38
    • Sharfman, I.1    Schuster, A.2    Keren, D.3
  • 24
    • 84983469675 scopus 로고    scopus 로고
    • Query and Update Efficient B+-Tree based Indexing of Moving Objects
    • C. Jensen, D. Lin, and B. Ooi, "Query and Update Efficient B+-Tree based Indexing of Moving Objects," in VLDB, 2004, pp. 768-779.
    • (2004) VLDB , pp. 768-779
    • Jensen, C.1    Lin, D.2    Ooi, B.3
  • 25
    • 23944481004 scopus 로고    scopus 로고
    • Monitoring k-Nearest Neighbor Queries over Moving Objects
    • X. Yu, K. Pu, and N. Koudas, "Monitoring k-Nearest Neighbor Queries over Moving Objects," in ICDE, 2005, pp. 631-642.
    • (2005) ICDE , pp. 631-642
    • Yu, X.1    Pu, K.2    Koudas, N.3


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