Method for query relaxation of XML data

A slack and data technology, applied in the field of XML data query, can solve problems such as inaccurate performance and query results, users cannot get answers, and users are cumbersome.

Inactive Publication Date: 2012-06-27
陆嘉恒
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, users may get empty query results due to strict query conditions
[0003] exist figure 1 In , when the user submits a path query "BookRecord / issue / article / authors", the user will not be able to get the answer, because there is no exact result that matches the query in the document
In this case, the user will try to modify the original query, such as "BookRecord / / issue / article / authors", "BookRecord / issue / / article / authors", etc., which will obviously bring cumbersome and inconvenience to the user

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for query relaxation of XML data
  • Method for query relaxation of XML data
  • Method for query relaxation of XML data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] In order to understand the present invention and its advantages more fully, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0026] In the present invention, the XML document is simulated as an ordered tree, and the twig pattern can be used in the XML query to match the related data in the XML database. Twig mode edges in a query can be parent-child or ancestor-descendant edges. Hereinafter, "node" refers to a query node, and "element" refers to a data element in a document.

[0027] Given a query pattern Q and an XML document D, a match of Q in D is defined by the mapping of nodes in Q to elements in D. The mapping satisfies: (i) the predicate on the query node is satisfied by the corresponding data node; (ii) the parent-child relationship and ancestor-descendant relationship between the query nodes are also satisfied by the corresponding data node. Such as figure 2 The matchin...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a method for the query relaxation of XML (extensive makeup language) data. The method comprises the following steps: A. acquiring side relaxation results by relaxing path query, and coding approximate results in a compact manner; and B. acquiring the relaxation results, in which operations are deleted by leaf nodes, by recursively constructing a leaf deletion query mode. The invention can calculate the minimal relaxation consumption of each possible relaxation path among the paths in each document in the process of initializing the element data structure. Accordingly, the minimal relaxation frequency, at which the approximate results are acquired, can be directly calculated after the initialization.

Description

technical field [0001] The invention relates to the technical field of XML data query, in particular to a query relaxation processing method for XML data. Background technique [0002] XML is becoming more and more popular as a data representation, and query relaxation processing is also attracting more and more interest due to the flexible model characteristics of XML data. Query relaxation techniques are widely used in information retrieval and relational databases, and have been proven to be an effective technique for obtaining approximate results. Different from the relational database, the table schema of the relational database is relatively small and fixed, while the XML model allows variable or missing structures and values, which makes it difficult to guarantee the accuracy and completeness of the user's query requirements. Recent XML applications require users to query XML data that they do not fully understand themselves. Besides, users may get empty query resul...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/30
Inventor 陆嘉恒
Owner 陆嘉恒
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products