Aggregation summarization method for keyword search result of hierarchical relation data

A hierarchical relationship and keyword technology, applied in the field of relational databases, can solve problems such as difficulties, achieve the effect of reducing connection overhead, reducing search space, and improving summary efficiency

Inactive Publication Date: 2013-02-27
FUDAN UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It should be noted that there is also another work to support the aggregation operation, but it needs to be specified by the user on whi

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
  • Aggregation summarization method for keyword search result of hierarchical relation data
  • Aggregation summarization method for keyword search result of hierarchical relation data
  • Aggregation summarization method for keyword search result of hierarchical relation data

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach

[0053] consider figure 1 The relational database schema shown in (e) and figure 1 (a, b, c, d) correspond to instances of the pattern. This is a database of items sold by a company. figure 1 The directed arrows in (e) indicate that there is a (one-to-many) relationship between schemas with primary keys pointing to foreign keys. Consider that a user types in the keyword combination "a" and "b" when retrieving information, which means that the car with characteristics a and b needs to be retrieved. Then follow the steps below to aggregate summary:

[0054](1) Select the connected result set T containing a and b respectively 1 and T 2 .

[0055] (2) Traverse T in order 1 Traverse T in order during the process of tuples 2 In the tuple, if the connection result is not the lowest upper layer in the hierarchical relationship, the result will be deleted. Image 6 The 2nd and 3rd tuples are deleted.

[0056] (3) For the aggregated result set MaxLMC(S, Q) obtained in (2), prun...

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 belongs to the technical field of relational databases, in particular to an aggregation summarization method for a keyword search result of hierarchical relation data. The method comprises the following steps of: giving a relational database D having a hierarchical relation H and a search Q and n search results S on the relational database D, wherein S contains result tuples t1, t2,..., and tn; according to the hierarchical relation H, aggregating the n search results, namely t1, t2, ..., and tn into a maximum lowest upper-layer minimum covering aggregate by using a sequenced connection method according to a principle of the lowest upper-layer minimum covering aggregate; iterating aggregation results to search maximum covering according to the principle of the maximum covering; and pruning in a searching process to find a greedy result I. In the method, connection operation is reduced according to the hierarchical relation in an aggregation process, and time cost is reduced by introducing a pruning method in a summarization process, so aggregation summarization efficiency is higher.

Description

technical field [0001] The invention belongs to the technical field of relational databases, in particular to a method for summarizing and summarizing keyword search results on hierarchical relational data. Background technique [0002] In recent years, keyword retrieval has gained wide acceptance as a method to extract desired information from structured or semi-structured data. At present, there are many retrieval systems proposed for keyword retrieval. However, retrieval systems based on relational databases are more devoted to obtaining tuples or tuple-connected trees containing all keywords. Simply returning these results creates redundant information and sometimes produces nonsensical results. In addition, in many databases, data with hierarchical relationships are ubiquitous, which can guide the information integration of retrieval results. [0003] Many people have been studying the further processing of retrieval results, including scoring methods and result aggr...

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
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