Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Efficient use of trie data structure in databases

A database and application technology, applied in the field of high-performance query systems, can solve problems such as range query performance degradation, and achieve the effect of saving space

Pending Publication Date: 2019-12-31
CENSHARE GMBH
View PDF1 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0025] Furthermore, range query performance of prior art databases degrades with the size of the index (the number of records included by the database and indexed by the index)

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
  • Efficient use of trie data structure in databases
  • Efficient use of trie data structure in databases
  • Efficient use of trie data structure in databases

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0301] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS OF THE INVENTION

[0302] Fig. 1 shows an example of a trie data structure used in a database according to the prior art. It shows a trie data structure 101, where each child node (i.e., all nodes except the root node) is associated with a key part whose value is indicated by a pointer from the parent node and read from the alphabet {0...9} , that is, nodes on every level except the root node are associated with a decimal digit. A path from a root node in a trie to another node defines the key associated with that node, which is a concatenation of key parts associated with nodes on the path. Trie 101 "stores" keys with values ​​"007" and "042" because leaf node 107 of trie 101 is associated with a key with value "007" and leaf node 108 of trie 101 is associated with a key with value "042" associated with the key.

[0303]The root node 102 at the first level 110 has one child node 104 associated with the key portion of...

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 provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunctionon two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, inparticular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Description

technical field [0001] The present invention relates generally to the efficient use of trie data structures in database and information retrieval systems, and to querying such systems with high performance. Background technique [0002] Databases and information retrieval systems are used to process structured and unstructured information. Typically, structured data is the domain of databases (such as relational databases), while unstructured information is the domain of information retrieval systems (such as full-text search). A database engine is the part of a database management system (or other application) that stores and retrieves data. For information retrieval systems, this function is performed by search engines. [0003] Indexing is used to improve the performance of a database or information retrieval system. Without an index for queries (also known as lookup or access by "key"), the entire database or repository would have to be scanned to deliver results, whi...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/22G06F16/245
CPCG06F16/2453G06F16/24558G06F16/24561G06F9/30029G06F17/11G06F16/2237G06F16/2246
Inventor 沃尔特·鲍尔
Owner CENSHARE GMBH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com