메뉴 건너뛰기




Volumn 26, Issue 1, 2009, Pages 67-126

Semantics and evaluation of top-k queries in probabilistic databases

Author keywords

Probabilistic database; Query processing; Ranking query; Top k query

Indexed keywords

POLYNOMIAL-TIME REDUCTION; PROBABILISTIC DATABASE; RANKING QUERY; SCORING FUNCTIONS; SPEED-UP; TIME COMPLEXITY; TOP-K QUERY;

EID: 67651211464     PISSN: 09268782     EISSN: 15737578     Source Type: Journal    
DOI: 10.1007/s10619-009-7050-y     Document Type: Article
Times cited : (44)

References (28)
  • 1
    • 50249105848 scopus 로고    scopus 로고
    • On the semantics and evaluation of top-k queries in probabilistic databases
    • Zhang, X., Chomicki, J.: On the semantics and evaluation of top-k queries in probabilistic databases. In: ICDE Workshops, pp. 556-563 (2008)
    • (2008) ICDE Workshops , pp. 556-563
    • Zhang, X.1    Chomicki, J.2
  • 2
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • T. Imielinski W. Lipski 1984 Incomplete information in relational databases J. ACM 31 4 761 791
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 761-791
    • Imielinski, T.1    Lipski, W.2
  • 3
    • 0001902823 scopus 로고
    • The theory of probabilistic databases
    • Cavallo, R., Pittarelli, M.: The theory of probabilistic databases. In: VLDB (1987)
    • (1987) VLDB
    • Cavallo, R.1    Pittarelli, M.2
  • 4
    • 0025535649 scopus 로고
    • An analysis of first-order logics of probability
    • J.Y. Halpern 1990 An analysis of first-order logics of probability Artificial Intelligence 46 3 311 350
    • (1990) Artificial Intelligence , vol.46 , Issue.3 , pp. 311-350
    • Halpern, J.Y.1
  • 6
    • 0030836948 scopus 로고    scopus 로고
    • A probabilistic relational algebra for the integration of information retrieval and database systems
    • N. Fuhr T. Rölleke 1997 A probabilistic relational algebra for the integration of information retrieval and database systems ACM Trans. Inf. Syst. 15 1 32 66
    • (1997) ACM Trans. Inf. Syst. , vol.15 , Issue.1 , pp. 32-66
    • Fuhr, N.1    Rölleke, T.2
  • 7
    • 0030736377 scopus 로고    scopus 로고
    • Query evaluation in probabilistic relational databases
    • E. Zimányi 1997 Query evaluation in probabilistic relational databases Theor. Comput. Sci. 171 1-2 179 219
    • (1997) Theor. Comput. Sci. , vol.171 , Issue.12 , pp. 179-219
    • Zimányi, E.1
  • 9
    • 36148994784 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N.N. Dalvi D. Suciu 2007 Efficient query evaluation on probabilistic databases VLDB J. 16 4 523 544
    • (2007) VLDB J. , vol.16 , Issue.4 , pp. 523-544
    • Dalvi, N.N.1    Suciu, D.2
  • 11
    • 84858835658 scopus 로고    scopus 로고
    • Trio: A system for integrated management of data, accuracy, and lineage
    • Widom, J.: Trio: A system for integrated management of data, accuracy, and lineage. In: CIDR (2005)
    • (2005) CIDR
    • Widom, J.1
  • 12
    • 48449092575 scopus 로고    scopus 로고
    • World-set decompositions: Expressiveness and efficient algorithms
    • D. Olteanu C. Koch L. Antova 2008 World-set decompositions: Expressiveness and efficient algorithms Theor. Comput. Sci. 403 2-3 265 284
    • (2008) Theor. Comput. Sci. , vol.403 , Issue.23 , pp. 265-284
    • Olteanu, D.1    Koch, C.2    Antova, L.3
  • 13
    • 67651206081 scopus 로고    scopus 로고
    • http://www.infosys.uni-sb.de/projects/maybms/
  • 14
    • 0033075316 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • R. Fagin 1999 Combining fuzzy information from multiple systems J. Comput. Syst. Sci. 58 1 83 99
    • (1999) J. Comput. Syst. Sci. , vol.58 , Issue.1 , pp. 83-99
    • Fagin, R.1
  • 15
    • 0034819889 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)
    • (2001) PODS
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 17
    • 3142592508 scopus 로고    scopus 로고
    • Evaluating top-queries over web-accessible databases
    • A. Marian N. Bruno L. Gravano 2004 Evaluating top-queries over web-accessible databases ACM Trans. Database Syst. 29 2 319 362
    • (2004) ACM Trans. Database Syst. , vol.29 , Issue.2 , pp. 319-362
    • Marian, A.1    Bruno, N.2    Gravano, L.3
  • 18
    • 79953162324 scopus 로고    scopus 로고
    • Merging the results of approximate match operations
    • Guha, S., Koudas, N., Marathe, A., Srivastava, D.: Merging the results of approximate match operations. In: VLDB, pp. 636-647 (2004)
    • (2004) VLDB , pp. 636-647
    • Guha, S.1    Koudas, N.2    Marathe, A.3    Srivastava, D.4
  • 20
    • 85012120419 scopus 로고    scopus 로고
    • Supporting top-k join queries in relational databases
    • Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: VLDB (2003)
    • (2003) VLDB
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 21
    • 34548724406 scopus 로고    scopus 로고
    • Top-k query processing in uncertain databases
    • Soliman, M.A., Ilyas, I.F., Chang, K.C.C.: Top-k query processing in uncertain databases. In: ICDE (2007)
    • (2007) ICDE
    • Soliman, M.A.1    Ilyas, I.F.2    Chang, K.C.C.3
  • 23
    • 34548714632 scopus 로고    scopus 로고
    • Efficient top-k query evaluation on probabilistic data
    • Ré, C., Dalvi, N.N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: ICDE (2007)
    • (2007) ICDE
    • Ré, C.1    Dalvi, N.N.2    Suciu, D.3
  • 24
    • 57149131668 scopus 로고    scopus 로고
    • Ranking queries on uncertain data: A probabilistic threshold approach
    • Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: a probabilistic threshold approach. In: SIGMOD Conference, pp. 673-686 (2008)
    • (2008) SIGMOD Conference , pp. 673-686
    • Hua, M.1    Pei, J.2    Zhang, W.3    Lin, X.4
  • 25
    • 67649643456 scopus 로고    scopus 로고
    • Semantics of ranking queries for probabilistic data and expected ranks
    • Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: ICDE, pp. 305-316 (2009)
    • (2009) ICDE , pp. 305-316
    • Cormode, G.1    Li, F.2    Yi, K.3
  • 26
    • 50249153108 scopus 로고    scopus 로고
    • The threshold algorithm: From middleware systems to the relational engine
    • N. Bruno H. Wang 2007 The threshold algorithm: From middleware systems to the relational engine IEEE Trans. Knowl. Data Eng. 19 4 523 537
    • (2007) IEEE Trans. Knowl. Data Eng. , vol.19 , Issue.4 , pp. 523-537
    • Bruno, N.1    Wang, H.2
  • 28
    • 51149107502 scopus 로고    scopus 로고
    • Efficient processing of top-k queries in uncertain databases
    • Yi, K., Li, F., Kollios, G., Srivastava, D.: Efficient processing of top-k queries in uncertain databases. In: ICDE, pp. 1406-1408 (2008)
    • (2008) ICDE , pp. 1406-1408
    • Yi, K.1    Li, F.2    Kollios, G.3    Srivastava, D.4


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