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

Fast multi-tier indexing supporting dynamic update

A technology of indexing and indexing data structures, which is applied in the fields of instruments, computing, and electrical digital data processing, etc., and can solve the problems of poor performance of tree data structures, etc.

Active Publication Date: 2016-10-12
IBM CORP
View PDF6 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, even when both the tree data structure and the in-memory hash table data structures fit in memory, the performance of the tree data structure is much worse than that of the in-memory hash table

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
  • Fast multi-tier indexing supporting dynamic update
  • Fast multi-tier indexing supporting dynamic update
  • Fast multi-tier indexing supporting dynamic update

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] The description of various embodiments of the invention has been presented for purposes of illustration, but is not intended to be exhaustive or limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

[0021] First of all, it should be understood that although the present disclosure includes a detailed description about cloud computing, the realization of the technical solutions recorded therein is not limited to the cloud computing environment, but can be implemented in conjunction with any other type of computing environment that is now known or lat...

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

A method includes performing a lookup using a key into a root node of a multi-tier data structure, to find a partition for performing an insert. A lookup for the key is performed on a first level index that is part of a linked data structure. A payload or reference is added to the linked data structure based on data structure criterion, otherwise the key and the payload are added to the linked data structure if the key is not found. A new first level index is created and added to the linked data structure upon the linked data structure remaining unchanged. The key and the payload or reference are added to the new index. Based on merge criterion, a new second level index is created and a portion of content from selected first level and second level indexes are merged for combining into the new second level index.

Description

technical field [0001] Embodiments of the present invention relate to data structure processing, and more particularly to multi-tier indexing processing of data structures supporting dynamic update operations. Background technique [0002] There is an increasing trend of doing business intelligence (BI) queries on real-time data in databases or tabular data. Traditionally, there has been a strict separation between BI systems and online transaction processing (OLTP) systems. There is growing market pressure for operational BI and for both transactions and analytics to be performed on the same database. [0003] Trees such as B+ trees are standard data structures for indexing persistent data (mapping keys to data records). They have many benefits, such as: support for concurrent inserts, deletes, and lookups; are naturally organized in pages and can spread well across many layers of the storage disk hierarchy via buffer pools; there are known techniques to make inserts and ...

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
CPCG06F16/2246G06F16/2272G06F16/2255
Inventor R·J·巴博V·里斯G·M·洛曼V·雷曼R·S·希多
Owner IBM CORP
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