메뉴 건너뛰기




Volumn , Issue , 2007, Pages 896-905

Top-k query processing in uncertain databases

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATABASE SYSTEMS; MATHEMATICAL MODELS; SEMANTICS;

EID: 34548724406     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367935     Document Type: Conference Paper
Times cited : (395)

References (22)
  • 1
    • 34548798831 scopus 로고    scopus 로고
    • The r project for statistical computing
    • The r project for statistical computing: www.r-project.org.
  • 2
    • 84976783730 scopus 로고
    • On the representation and querying of sets of possible worlds
    • S. Abiteboul, P. Kaneliakis, and G. Grahne. On the representation and querying of sets of possible worlds. In SIGMOD, 1987.
    • (1987) SIGMOD
    • Abiteboul, S.1    Kaneliakis, P.2    Grahne, G.3
  • 3
    • 33749588820 scopus 로고    scopus 로고
    • Clean answers over dirty databases: A probabilistic approach
    • P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In ICDE, 2006.
    • (2006) ICDE
    • Andritsos, P.1    Fuxman, A.2    Miller, R.J.3
  • 6
    • 1142291577 scopus 로고    scopus 로고
    • Evaluating probabilistic queries over imprecise data
    • R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Cheng, R.1    Kalashnikov, D.2    Prabhakar, S.3
  • 8
    • 2442576849 scopus 로고    scopus 로고
    • Approximate aggregation techniques for sensor databases
    • J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In ICDE, 2004.
    • (2004) ICDE
    • Considine, J.1    Li, F.2    Kollios, G.3    Byers, J.4
  • 9
    • 34548717193 scopus 로고    scopus 로고
    • VT de Almeida and R. Hartmut. Supporting uncertainty in moving objects in network databases. In GIS, 2005.
    • VT de Almeida and R. Hartmut. Supporting uncertainty in moving objects in network databases. In GIS, 2005.
  • 10
    • 84880688943 scopus 로고    scopus 로고
    • N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In IJCAI, 1999.
    • N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In IJCAI, 1999.
  • 11
    • 0012840007 scopus 로고
    • A probabilistic framework for vague queries and, imprecise information in databases
    • N. Fuhr. A probabilistic framework for vague queries and, imprecise information in databases. In VLDB, 1990.
    • (1990) VLDB
    • Fuhr, N.1
  • 12
    • 29844448776 scopus 로고    scopus 로고
    • Conquer: Efficient management of inconsistent databases
    • A. Fuxman, E. Fazli, and R. J. Miller. Conquer: Efficient management of inconsistent databases. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Fuxman, A.1    Fazli, E.2    Miller, R.J.3
  • 13
    • 0013331361 scopus 로고    scopus 로고
    • Real-world data is dirty: Data cleansing and the merge/purge problem
    • M. A. Hernandez and S. J. Stolfo. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Min. Knowl. Discov., 2(1), 1998.
    • (1998) Data Min. Knowl. Discov , vol.2 , Issue.1
    • Hernandez, M.A.1    Stolfo, S.J.2
  • 14
    • 85012120419 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. In VLDB, 2003.
    • (2003) VLDB
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 15
    • 0021513522 scopus 로고
    • Incomplete information in relational, databases
    • T. Imielinski and J. Witold Lipski. Incomplete information in relational, databases. J. ACM, 31(4):761-791, 1984.
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 761-791
    • Imielinski, T.1    Witold Lipski, J.2
  • 17
    • 29844457931 scopus 로고    scopus 로고
    • Ranksql: Query algebra and optimization for relational top-k queries
    • C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song. Ranksql: query algebra and optimization for relational top-k queries. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Li, C.1    Chang, K.C.-C.2    Ilyas, I.F.3    Song, S.4
  • 18
    • 84938961099 scopus 로고    scopus 로고
    • Efficient query evaluation on proba-bilistic databases
    • D. S. Nilesh N. Dalvi. Efficient query evaluation on proba-bilistic databases. In VLDB, 2004.
    • (2004) VLDB
    • Nilesh, D.S.1    Dalvi, N.2
  • 19
    • 34548714632 scopus 로고    scopus 로고
    • Efficient top-k query evaluation on probabilistic data
    • C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
    • (2007) ICDE
    • Re, C.1    Dalvi, N.2    Suciu, D.3
  • 21
    • 33749605102 scopus 로고    scopus 로고
    • A sampling-based approach, to optimizing top-k queries in sensor networks
    • A. Silberstein, R. Braynard, C. Ellis, K. Munagala, and J. Yang. A sampling-based approach, to optimizing top-k queries in sensor networks. In ICDE, 2006.
    • (2006) ICDE
    • Silberstein, A.1    Braynard, R.2    Ellis, C.3    Munagala, K.4    Yang, J.5
  • 22
    • 84858835658 scopus 로고    scopus 로고
    • Trio: A system, for integrated management of data, accuracy, and lineage
    • J. Widom. Trio: A system, for integrated management of data, accuracy, and lineage. In CIDR, 2005.
    • (2005) CIDR
    • Widom, J.1


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