Semantic relevance-based XML (Extensive Makeup Language) keyword top-k inquiring method
A technology of top-k, query method, applied in the database field, can solve the problem of inability to implement the TA algorithm, achieve the effect of improving efficiency and quality, and avoiding redundant operations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0034] 1. Some concepts and definitions related to the present invention.
[0035] As shown in Figure 1, an XML document can be expressed as a tree model: T=(NE, NV, E, r), wherein the internal node set NE corresponds to the elements and attributes of the XML document, the leaf node set NV corresponds to the text of the XML document, and E is A set of directed edges represents the information inclusion relationship between nodes, and r is the root node of the document tree. figure 2 As shown in , in the virtual document, the nodes that directly contain the text are considered as descriptions of the text content, and are regarded as annotation nodes.
[0036] Threshold Algorithm is an efficient top-k query algorithm proposed by Fagin in 2001, which is widely used in various fields. Two conditions need to be met: 1. There is a monotonic relationship between the semantic relevancy of query results and the attribute values affecting the relevancy; 2. The values of the factors...
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.
© 2023 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap