An array index implementation method and system

A technology of array index and implementation method, which is applied in the field of data processing, can solve the problems of relational database finding, increasing quantity, and low query performance, and achieve the effects of performance improvement, fast access, and avoiding a large number of comparison operations

Pending Publication Date: 2021-12-21
JIANGSU DAMENG DATABASE CO LTD
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When performing adjacent vertex / edge query, the entity table and relational table are required to perform join query together, and in order to improve performance, indexes must be established on both the entity table and the relational table. If you want to query multi-hop adjacent vertices / edges, the connected table The number of tables will increase significantly. It is usually difficult for relational databases to find the optimal table connection order within a reasonable time. Even if the optimal connection order is found, the query performance will be low due to repeated comparisons in the B-tree.

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
  • An array index implementation method and system
  • An array index implementation method and system
  • An array index implementation method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0037] figure 1 It is a flowchart of a method for implementing an array index in a data processing system such as a relational database / KV database provided in Embodiment 1 of the present invention. This embodiment can be used to realize the indexing system of data processing systems such as relational database / KV database, as figure 1 As shown, the method specifically includes the following steps:

[0038] S101, the system automatically builds an array index structure at runtime: optionally, the system can automatically create a global vertex array index and edge array index when initializing; it can also be specified when creating entity tables and relational tables (such as create vertex table... etc.) to automatically create vertex array indexes and edge array indexes for specific tables, such tables become vertex tables and edge tables; SQL statements (such as alter table t1 as vertex table, etc.) Some entity tables and relationship tables are converted into vertex tabl...

Embodiment 2

[0082] figure 2 It is a flow chart of a method for implementing an array index in a data processing system such as a relational database / KV database provided by Embodiment 2 of the present invention. This embodiment can be used to realize the indexing system of data processing systems such as relational database / KV database, as figure 2 As shown, the method specifically includes the following steps:

[0083] S201, the same as S101, automatically establishes the array index structure, and this example assumes that the same initial data as S101 is used.

[0084] S202, the data processing system such as database / KV receives and processes the request select L.score match(studentsS, learn L, classes C | S-(L)->C) where S.sno="S001", this request is used to search for The name of the student with the number S001 and the course scores studied, where S-(L)->C indicates the relationship between the start vertex student S learning L and the end vertex course C. It can be determined ...

Embodiment 3

[0088] image 3 It is a schematic structural diagram of an array index implementation system of a data processing system such as a relational database / KV database provided by Embodiment 1 of the present invention. This embodiment can be used to realize the system, and the method can be executed by the array indexing device in the example of the present invention, and the device can be implemented in software and / hardware, such as image 3 As shown, the device includes: an operation analysis module 301 , an operation execution module 302 , an adjacency management module 303 , and an adjacency cache module 304 .

[0089] Operation parsing module: This module is responsible for parsing the received operation request and determining the operation type.

[0090]Operation Execution Module: This module is used to execute the received operation request. If it involves adjacency processing, after the operation is completed, it needs to transfer to the adjacency management module to co...

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 discloses an array index implementation method and system. The method comprises the following steps: (1) a data processing system automatically establishes an array index structure during operation; (2) in the running process of the data processing system, the received operation request is analyzed by a working thread / process in the data processing system, and thus determining an operation type; (3) the data processing system executes corresponding operation; the system comprises an operation analysis module, an operation execution module, an adjacency relation management module and an adjacency relation buffer area module. According to the invention, point and edge objects and an array index mechanism of multi-hop adjacent vertexes / edges can be quickly retrieved, and the performance of adjacency query in a relational database / KV system is greatly improved.

Description

technical field [0001] The invention relates to the technical field of data processing, in particular to a method and system for realizing an array index. Background technique [0002] A traditional database index (index for short) is a separate, physical storage structure that sorts the values ​​of one or more columns in a relational database table. The list of logical pointers pointing to the data pages that physically identify these values ​​in the table is usually implemented with tree-type data structures such as B-tree / B+ tree / LSM tree / SKIPLIST. The function of the index is equivalent to the table of contents of the book, and the required content can be quickly found according to the page number in the table of contents. [0003] An index provides pointers to data values ​​stored in specified columns of a table, and then sorts these pointers according to a user-specified sort order. The database uses the index to find a specific value, and then follows the pointer to...

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): G06F16/22G06F16/2455
CPCG06F16/22G06F16/2282G06F16/2246G06F16/2455
Inventor 付新王学海张静修
Owner JIANGSU DAMENG DATABASE CO LTD
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