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

Differentiated secondary index maintenance in log structured nosql data stores

a technology of structured nosql and secondary indexes, applied in the field of data storage, can solve the problems of secondary indexes, lack of basic database functionality, and has become a stumbling factor, and achieve the effect of accelerating point queries, avoiding broadcast queries, and being more robus

Inactive Publication Date: 2014-09-18
IBM CORP
View PDF6 Cites 78 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The patent describes a way to make point queries faster in NoSQL data stores by using a secondary, global index that is managed by multiple region servers. This index avoids broadcasting queries to every data partition, making it more robust and efficient. The index can have multiple consistency levels that allow for different tradeoffs between accuracy and latency depending on the workload. This approach helps achieve faster processing times while maintaining data consistency.

Problems solved by technology

While these NoSQL data stores are a great fit for high-scale, low-complexity applications, as these applications get more complex, a lack of basic database functionality, e.g., secondary indexes, has become a stumbling factor.

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
  • Differentiated secondary index maintenance in log structured nosql data stores
  • Differentiated secondary index maintenance in log structured nosql data stores
  • Differentiated secondary index maintenance in log structured nosql data stores

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018]Astonishing growth and diversity in data have profoundly affected a way that data have been stored and served. Monolithic relational databases that are good at processing structured data and excel in ACID (atomicity, consistency, isolation, durability) cannot handle high-traffic Internet applications in an elastic manner. This is because relational databases put restrictions on data normalization and consistency, and also the relational databases are not able to perform data sharing in an automatic way so that the relational databases are difficult to scale out. To address challenges in flexible schema and elasticity, data stores dealing with columns, key / value pairs, documents and graphs have emerged and collectively identified as NoSQL data stores. A NoSQL data store, e.g., HBase, that supports a convergence of transactional and analytics workloads is able to offer balanced “read” and “write” performance.

[0019]Consider a web application that manages social reviews (e.g., yel...

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

There is provided a method for operating multi-node data stores. A data table is stored in a first computing node and an index table is stored in a second computing node. The index table provides keys used for accessing data in the first computing node and other multi-node data stores. Operations that update or read the data table accessed from the first computing node and the index table accessed from the second computing node are performed. The operations optimize between latency in updating or reading the data table and the index table and data consistency maintained between data entries in the data table and data entries pointed by indices in the index table

Description

BACKGROUND[0001]This disclosure relates generally to data storage, and particularly to a multi-node data store.BACKGROUND OF THE INVENTION[0002]A data store refers to a data repository that uses a database, e.g., IBM® DB2®, etc., to manage data stored in the data repository. A data store may include a plurality of computing nodes, each of which uses a database management system to management data stored in a corresponding computing node. In recent years, scale-out data stores, referred as NoSQL data stores, are gaining attraction to support high-traffic Internet applications, e.g., yelp.com. A NoSQL data store is a class of database management systems that do not use a relational database model. A category of NoSQL data stores includes Log Structured Merge (LSM) Tree which is optimized for writing of data and MapReduce for scanning of data but is not optimized for point queries, e.g., a query directed to a specific datum. Examples of NoSQL data stores include, but are not limited 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
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F17/30
CPCG06F17/30345G06F16/273G06F16/22G06F16/27G06F16/162G06F16/275G06F16/2228G06F16/2282G06F16/23G06F16/278
Inventor TAN, WEITATA, SANDEEP
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