메뉴 건너뛰기




Volumn 6, Issue 2, 2012, Pages 73-84

Computing immutable regions for subspace top-k queries

Author keywords

[No Author keywords available]

Indexed keywords

SENSITIVITY ANALYSIS;

EID: 84875115404     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2535568.2448941     Document Type: Article
Times cited : (12)

References (28)
  • 4
    • 0036372482 scopus 로고    scopus 로고
    • Minimal probing: supporting expensive predicates for top-k queries
    • K. C.-C. Chang and S. won Hwang. Minimal probing: supporting expensive predicates for top-k queries. In SIGMOD, pages 346-357, 2002.
    • (2002) SIGMOD , pp. 346-357
    • Chang, K.-C.1    Won Hwang, S.2
  • 6
    • 4344693499 scopus 로고    scopus 로고
    • Optimizing top-k selection queries over multimedia repositories
    • S. Chaudhuri, L. Gravano, and A. Marian. Optimizing top-k selection queries over multimedia repositories. IEEE Trans. Knowl. Data Eng., 16(8):992-1009, 2004.
    • (2004) IEEE Trans. Knowl. Data Eng. , vol.16 , Issue.8 , pp. 992-1009
    • Chaudhuri, S.1    Gravano, L.2    Marian, A.3
  • 7
    • 0033075316 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83-99, 1999.
    • (1999) J. Comput. Syst. Sci. , vol.58 , Issue.1 , pp. 83-99
    • Fagin, R.1
  • 8
    • 0038504811 scopus 로고    scopus 로고
    • Optimal Aggregation Algorithms for Middleware
    • R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. JCSS, 66(4):614-656, 2003.
    • (2003) JCSS , vol.66 , Issue.4 , pp. 614-656
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 9
    • 0942279014 scopus 로고    scopus 로고
    • Algorithms and applications for answering ranked queries using ranked views
    • V. Hristidis and Y. Papakonstantinou. Algorithms and applications for answering ranked queries using ranked views. VLDB Journal, 13(1):49-70, 2004.
    • (2004) VLDB Journal , vol.13 , Issue.1 , pp. 49-70
    • Hristidis, V.1    Papakonstantinou, Y.2
  • 10
    • 57149131668 scopus 로고    scopus 로고
    • Ranking queries on uncertain data: a probabilistic threshold approach
    • M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: a probabilistic threshold approach. In SIGMOD, pages 673-686, 2008.
    • (2008) SIGMOD , pp. 673-686
    • Hua, M.1    Pei, J.2    Zhang, W.3    Lin, X.4
  • 11
    • 6344287791 scopus 로고    scopus 로고
    • Supporting top-k join queries in relational databases
    • I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB Journal, 13(3):207-221, 2004.
    • (2004) VLDB Journal , vol.13 , Issue.3 , pp. 207-221
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 12
    • 55349093583 scopus 로고    scopus 로고
    • A survey of top-k query processing techniques in relational database systems
    • I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008.
    • (2008) ACM Comput. Surv. , vol.40 , Issue.4
    • Ilyas, I.F.1    Beskales, G.2    Soliman, M.A.3
  • 13
    • 33745142598 scopus 로고    scopus 로고
    • Indexing with Unknown Illumination and Pose
    • I. Kemelmacher and R. Basri. Indexing with Unknown Illumination and Pose. CVPR, 1:909-916, 2005.
    • (2005) CVPR , vol.1 , pp. 909-916
    • Kemelmacher, I.1    Basri, R.2
  • 14
    • 79952971641 scopus 로고    scopus 로고
    • Ranking continuous probabilistic datasets
    • J. Li and A. Deshpande. Ranking continuous probabilistic datasets. PVLDB, 3(1):638-649, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 638-649
    • Li, J.1    Deshpande, A.2
  • 15
    • 34250656636 scopus 로고    scopus 로고
    • Continuous monitoring of top-k queries over sliding windows
    • K. Mouratidis, S. Bakiras, and D. Papadias. Continuous monitoring of top-k queries over sliding windows. In SIGMOD, pages 635-646, 2006.
    • (2006) SIGMOD , pp. 635-646
    • Mouratidis, K.1    Bakiras, S.2    Papadias, D.3
  • 16
    • 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
  • 17
    • 33745596454 scopus 로고    scopus 로고
    • Catching the best views of skyline: A semantic approach based on decisive subspaces
    • J. Pei, W. Jin, M. Ester, and Y. Tao. Catching the best views of skyline: A semantic approach based on decisive subspaces. In VLDB, pages 253-264, 2005.
    • (2005) VLDB , pp. 253-264
    • Pei, J.1    Jin, W.2    Ester, M.3    Tao, Y.4
  • 19
    • 0036808476 scopus 로고    scopus 로고
    • Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects
    • S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch. Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects. IEEE Trans. Computers, 51(10):1124-1140, 2002.
    • (2002) IEEE Trans. Computers , vol.51 , Issue.10 , pp. 1124-1140
    • Prabhakar, S.1    Xia, Y.2    Kalashnikov, D.V.3    Aref, W.G.4    Hambrusch, S.E.5
  • 20
    • 79959996139 scopus 로고    scopus 로고
    • Ranking with uncertain scoring functions: semantics and sensitivity measures
    • M. A. Soliman, I. F. Ilyas, D. Martinenghi, and M. Tagliasacchi. Ranking with uncertain scoring functions: semantics and sensitivity measures. In SIGMOD, pages 805-816, 2011.
    • (2011) SIGMOD , pp. 805-816
    • Soliman, M.A.1    Ilyas, I.F.2    Martinenghi, D.3    Tagliasacchi, M.4
  • 21
    • 84944076278 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, pages 79-96, 2001.
    • (2001) SSTD , pp. 79-96
    • Song, Z.1    Roussopoulos, N.2
  • 23
    • 33749417750 scopus 로고    scopus 로고
    • Subsky: Efficient computation of skylines in subspaces
    • Y. Tao, X. Xiao, and J. Pei. Subsky: Efficient computation of skylines in subspaces. In ICDE, page 65, 2006.
    • (2006) ICDE , pp. 65
    • Tao, Y.1    Xiao, X.2    Pei, J.3
  • 24
    • 34347217063 scopus 로고    scopus 로고
    • Efficient skyline and top-k retrieval in subspaces
    • Y. Tao, X. Xiao, and J. Pei. Efficient skyline and top-k retrieval in subspaces. IEEE Trans. Knowl. Data Eng., 19(8):1072-1088, 2007.
    • (2007) IEEE Trans. Knowl. Data Eng. , vol.19 , Issue.8 , pp. 1072-1088
    • Tao, Y.1    Xiao, X.2    Pei, J.3
  • 27
    • 0141652193 scopus 로고    scopus 로고
    • Efficient maintenance of materialized top-k views
    • K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen. Efficient maintenance of materialized top-k views. In ICDE, pages 189-200, 2003.
    • (2003) ICDE , pp. 189-200
    • Yi, K.1    Yu, H.2    Yang, J.3    Xia, G.4    Chen, Y.5


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