Patents by Inventor Ricardo Jimenez Peris
Ricardo Jimenez Peris 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: 11934373Abstract: The present invention refers to the field of transactional data management. The invention provides a transactional semantic concurrency control system for managing a database, wherein the system comprises a data store engine which is adapted to manage the database comprising value rows, and each value row comprising a primary key uniquely identifying each row, at least one semantic column and a commit timestamp; wherein the data store engine is further adapted to manage operation rows, which are rows comprising a primary key, at least one operation to be applied over at least one semantic column of a value row identified by the primary key, and a commit timestamp; store the value rows and the operation rows; generate an operation row when it receives an operation that inserts, updates, upserts, and/or deletes a row of the database with the commit timestamp of the operation; and apply the operations of at least one operation row when a trigger condition is satisfied.Type: GrantFiled: August 5, 2021Date of Patent: March 19, 2024Assignee: LEANXCALE, S.L.Inventors: Ricardo Jimenez Peris, Francisco Jose Ballesteros Camara, Patricio Martinez Garcia
-
Publication number: 20230306011Abstract: The present invention refers to the field of transactional data management. The invention provides a transactional semantic concurrency control system for managing a database, wherein the system comprises a data store engine which is adapted to manage the database comprising value rows, and each value row comprising a primary key uniquely identifying each row, at least one semantic column and a commit timestamp; wherein the data store engine is further adapted to manage operation rows, which are rows comprising a primary key, at least one operation to be applied over at least one semantic column of a value row identified by the primary key, and a commit timestamp; store the value rows and the operation rows; generate an operation row when it receives an operation that inserts, updates, upserts, and/or deletes a row of the database with the commit timestamp of the operation; and apply the operations of at least one operation row when a trigger condition is satisfied.Type: ApplicationFiled: August 5, 2021Publication date: September 28, 2023Inventors: Ricardo JIMENEZ PERIS, Francisco Jose BALLESTEROS CAMARA, Patricio MARTINEZ GARCIA
-
Patent number: 10095745Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.Type: GrantFiled: June 17, 2011Date of Patent: October 9, 2018Assignee: UNIVERSIDAD POLITECNICA DE MADRIDInventors: Ricardo Jiménez Peris, Marta Patiño Martínez
-
Patent number: 9760597Abstract: A system and method for decentralized transaction processing that reduce contention by a number of techniques. First, the transactional management system is decomposed in a number of components that can be scaled out and/or scaled up independently and in a composable way. Second, transactions are committed in parallel without blocking each other. Third, applications can progress when the transactions updates are durable even if the writes of the transaction have not yet completed. Fourth, transactional consistency is guaranteed by making readable only gap-free prefixes of committed update transactions, without blocking the commit of new transactions. Fifth, session consistency is guaranteed by delaying the start of a new transaction till the snapshot of any previous update transaction in the same session is readable.Type: GrantFiled: November 16, 2012Date of Patent: September 12, 2017Assignee: UNIVERSIDAD POLITÉCNICA DE MADRIDInventors: Ricardo Jiménez Peris, Marta Patiño Martínez
-
Publication number: 20160179876Abstract: A system and method for decentralized transaction processing that reduce contention by a number of techniques. First, the transactional management system is decomposed in a number of components that can be scaled out and/or scaled up independently and in a composable way. Second, transactions are committed in parallel without blocking each other. Third, applications can progress when the transactions updates are durable even if the writes of the transaction have not yet completed. Fourth, transactional consistency is guaranteed by making readable only gap-free prefixes of committed update transactions, without blocking the commit of new transactions. Fifth, session consistency is guaranteed by delaying the start of a new transaction till the snapshot of any previous update transaction in the same session is readable.Type: ApplicationFiled: November 16, 2012Publication date: June 23, 2016Inventors: Ricardo JIMENEZ PERIS, Marta PATIÑO MARTÍNEZ
-
Publication number: 20130346446Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.Type: ApplicationFiled: June 17, 2011Publication date: December 26, 2013Applicant: UNIVERSIDAD POLITÉCNICA DE MADRIDInventors: Ricardo Jiménez Peris, Marta Patiño Martínez
-
Publication number: 20130204896Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.Type: ApplicationFiled: June 17, 2011Publication date: August 8, 2013Applicant: UNIVERSIDAD POLITÉCNICA DE MADRIDInventors: Ricardo Jiménez Peris, Marta Patiño Martínez
-
Publication number: 20110314019Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.Type: ApplicationFiled: May 20, 2011Publication date: December 22, 2011Applicant: Universidad Politecnica de MadridInventors: Ricardo Jimenez Peris, Marta Patiño Martinez