메뉴 건너뛰기




Volumn , Issue , 2011, Pages 565-576

Authentication of moving kNN queries

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COST; COMPUTATION TIME; FRAMEWORK AND ALGORITHMS; K-NEAREST NEIGHBORS; K-NN QUERY; MOBILE CLIENT; MOVING QUERY; QUERY RESULTS; SAFE REGION; SERVICE PROVIDER; SYNTHETIC DATASETS;

EID: 79957874657     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767829     Document Type: Conference Paper
Times cited : (67)

References (25)
  • 1
    • 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 SIGMOD, 1990.
    • (1990) SIGMOD
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 2
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • DOI 10.1023/A:1015231126594
    • T. Brinkhoff. A Framework for Generating Network-Based Moving Objects. GeoInformatica, 6(2):153-180, 2002. (Pubitemid 34609430)
    • (2002) GeoInformatica , vol.6 , Issue.2 , pp. 153-180
    • Brinkhoff, T.1
  • 3
    • 33745275587 scopus 로고    scopus 로고
    • Maintenance of k-nn and spatial join queries on continuously moving points
    • DOI 10.1145/1138394.1138396
    • G. S. Iwerks, H. Samet, and K. P. Smith. Maintenance of K-nn and Spatial Join Queries on Continuously Moving Points. ACM TODS, 31(2):485-536, 2006. (Pubitemid 43924948)
    • (2006) ACM Transactions on Database Systems , vol.31 , Issue.2 , pp. 485-536
    • Iwerks, G.S.1    Samet, H.2    Smith, K.P.3
  • 4
    • 70449395944 scopus 로고    scopus 로고
    • Structural signatures for tree data structures
    • A. Kundu and E. Bertino. Structural Signatures for Tree Data Structures. PVLDB, 1(1):138-150, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 138-150
    • Kundu, A.1    Bertino, E.2
  • 5
    • 77952285841 scopus 로고    scopus 로고
    • How to authenticate graphs without leaking
    • A. Kundu and E. Bertino. How to Authenticate Graphs without Leaking. In EDBT, pages 609-620, 2010.
    • (2010) EDBT , pp. 609-620
    • Kundu, A.1    Bertino, E.2
  • 7
    • 85011031975 scopus 로고    scopus 로고
    • Proof-infused streams: Enabling authentication of sliding window queries on streams
    • F. Li, K. Yi, M. Hadjieleftheriou, and G. Kollios. Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams. In VLDB, pages 147-158, 2007.
    • (2007) VLDB , pp. 147-158
    • Li, F.1    Yi, K.2    Hadjieleftheriou, M.3    Kollios, G.4
  • 8
    • 0001263548 scopus 로고
    • A certified digital signature
    • R. C. Merkle. A Certified Digital Signature. In CRYPTO, 1989.
    • (1989) CRYPTO
    • Merkle, R.C.1
  • 9
    • 77950023510 scopus 로고    scopus 로고
    • The v*-diagram: A query-dependent approach to moving KNN queries
    • S. Nutanong, R. Zhang, E. Tanin, and L. Kulik. The V*-Diagram: A Query-dependent Approach to Moving KNN Queries. PVLDB, 1(1):1095-1106, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 1095-1106
    • Nutanong, S.1    Zhang, R.2    Tanin, E.3    Kulik, L.4
  • 11
    • 29844457793 scopus 로고    scopus 로고
    • Verifying completeness of relational query results in data publishing
    • H. Pang, A. Jain, K. Ramamritham, and K.-L. Tan. Verifying Completeness of Relational Query Results in Data Publishing. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Pang, H.1    Jain, A.2    Ramamritham, K.3    Tan, K.-L.4
  • 12
    • 76849102606 scopus 로고    scopus 로고
    • Authenticating the query results of text search engines
    • H. Pang and K. Mouratidis. Authenticating the Query Results of Text Search Engines. PVLDB, 1(1):126-137, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 126-137
    • Pang, H.1    Mouratidis, K.2
  • 13
    • 77952757644 scopus 로고    scopus 로고
    • Scalable verification for outsourced dynamic databases
    • H. Pang, J. Zhang, and K. Mouratidis. Scalable Verification for Outsourced Dynamic Databases. PVLDB, 2(1):802-813, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 802-813
    • Pang, H.1    Zhang, J.2    Mouratidis, K.3
  • 15
    • 85011016388 scopus 로고    scopus 로고
    • CADS: Continuous authentication on data streams
    • S. Papadopoulos, Y. Yang, and D. Papadias. CADS: Continuous Authentication on Data Streams. In VLDB, pages 135-146, 2007.
    • (2007) VLDB , pp. 135-146
    • Papadopoulos, S.1    Yang, Y.2    Papadias, D.3
  • 16
    • 78650614611 scopus 로고    scopus 로고
    • Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries
    • M. Sharifzadeh and C. Shahabi. Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. PVLDB, 3(1):1231-1242, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 1231-1242
    • Sharifzadeh, M.1    Shahabi, C.2
  • 18
    • 84944076278 scopus 로고    scopus 로고
    • K-nearest neighbor search for moving query point
    • Advances in Spatial and Temporal Databases
    • Z. Song and N. Roussopoulos. K-Nearest Neighbor Search for Moving Query Point. In SSTD, pages 79-96, 2001. (Pubitemid 33312876)
    • (2001) Lecture Notes in Computer Science , Issue.2121 , pp. 79-96
    • Song, Z.1    Roussopoulos, N.2
  • 19
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. In VLDB, pages 287-298, 2002.
    • (2002) VLDB , pp. 287-298
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 20
    • 33750984193 scopus 로고    scopus 로고
    • Minimum-cost network hardening using attack graphs
    • DOI 10.1016/j.comcom.2006.06.018, PII S0140366406002271
    • L. Wang, S. Noel, and S. Jajodia. Minimum-Cost Network Hardening using Attack Graphs. Computer Communications, 29(18):3812-3824, 2006. (Pubitemid 44751132)
    • (2006) Computer Communications , vol.29 , Issue.18 , pp. 3812-3824
    • Wang, L.1    Noel, S.2    Jajodia, S.3
  • 22
    • 67649510426 scopus 로고    scopus 로고
    • Authenticated indexing for outsourced spatial databases
    • Y. Yang, S. Papadopoulos, D. Papadias, and G. Kollios. Authenticated Indexing for Outsourced Spatial Databases. VLDB J., 18(3):631-648, 2009.
    • (2009) VLDB J. , vol.18 , Issue.3 , pp. 631-648
    • Yang, Y.1    Papadopoulos, S.2    Papadias, D.3    Kollios, G.4
  • 24
    • 77952757469 scopus 로고    scopus 로고
    • Efficient verification of shortest path search via authenticated hints
    • M. L. Yiu, Y. Lin, and K. Mouratidis. Efficient Verification of Shortest Path Search via Authenticated Hints. In ICDE, pages 237-248, 2010.
    • (2010) ICDE , pp. 237-248
    • Yiu, M.L.1    Lin, Y.2    Mouratidis, K.3


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