메뉴 건너뛰기




Volumn , Issue , 2008, Pages 983-992

Fast and simple relational processing of uncertain data

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ALGEBRA; BOOLEAN ALGEBRA; DATA PROCESSING; DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; MATRIX ALGEBRA; STANDARDS; TECHNOLOGY;

EID: 52649102939     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497507     Document Type: Conference Paper
Times cited : (184)

References (17)
  • 1
    • 44949276851 scopus 로고
    • On the representation and querying of sets of possible worlds
    • S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theor. Comput. Sci., 78(1), 1991.
    • (1991) Theor. Comput. Sci , vol.78 , Issue.1
    • Abiteboul, S.1    Kanellakis, P.2    Grahne, G.3
  • 2
    • 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 Proc. ICDE, 2006.
    • (2006) Proc. ICDE
    • Andritsos, P.1    Fuxman, A.2    Miller, R.J.3
  • 3
    • 52649144117 scopus 로고    scopus 로고
    • L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and Simple Relational Processing of Uncertain Data. Technical Report cs.DB/0707.1644, ACM CORR, 2007.
    • L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and Simple Relational Processing of Uncertain Data. Technical Report cs.DB/0707.1644, ACM CORR, 2007.
  • 4
    • 34548734138 scopus 로고    scopus 로고
    • 106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
    • 106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information. In Proc. ICDE, 2007.
    • (2007) Proc. ICDE
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 5
    • 35448929116 scopus 로고    scopus 로고
    • From Complete to Incomplete Information and Back
    • L. Antova, C. Koch, and D. Olteanu. From Complete to Incomplete Information and Back. In Proc. SIGMOD, 2007.
    • (2007) Proc. SIGMOD
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 6
    • 34548746394 scopus 로고    scopus 로고
    • World-set decompositions: Expressiveness and efficient algorithms
    • L. Antova, C. Koch, and D. Olteanu. World-set decompositions: Expressiveness and efficient algorithms. In Proc. ICDT, 2007.
    • (2007) Proc. ICDT
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 7
    • 0018683646 scopus 로고
    • On Searching Transposed Files
    • D. S. Batory. On Searching Transposed Files. ACM Trans. Datab. Syst., 4(4):531-544, 1979.
    • (1979) ACM Trans. Datab. Syst , vol.4 , Issue.4 , pp. 531-544
    • Batory, D.S.1
  • 9
    • 33745594341 scopus 로고    scopus 로고
    • U-DBMS: A database system for managing constantly-evolving data
    • R. Cheng, S. Singh, and S. Prabhakar. U-DBMS: a database system for managing constantly-evolving data. In Proc. VLDB, 2005.
    • (2005) Proc. VLDB
    • Cheng, R.1    Singh, S.2    Prabhakar, S.3
  • 10
    • 84938961099 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In Proc. VLDB, 2004.
    • (2004) Proc. VLDB
    • Dalvi, N.1    Suciu, D.2
  • 11
    • 0021572602 scopus 로고
    • Dependency Satisfaction in Databases with Incomplete Information
    • G. Grahne. Dependency Satisfaction in Databases with Incomplete Information. In Proc. VLDB, 1984.
    • (1984) Proc. VLDB
    • Grahne, G.1
  • 12
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of ACM, 31(4), 1984.
    • (1984) Journal of ACM , vol.31 , Issue.4
    • Imielinski, T.1    Lipski, W.2
  • 13
    • 84976652055 scopus 로고
    • Incomplete objects -a data model for design and planning applications
    • T. Imielinski, S. Naqvi, and K. Vadaparty. Incomplete objects -a data model for design and planning applications. In Proc. SIGMOD, 1991.
    • (1991) Proc. SIGMOD
    • Imielinski, T.1    Naqvi, S.2    Vadaparty, K.3
  • 14
    • 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 Proc. ICDE, 2007.
    • (2007) Proc. ICDE
    • Re, C.1    Dalvi, N.2    Suciu, D.3
  • 15
    • 34548772330 scopus 로고    scopus 로고
    • Representing and Querying Correlated Tuples in Probabilistic Databases
    • P. Sen and A. Deshpande. Representing and Querying Correlated Tuples in Probabilistic Databases. In Proc. ICDE, 2007.
    • (2007) Proc. ICDE
    • Sen, P.1    Deshpande, A.2
  • 17
    • 35448979009 scopus 로고    scopus 로고
    • Transaction Processing Performance Council, 2.6.0 edition
    • Transaction Processing Performance Council. TPC Benchmark H (Decision Support), revision 2.6.0 edition, 2006. http://www.tpc.org/tpch/spec/tpch2. 6.0.pdf.
    • (2006) TPC Benchmark H (Decision Support), revision


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