XML data based highly effective path indexing method

An indexing and data technology, applied in the database field, can solve problems such as inefficiency

Inactive Publication Date: 2005-06-29
FUDAN UNIV
View PDF0 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

So this kind of node is inefficient when dealing with branch path queries

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
  • XML data based highly effective path indexing method
  • XML data based highly effective path indexing method
  • XML data based highly effective path indexing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] [1] Construction of UD(k, l) index map:

[0035] The UD(k,l) index graph is constructed in two steps. The first step is to classify all data nodes according to their labels, that is, to classify nodes with the same label into one category, so that a list of node sets can be obtained, and each node set has a unique label. Then calculate the upward similarity of each node set, and repeatedly split the node set with the minimum upward similarity until the minimum upward similarity ub of all node sets is not less than the given parameter k. Then calculate the downward similarity of each node set, and split the nodes repeatedly until the minimum downward similarity db in all node sets is not less than the given parameter l. The values ​​of k and l need to be determined by experiments. For different source data sets and query path sets, the values ​​of k and l for optimal performance may be different. The second step is to establish index nodes and edges connecting index no...

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

This invention belongs to database technique field and provides a new type of XML path index -UD(kú¼l), which is an effective approximately index structure and its data joint sorting relies on its upper path with K length and down path with I length. This index uses upper local approximate degree and down local approximate degree information of XML data joints, so it can effective execute the path expression and especial the sub-path expression.

Description

technical field [0001] The invention belongs to the technical field of databases, and in particular relates to a novel and efficient method for indexing XML data. Background technique [0002] In recent years, XML (Extensible Markup Language) has become the main standard for data distribution and exchange on the Internet. With the emergence of a large number of XML documents, people pay more and more attention to the query of XML data. Various query languages ​​have been proposed. Among them, the execution path expression is an important aspect of XML query. The simplest execution method of path expression is to conduct exhaustive search directly on the whole XML document, which is obviously very inefficient. Path indexes improve the execution efficiency of path expressions by restricting lookups to only those parts of the XML document that are relevant to the query. Therefore, how to extract the path index structure from semi-structured data has been widely concerned re...

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 Applications(China)
IPC IPC(8): G06F17/30
Inventor 吴红伟周傲英
Owner FUDAN UNIV
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap