Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient processing of partially specified twig queries.
| Content Provider | CiteSeerX |
|---|---|
| Author | Zhou, Junfeng |
| Abstract | XML has been used extensively in many applications as a de facto standard for information representation and exchange over the internet. Huge volumes of data are organized or exported in treestructured form and the desired information can be got by traversing the whole tree structure using a twig query or keyword based query. Although twig query can express more semantic information, it is infeasible when the schema or structure information is not fully available. Keyword based query can be used easily; however, it can only express very limited semantics. This has driven the requirement of relaxing the complete specification of a twig query to express more flexible semantic information in a single query expression. In this paper, we address the problem of query evaluation for Partially Specified Twig Query (PSTQ) over XML documents. We aim at (i) providing users with a concise and effective way to specify partial constraints in a twig query and (ii) processing a PSTQ efficiently without deriving the special twig queries and processing them one by one. The problems which prevent us from efficient processing of PSTQ are proposed and then, the current work for these problems is presented for further discussion. 1. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Efficient Processing Twig Query Special Twig Query Query Evaluation Desired Information Information Representation Effective Way Current Work Structure Information Semantic Information Partial Constraint Many Application Limited Semantics Partially Specified Twig Query Flexible Semantic Information Whole Tree Structure Xml Document Huge Volume Treestructured Form Single Query Expression Complete Specification |
| Content Type | Text |
