Method and device for using connection table to compress data diagram

A technology for compressing data and connecting tables, which is applied in digital data processing, special data processing applications, instruments, etc., can solve the problem that keyword query cannot accurately express query semantics, achieve the effect of reducing storage space and improving execution efficiency
CN100595764CInactive Publication Date: 2010-03-24ηŽ‹ηŠ

Patent Information

Authority / Receiving Office
CN Β· China
Patent Type
Patents(China)
Current Assignee / Owner
ηŽ‹ηŠ
Publication Date
2010-03-24
Estimated Expiration
Not applicable Β· inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention relates to a method by adopting a link list to compress a data map and equipment. The method comprises: recognizing the link list; generating data map nodes corresponding to non link list tuples; generating edges corresponding to the data map nodes for external keys not belonging to the link list; connecting two primary key nodes quoted according to the recognized link list and generating a new edge between two data map nodes corresponding to each pair of tuples associated with the link list. The adoption of the invention can delete the nodes in the data map which are from the link list, combine two corresponding edges, reduce the storage space of the data map by reducing the nodes and edges of the data map and at the same time ensure no loss of information in the data map, namely ensure that during retrieving data from the database, the acquired retrieval results are the same as those before compressing the data map, but greatly reduce the retrieval time and improve retrieval efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to a method for compressing a data graph by using a connection table and a device for realizing the method. Background technique

[0002] Data Graph is an important data model for relational databases to support keyword retrieval. Based on data graphs, many relational database keyword search (Keyword Search Over Rational Databases, KSORD) systems have been developed. These KSORD systems based on data graphs assume that data graphs can be completely loaded into memory to realize memory-based data graphs. search algorithm. However, on the one hand, the data graphs corresponding to many large-scale databases may be too large to fit in memory, and the database size that those memory-based data graph search algorithms can handle is thus limited. On the other hand, the larger the data graph, the more memory it consumes, the lower the query efficiency of the search algorithm based on the data graph, and the more memory it consumes duri...

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