logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Reasoning about keys for XML

delete2003-12-01
delete66
PRE
AI
P
Peter Buneman
S
Susan B. Davidson
W
Wenfei Fan
C
Carmem S. Hara
W
Wang-Chiew Tan
DOI：10.1016/S0306-4379(03)00028-0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, we show that these keys are always (finitely) satisfiable, and their (finite) implication problem is finitely axiomatizable. Furthermore, we provide a polynomial time algorithm for determining (finite) implication in the size of keys. Our results also demonstrate, among other things, that the analysis of XML keys is far more intricate than its relational counterpart. (C) 2003 Elsevier Ltd. All rights reserved.
Keywords:
XML keys
axiomatization
logical implication
satisfiability
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Enterprise Information Systems cover
Enterprise Information Systems
IF:
3.9
Papers:
2.8K
Citations:
1.8K

Organization

No organization information available