메뉴 건너뛰기




Volumn 4254 LNCS, Issue , 2006, Pages 318-335

Preference-driven querying of inconsistent relational databases

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA REDUCTION; INFORMATION MANAGEMENT; QUERY LANGUAGES; USER INTERFACES;

EID: 33845267758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11896548_26     Document Type: Conference Paper
Times cited : (18)

References (24)
  • 3
    • 33745186641 scopus 로고    scopus 로고
    • Consistent query answering in databases
    • To appear
    • L. Bertossi. Consistent Query Answering in Databases. SIGMOD Record, 2006. To appear.
    • (2006) SIGMOD Record
    • Bertossi, L.1
  • 4
    • 1842839035 scopus 로고    scopus 로고
    • Query answering in inconsistent databases
    • J. Chomicki, R. van der Meyden, and G. Saake, editors, Springer-Verlag
    • L. Bertossi and J. Chomicki. Query Answering in Inconsistent Databases. In J. Chomicki, R. van der Meyden, and G. Saake, editors, Logics for Emerging Applications of Databases, pages 43-83. Springer-Verlag, 2003.
    • (2003) Logics for Emerging Applications of Databases , pp. 43-83
    • Bertossi, L.1    Chomicki, J.2
  • 7
    • 3142632034 scopus 로고    scopus 로고
    • Preference formulas in relational queries
    • December
    • J. Chomicki. Preference Formulas in Relational Queries. ACM Transactions on Database Systems (TODS), 28(4):427-466, December 2003.
    • (2003) ACM Transactions on Database Systems (TODS) , vol.28 , Issue.4 , pp. 427-466
    • Chomicki, J.1
  • 8
    • 14744293228 scopus 로고    scopus 로고
    • Minimal-change integrity maintenance using tuple deletions
    • J. Chomicki and J. Marcinkowski. Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation, pages 90-121, 2005.
    • (2005) Information and Computation , pp. 90-121
    • Chomicki, J.1    Marcinkowski, J.2
  • 17
    • 0010288660 scopus 로고    scopus 로고
    • Defining relative likehood in partially-ordered preferential structures
    • J. Y. Halpern. Defining Relative Likehood in Partially-Ordered Preferential Structures. Journal of Artificial Intelligence Research, 1997.
    • (1997) Journal of Artificial Intelligence Research
    • Halpern, J.Y.1
  • 18
    • 84941172125 scopus 로고    scopus 로고
    • Letter from the editor-in-chief
    • D. B. Lomet. Letter from the Editor-in-Chief. IEEE Data Eng. Bull., 23(4), 2000.
    • (2000) IEEE Data Eng. Bull. , vol.23 , Issue.4
    • Lomet, D.B.1
  • 20
    • 0002490026 scopus 로고    scopus 로고
    • Data cleaning: Problems and current approaches
    • E. Rahm and H. H. Do. Data Cleaning: Problems and Current Approaches. IEEE Data Eng. Bull., 23(4):3-13, 2000.
    • (2000) IEEE Data Eng. Bull. , vol.23 , Issue.4 , pp. 3-13
    • Rahm, E.1    Do, H.H.2
  • 21
    • 0034301195 scopus 로고    scopus 로고
    • Prioritized logic programming and its application to commonsense reasoning
    • C. Sakama and K. Inoue. Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence, 123:185-222, 2000.
    • (2000) Artificial Intelligence , vol.123 , pp. 185-222
    • Sakama, C.1    Inoue, K.2
  • 24
    • 0011730586 scopus 로고    scopus 로고
    • ARKTOS: A tool for data cleaning and transformation in data warehouse environments
    • P. Vassiliadis, Z. Vagena, S. Skiadopoulos, and N. Karayannidis. ARKTOS: A Tool For Data Cleaning and Transformation in Data Warehouse Environments. IEEE Data Eng. Bull, 23(4):42-47, 2000.
    • (2000) IEEE Data Eng. Bull , vol.23 , Issue.4 , pp. 42-47
    • Vassiliadis, P.1    Vagena, Z.2    Skiadopoulos, S.3    Karayannidis, N.4


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