Handling Partial Matches in Semistructured Data with Cooperative Query Answering Techniques

Author(s):  
Antonio Badia ◽  
Sanjay Kumar Madria
Author(s):  
Kazi Zakia Sultana ◽  
Anupam Bhattacharjee ◽  
Mohammad Shafkat Amin ◽  
Hasan Jamil

CKBS ’90 ◽  
1991 ◽  
pp. 271-292 ◽  
Author(s):  
Wesley W. Chu ◽  
Qiming Chen ◽  
Rei-Chi Lee

Author(s):  
Diego Calvanese ◽  
Giuseppe De Giacomo ◽  
Maurizio Lenzerini ◽  
Moshe Y. Vardi

Author(s):  
Elena Baralis ◽  
Paolo Garza ◽  
Elisa Quintarelli ◽  
Letizia Tanca

XML is a rather verbose representation of semistructured data, which may require huge amounts of storage space. Several summarized representations of XML data have been proposed, which can both provide succinct information and be directly queried. In this chapter we focus on compact representations based on the extraction of association rules from XML datasets. In particular, we show how patterns can be exploited to (possibly partially) answer queries, either when fast (and approximate) answers are required, or when the actual dataset is not available, e.g., it is currently unreachable. We focus on (a) schema patterns, representing exact or approximate dataset constraints, (b) instance patterns, which represent actual data summaries, and their use for answering queries.


Sign in / Sign up

Export Citation Format

Share Document