Sybase, Inc.

Shailesh Kamalakar Mungikar

Blaine French

Nandan Marathe

Anant Agarwal

Steven A Kirk

Kaushal Mittal

Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Query access optimizations for tiered index architecture

Tiered index management

Methods and systems configured to facilitate smart pre-fetching for sequentially accessing tree structures such as balanced trees (b-trees) are described herein. According to various described embodiments, a pre-fetch condition can be determined to have been met for a first cache associated with a first level of a tree such as a b-tree. A link to a bock of data to be read into the cache can be read into the cache by accessing a second level of the tree. The data elements associated with the retrieved link can subsequently read into the cache.

Smart pre-fetch for sequential access on BTree

Disclosed herein are system, method, and computer program product embodiments for storing data in a database using a tiered index architecture, An embodiment operates by creating a first tier and assigning a first threshold size to the first tier. When the first tier exceed the first threshold size, the system pushes data from the first tier into a second tier.

Ranking database query results using an efficient method for N-ary summation is provided. Such operation, referred to herein as 'mid-fold N-ary summation' significantly reduces costs of computation for large numbers of queries, as are common in enterprise database applications. Thus, ranking query results using mid-fold N-ary summation offers improved runtime performance and reduced latency relative to using conventional N-ary summation.

Growing community of inventors

Kothrud Pune, India

Shailesh Kamalakar Mungikar