Top-k combined centered keyword query method

Abstract

The invention discloses a Top-k combined centered keyword query method. The method comprises the following steps of: S1, generating a hub tag HL of an entity network G offline by using a PLL (Phase Locked Loop) algorithm; S2, acquiring the hub label HL of the entity network G, and receiving a specified query keyword set Q={q1, q2,..., qg} and a group number K of a keyword matching combination to be queried from a user; S3, combining the query keyword set Q to generate a keyword-based hub tag KHL on line; S4, initializing a keyword matching entity enumerator and a keyword matching combination enumerator; and S5, conducting keyword matching entity incremental enumeration and keyword matching combination incremental enumeration, and carrying out effective entity failure verification; the problems that according to an existing Top-k combined keyword query method, the adaptability is poor due to the fact that the storage overhead of the shortest path between direct storage entity pairs is too large, and the response speed is low due to full enumeration of keyword matching entity sets and repeated calculation of invalid entities are solved.

Description

technical field [0001] The invention belongs to the technical field of data query, in particular to a keyword query method with a Top-k combination center. Background technique [0002] With the popularization of the mobile Internet and the rapid development of social media platforms, people use social platforms and mobile applications as carriers to interact with information every day, greatly informatizing entities, and forming various physical networks. In the huge entity network, there are various data tags and connection relationships of the entity. It is widely used to retrieve and analyze the information in the entity network through keyword query. Keyword query has different search semantics for different specific applications. Among them, central keyword query is one of the commonly used query modes. In actual scenarios, individuals or companies search on human resources websites or company websites based on the keywords of skills required by projects and projects....

AI Technical Summary

Problems solved by technology

[0009] In order to solve the problems in the prior art, the present invention provides a Top-k combined keyword query method with a center, which solves the shortest path storage between the existing Top-k combined keyword query method due to direct storage of entity pairs. Poor adaptability caused by excessive overhead, slow response speed caused by full enumeration of keyword matching entity sets and repeated calculation of invalid entities

Images