Patents by Inventor Rolando Blanco
Rolando Blanco has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10042552Abstract: As part of a columnar in-memory database, value identifiers are inserted into a backing array in-memory until such time that it is determined that such backing array does not have sufficient capacity. A new backing array is then generated that includes the value identifiers in the old backing array and which has sufficient capacity. The old backing array can be flushed from memory when there are no active operations using such backing array. Such an arrangement allows for readers and non-structural writers to operate concurrently.Type: GrantFiled: November 25, 2014Date of Patent: August 7, 2018Assignee: SAP SEInventors: Rolando Blanco, Ivan Schreter, Chaitanya Gottipati, Mihnea Andrei, Reza Sherkat
-
Publication number: 20180150539Abstract: A computer implemented method for manipulating data comprises receiving log transaction information from a primary database system at a secondary database system and parsing the log transaction information to identify data objects that have been modified on the primary database system. The secondary database system determines whether the data objects are present in main memory on the secondary database system. If the data objects are not in the main memory, they are copied from persistence data volumes to the main memory. The data objects are modified by replaying the log transactions on the data objects in the main memory. Then, the data objects in the persistence data volumes are modified. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 30, 2016Publication date: May 31, 2018Inventors: Mihnea Andrei, Rolando Blanco, Shiping Chen, Martin Heidel, Vivek Kandiyanallur, Thomas Peh, Joern Schmidt, Liang Song, Peter Steinemann
-
Patent number: 9886464Abstract: Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero.Type: GrantFiled: November 25, 2014Date of Patent: February 6, 2018Assignee: SAP SEInventors: Rolando Blanco, Muhammed Sharique, Chaitanya Gottipati, Mihnea Andrei, Thomas Legler, Peter Gregor Steinemann
-
Patent number: 9881041Abstract: A delta store giving row-level versioning semantics to a non-row-level versioning underlying store is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the main store allows only non-concurrent transactions on a same table and the delta store has a plurality of row-visibility bitmaps implementing a row-level versioning mechanism that allows concurrent transactions on the same table. A local RID space is established for a table fragment, that for each table in the database, the data of the table is stored in one or more main table fragment in the main store and in one or more delta table fragments in the delta store. Each table fragment has a local RID space, and the local RID space is a collection of one-based contiguous integer local RIDs (Row IDs) describing local positions of the rows of the table fragment.Type: GrantFiled: December 20, 2013Date of Patent: January 30, 2018Assignee: Sybase, Inc.Inventors: Mihnea Andrei, Anil Kumar Goel, Colin Florendo, Rolando Blanco, David Edward DeHaan
-
Publication number: 20170371909Abstract: Persisting data in logical tiers of an in-memory database based on aging rules of the database system. The database system can be configured to age data by moving the data from a first logical tier supporting high performance data access to a second logical tier supporting lower performance data access, thereby improving the operational efficiency of the database system.Type: ApplicationFiled: November 25, 2016Publication date: December 28, 2017Inventors: Mihnea Andrei, Christian Bensberg, Alexander Boehm, Adrian Draguseanu, Xun Chen, Reza Sherkat, Ani Nica, Martin Heidel, Rolando Blanco
-
Patent number: 9817874Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a spatio-temporal index for high-update workloads and query processing. An embodiment operates by a first thread retrieving an update record from a first queue, the update record comprising a location component and a temporal component indicating a location of one of a plurality of mobile devices at a specified time, and updating a columnar-store database with the update record. The embodiment further operates by a second thread identifying a spatial grid of a spatial temporal index within a memory corresponding to the location component of the update record, and updating a temporal index of the spatial grid based on the temporal component of the update record.Type: GrantFiled: September 19, 2013Date of Patent: November 14, 2017Assignee: SAP SEInventors: Suprio Ray, Rolando Blanco, Anil Kumar Goel
-
Publication number: 20160147801Abstract: The subject matter disclosed herein provides methods for reformatting a page due to a rollover. An in-memory array holding a column of data can be maintained. One or more pages can be maintained. Each page can have one or more rows for storing the column of data. The column of data in the in-memory array can be monitored for a change. A rollover can be performed on at least one of the pages based on the change. The rollover can reformat the at least one page by rewriting metadata associated with the at least one page. Related apparatus, systems, techniques, and articles are also described.Type: ApplicationFiled: November 25, 2014Publication date: May 26, 2016Inventors: David Wein, Mihnea Andrei, Ivan Schreter, Rolando Blanco, Thomas Legler
-
Publication number: 20160147806Abstract: Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero.Type: ApplicationFiled: November 25, 2014Publication date: May 26, 2016Inventors: Rolando Blanco, Muhammed Sharique, Chaitanya Gottipati, Mihnea Andrei
-
Publication number: 20160147750Abstract: At least one read operation is concurrently performed with at least one write operation that each insert a key/value pair into a backing array of a backing hash table of a hash table forming part of a columnar in-memory database. The backing array maps a plurality of pointers each to a respective bucket. Each bucket includes at least one state bit and a hashed value of a corresponding key. Thereafter, for each write operation, a first available position in the backing array at which a pointer to a new bucket containing the key/value pair can be inserted is iteratively determined (such that each first available position has no corresponding pre-existing pointer). Subsequently, for each write operation, the pointer to the new bucket containing the key/value pair is inserted at the corresponding first determined position in the backing array. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 25, 2014Publication date: May 26, 2016Inventors: Rolando Blanco, Ivan Schreter, Thomas Legler
-
Publication number: 20160147447Abstract: As part of a columnar in-memory database, value identifiers are inserted into a backing array in-memory until such time that it is determined that such backing array does not have sufficient capacity. A new backing array is then generated that includes the value identifiers in the old backing array and which has sufficient capacity. The old backing array can be flushed from memory when there are no active operations using such backing array. Such an arrangement allows for readers and non-structural writers to operate concurrently. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 25, 2014Publication date: May 26, 2016Inventors: Rolando Blanco, Ivan Schreter, Chaitanya Gottipati, Mihnea Andrei, Reza Sherkat
-
Patent number: 9275097Abstract: A set-oriented locking based on in-memory bitmap for a column store database is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the delta store has a plurality of row-visibility lock bitmaps visible to transactions at various points in time. The lock bitmaps represent a bit encoding to indicate whether there are granted row locks tables in the database. A delete or an update statement is executed with a transaction on a table. A set of row locks on rows of the table manipulated by the delete or the update statement are requested to preclude other transactions from currently deleting or updating the same rows. Accordingly, set operations are performed on the lock bitmap to manage the set of row locks associated with the transaction.Type: GrantFiled: December 30, 2013Date of Patent: March 1, 2016Assignee: Sybase, Inc.Inventors: Mark DeLaFranier, David Wein, Rolando Blanco, Anil Kumar Goel, Mihnea Andrei
-
Patent number: 9268807Abstract: Disclosed herein are system, method, and computer program product embodiments for implementing a bitmap for a column store database. An embodiment operates by creating, by at least one processor, a bitmap identifying rows in a column store database. The bitmap may include a list of bit chunks, a bit chunk including an offset being a natural number indicating a chunk size, and a bit specification including one of an ordered row id list, a contiguous row id sequence, and a bit vector. In addition, the embodiment includes performing database operations using the bitmap.Type: GrantFiled: July 17, 2013Date of Patent: February 23, 2016Assignee: Sybase, Inc.Inventors: Rolando Blanco, Anil Kumar Goel, Mihnea Andrei
-
Patent number: 9268810Abstract: A locking mechanism in a delta-store-based database to support long running transactions across multiple RID spaces is described. An example method includes establishing a column-based in-memory database including a main store and a delta store. A delete or an update statement is executed with a transaction on a table having plurality of table versions. The table versions are represented by bitmaps in the delta store and the bitmaps and table fragments corresponding to the table versions implement RID spaces for the table. A lock on a row of the table manipulated by the delete or the update statement is requested to preclude other transaction from deleting or updating an obsolete version of data. Upon a successful validation that the row to be locked is not the obsolete version in the RID spaces of the table, a lock is granted to the transaction.Type: GrantFiled: December 30, 2013Date of Patent: February 23, 2016Assignee: Sybase, Inc.Inventors: Mihnea Andrei, Anil Goel, Colin Florendo, Rolando Blanco, David DeHaan
-
Patent number: 9262457Abstract: Disclosed herein are system, method, and computer program product embodiments for populating a hash index and returning a handle to the hash index. An embodiment operates by determining, by at least one processor, during query optimization that a first database query has a query execution plan comprising a sub-query which executes N times a correlated predicate having an operator being one of equal and not equal to a base column. A cost of creating and probing the hash index N times and a cost of fully scanning the base column N times are compared based on the correlated predicate. Based on the comparing, it is determined whether to create on-demand a hash index.Type: GrantFiled: August 13, 2013Date of Patent: February 16, 2016Assignee: Sybase, Inc.Inventors: Muhammed Sharique, Anil Kumar Goel, Mihnea Andrei, Rolando Blanco, Harshada Chavan
-
Publication number: 20150186448Abstract: A set-oriented locking based on in-memory bitmap for a column store database is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the delta store has a plurality of row-visibility lock bitmaps visible to transactions at various points in time. The lock bitmaps represent a bit encoding to indicate whether there are granted row locks tables in the database. A delete or an update statement is executed with a transaction on a table. A set of row locks on rows of the table manipulated by the delete or the update statement are requested to preclude other transactions from currently deleting or updating the same rows. Accordingly, set operations are performed on the lock bitmap to manage the set of row locks associated with the transaction.Type: ApplicationFiled: December 30, 2013Publication date: July 2, 2015Inventors: Mark DELAFRANIER, David Wein, Rolando Blanco, Anil Kumar Goel, Mihnea Andrei
-
Publication number: 20150186444Abstract: A locking mechanism in a delta-store-based database to support long running transactions across multiple RID spaces is described. An example method includes establishing a column-based in-memory database including a main store and a delta store. A delete or an update statement is executed with a transaction on a table having plurality of table versions. The table versions are represented by bitmaps in the delta store and the bitmaps and table fragments corresponding to the table versions implement RID spaces for the table. A lock on a row of the table manipulated by the delete or the update statement is requested to preclude other transaction from deleting or updating an obsolete version of data. Upon a successful validation that the row to be locked is not the obsolete version in the RID spaces of the table, a lock is granted to the transaction.Type: ApplicationFiled: December 30, 2013Publication date: July 2, 2015Inventors: Mihnea Andrei, Anil Goel, Colin Florendo, Rolando Blanco, David DeHaan
-
Publication number: 20150178329Abstract: A delta store giving row-level versioning semantics to a non-row-level versioning underlying store is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the main store allows only non-concurrent transactions on a same table and the delta store has a plurality of row-visibility bitmaps implementing a row-level versioning mechanism that allows concurrent transactions on the same table. A local RID space is established for a table fragment, that for each table in the database, the data of the table is stored in one or more main table fragment in the main store and in one or more delta table fragments in the delta store. Each table fragment has a local RID space, and the local RID space is a collection of one-based contiguous integer local RIDs (Row IDs) describing local positions of the rows of the table fragment.Type: ApplicationFiled: December 20, 2013Publication date: June 25, 2015Inventors: Mihnea Andrei, Anil Kumar Goel, Colin Florendo, Rolando Blanco, David Edward DeHaan
-
Publication number: 20150081719Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a spatio-temporal index for high-update workloads and query processing. An embodiment operates by a first thread retrieving an update record from a first queue, the update record comprising a location component and a temporal component indicating a location of one of a plurality of mobile devices at a specified time, and updating a columnar-store database with the update record. The embodiment further operates by a second thread identifying a spatial grid of a spatial temporal index within a memory corresponding to the location component of the update record, and updating a temporal index of the spatial grid based on the temporal component of the update record.Type: ApplicationFiled: September 19, 2013Publication date: March 19, 2015Inventors: Suprio Ray, Rolando Blanco, Anil Kumar Goel
-
Publication number: 20150052150Abstract: Disclosed herein are system, method, and computer program product embodiments for populating a hash index and returning a handle to the hash index. An embodiment operates by determining, by at least one processor, during query optimization that a first database query has a query execution plan comprising a sub-query which executes N times a correlated predicate having an operator being one of equal and not equal to a base column. A cost of creating and probing the hash index N times and a cost of fully scanning the base column N times are compared based on the correlated predicate. Based on the comparing, it is determined whether to create on-demand a hash index.Type: ApplicationFiled: August 13, 2013Publication date: February 19, 2015Applicant: SAP AGInventors: Muhammed SHARIQUE, Anil Kumar Goel, Mihnea Andrei, Rolando Blanco, Harshada Chavan
-
Publication number: 20150026141Abstract: Disclosed herein are system, method, and computer program product embodiments for implementing a bitmap for a column store database. An embodiment operates by creating, by at least one processor, a bitmap identifying rows in a column store database. The bitmap may include a list of bit chunks, a bit chunk including an offset being a natural number indicating a chunk size, and a bit specification including one of an ordered row id list, a contiguous row id sequence, and a bit vector. In addition, the embodiment includes performing database operations using the bitmap.Type: ApplicationFiled: July 17, 2013Publication date: January 22, 2015Applicant: Sybase, Inc.Inventors: Rolando BLANCO, Anil Kumar GOEL, Mihnea ANDREI