XML data based highly effective path indexing method
An indexing and data technology, applied in the database field, can solve problems such as inefficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com