메뉴 건너뛰기




Volumn 33, Issue 3, 2008, Pages

Probabilistic top-k and ranking-aggregate queries

Author keywords

Aggregation; Probabilistic data; Query processing; Ranking; Top k

Indexed keywords

AGGREGATE QUERIES; AGGREGATION; PROBABILISTIC DATA; RANKING; TOP-K;

EID: 51149112283     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1386118.1386119     Document Type: Article
Times cited : (76)

References (35)
  • 1
    • 84976783730 scopus 로고
    • On the representation and querying of sets of possible worlds
    • ABITEBOUL, S., KANELLAKIS, P., AND GRAHNE, G. 1987. On the representation and querying of sets of possible worlds. SIGMOD Rec. 16, 3, 34-48.
    • (1987) SIGMOD Rec , vol.16 , Issue.3 , pp. 34-48
    • ABITEBOUL, S.1    KANELLAKIS, P.2    GRAHNE, G.3
  • 5
    • 33749548584 scopus 로고    scopus 로고
    • Evaluation of probabilistic queries over imprecise data in constantly-evolving environments
    • CHENG, R., KALASHNIKOV, D. V., AND PRABHAKAR, S. 2007. Evaluation of probabilistic queries over imprecise data in constantly-evolving environments. Inform. Syst. 32, 1, 104-130.
    • (2007) Inform. Syst , vol.32 , Issue.1 , pp. 104-130
    • CHENG, R.1    KALASHNIKOV, D.V.2    PRABHAKAR, S.3
  • 6
    • 36148994784 scopus 로고    scopus 로고
    • Efficient query evaluationonprobabilistic databases
    • DALVI, N. AND SUCIU,D. 2007. Efficient query evaluationonprobabilistic databases. VLDB J. 16, 4, 523-544.
    • (2007) VLDB J , vol.16 , Issue.4 , pp. 523-544
    • DALVI, N.1    SUCIU, D.2
  • 7
    • 0038504811 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • FAGIN, R., LOTEM, A., AND NAOR, M. 2003. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66, 4, 614-656.
    • (2003) J. Comput. Syst. Sci , vol.66 , Issue.4 , pp. 614-656
    • FAGIN, R.1    LOTEM, A.2    NAOR, M.3
  • 9
    • 0040746926 scopus 로고    scopus 로고
    • Optimizing queries using materialized views: A practical, scalable solution
    • GOLDSTEIN, J. AND LARSON, P.-A. 2001. Optimizing queries using materialized views: A practical, scalable solution. SIGMOD Rec. 30, 2.
    • (2001) SIGMOD Rec , vol.30 , pp. 2
    • GOLDSTEIN, J.1    LARSON, P.-A.2
  • 11
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • HART, P. E., NILSSON, N. J., AND RAPHAEL, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. 4, 2, 100-107.
    • (1968) IEEE Trans , vol.4 , Issue.2 , pp. 100-107
    • HART, P.E.1    NILSSON, N.J.2    RAPHAEL, B.3
  • 12
    • 33745213976 scopus 로고    scopus 로고
    • Automatic complex schema matching across Web query interfaces: A correlation mining approach
    • HE, B. AND CHANG, K. C.-C. 2006. Automatic complex schema matching across Web query interfaces: A correlation mining approach. ACM Trans. Datab. Syst. 31, 1, 346-395.
    • (2006) ACM Trans. Datab. Syst , vol.31 , Issue.1 , pp. 346-395
    • HE, B.1    CHANG, K.C.-C.2
  • 14
    • 0013331361 scopus 로고    scopus 로고
    • Real-world data is dirty: Data cleansing and the merge/purge problem
    • HERNANDEZ, M. A. AND STOLFO, S. J. 1998. Real-world data is dirty: Data cleansing and the merge/purge problem. J. Data Mining Knowl. Disc. 2, 1, 9-37.
    • (1998) J. Data Mining Knowl. Disc , vol.2 , Issue.1 , pp. 9-37
    • HERNANDEZ, M.A.1    STOLFO, S.J.2
  • 18
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • IMIELIŃSKI, T. AND WITOLD LIPSKI, J. 1984. Incomplete information in relational databases. J. ACM 31, 4, 761-791.
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 761-791
    • IMIELIŃSKI, T.1    WITOLD LIPSKI, J.2
  • 20
    • 0020937083 scopus 로고
    • Monte-carlo algorithms for enumeration and reliability problems
    • KARP, R. AND LUBY, M. 1983. Monte-carlo algorithms for enumeration and reliability problems. In Proceedings of the 24th STOC Conference. 56-64.
    • (1983) Proceedings of the 24th STOC Conference , pp. 56-64
    • KARP, R.1    LUBY, M.2
  • 26
    • 51149087349 scopus 로고    scopus 로고
    • R-PROJECT
    • R-PROJECT. The R project for statistical computing: www.r-project.org.
  • 28
    • 29844449830 scopus 로고    scopus 로고
    • Aggregate operators in probabilistic databases
    • ROSS, R., SUBRAHMANIAN, V. S., AND GRANT, J. 2005. Aggregate operators in probabilistic databases. J. ACM 52, 1, 54-101.
    • (2005) J. ACM , vol.52 , Issue.1 , pp. 54-101
    • ROSS, R.1    SUBRAHMANIAN, V.S.2    GRANT, J.3
  • 30
    • 34548772330 scopus 로고    scopus 로고
    • Representing and querying correlated tuples in probabilistic databases
    • SEN, P. AND DESHPANDE, A. 2007. Representing and querying correlated tuples in probabilistic databases. In Proceedings of the 23rd ICDE Conference. 596-605.
    • (2007) Proceedings of the 23rd ICDE Conference , pp. 596-605
    • SEN, P.1    DESHPANDE, A.2
  • 33
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • VALIANT, L. G. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3, 410-421.
    • (1979) SIAM J. Comput , vol.8 , Issue.3 , pp. 410-421
    • VALIANT, L.G.1
  • 34
    • 84858835658 scopus 로고    scopus 로고
    • Trio: A system for integrated management of data, accuracy, and lineage
    • WIDOM, J. 2005. Trio: A system for integrated management of data, accuracy, and lineage. In Proceedings of the 2nd Biennial CIDR Conference. 262-276.
    • (2005) Proceedings of the 2nd Biennial CIDR Conference , pp. 262-276
    • WIDOM, J.1


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