Patents by Inventor Anisoara Nica

Anisoara Nica 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: 10885062
    Abstract: 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: Grant
    Filed: November 25, 2016
    Date of Patent: January 5, 2021
    Assignee: SAP SE
    Inventors: Mihnea Andrei, Christian Bensberg, Alexander Boehm, Adrian Dragusanu, Xun Chen, Reza Sherkat, Anisoara Nica, Martin Heidel, Rolando Blanco
  • Patent number: 10824622
    Abstract: A system, computer-implemented method, and a computer-readable storage medium for determining estimations to statistical questions. Data statistics used in evaluating estimations to statistical questions are gathered from multiple sources in a database management system. A statistical question comprising, for example, cardinality estimations is received, wherein the question is posed by different database components, such as query optimizer, or execution engine. Estimation for the statistical question is computed, where the estimation is based on multiple data statistics and without using the data referred to in the question.
    Type: Grant
    Filed: February 25, 2014
    Date of Patent: November 3, 2020
    Assignee: SAP SE
    Inventors: Anisoara Nica, Anil Kumar Goel
  • Patent number: 10691688
    Abstract: Cracking page-loadable columns for in-memory data management is described herein. An embodiment operates by accessing a column according to a received query, determining that the received query requires a non-critical data structure associated with the column, and rebuilding the non-critical data structure from data associated with the column.
    Type: Grant
    Filed: June 17, 2016
    Date of Patent: June 23, 2020
    Assignee: SAP SE
    Inventors: Anisoara Nica, Peter Bumbulis, Reza Sherkat, Mihnea Andrei, Anil K. Goel
  • Patent number: 10565286
    Abstract: Disclosed herein are system, method, and computer program product embodiments for generating join histograms. An embodiment operates by a computer implemented method that includes determining, by at least one processor, a first interval associated with a first histogram of a first data structure and a first estimate frequency associated with the first interval. The method further includes determining, by the at least one processor, a second interval associated with a second histogram of a second data structure and a second estimate frequency associated with the second interval. The method further includes determining, by the at least one processor, a join interval based on the first and second intervals by calculating an intersection of the first and second intervals. The method further includes calculating, by the at least one processor, a join estimate frequency based on the first and second estimate frequencies.
    Type: Grant
    Filed: December 28, 2016
    Date of Patent: February 18, 2020
    Assignee: SAP SE
    Inventors: Anisoara Nica, Kaleb Paul Alway
  • Patent number: 10311061
    Abstract: The present disclosure involves systems, software, and computer implemented methods for providing quality-driven processing of out-of-order data streams based on a configurable quality metric. In one example, the method includes identifying a configurable quality metric defined by a user or application for executing continuous queries over a sliding window, the metric specifying a user requirement for the quality of the continuous query result. A quality threshold metric is calculated based on the configurable quality metric, the configurable quality metric associated with a size of an adaptation buffer for incoming tuples of the query. In response to receiving a signal indicating a new query result, a sliding window prior to a current time is identified. A runtime quality metric associated with the incoming tuples for the sliding window is measured, and the adaptation buffer is modified based on a difference between the quality threshold metric and the measured runtime quality metric.
    Type: Grant
    Filed: November 6, 2015
    Date of Patent: June 4, 2019
    Assignee: SAP SE
    Inventors: Yuanzhen Ji, Zbigniew Jerzak, Anisoara Nica, Gregor Hackenbroich
  • Patent number: 10216793
    Abstract: The present disclosure involves systems, software, and computer implemented methods for optimizing continuous queries for hybrid execution over a stream processing engine and an in-memory database. In one example, a method may include identifying a continuous query executed at a stream processing engine, the continuous query including a plurality of operators. An optimal plan for execution of the identified continuous query at the stream processing engine is determined. For each of the plurality of operators in the determined optimal plan, an optimized placement decision for executing a particular operator in the stream processing engine or at a database system is determined. An optimized continuous query is generated from the identified continuous query based on the determined optimal placement decisions for each of the plurality of operators in the determined optimal plan. The optimized continuous query is then executed at the stream processing engine and the database system.
    Type: Grant
    Filed: November 3, 2015
    Date of Patent: February 26, 2019
    Assignee: SAP SE
    Inventors: Yuanzhen Ji, Zbigniew Jerzak, Anisoara Nica, Gregor Hackenbroich
  • Publication number: 20180336252
    Abstract: Disclosed herein are system, method, and computer program product embodiments for summarizing large histograms. In an embodiment, a client device may not have access to a full dataset stored in a secure system due to privacy or confidentiality restrictions. The secure system, however, may grant the client device access to a histogram related to the dataset as confidentiality may be maintained. Using this histogram, the client device may summarize the dataset to more efficiently utilize memory resources and/or more quickly execute queries. In an embodiment, the client device summarizes the original histogram into a form having fewer buckets than the original histogram. The client device also calculates new bucket boundaries using pairwise comparison and/or maxdiff algorithms.
    Type: Application
    Filed: May 17, 2017
    Publication date: November 22, 2018
    Inventors: Yogi Ramdas Joshi, Anisoara Nica, David E. DeHaan
  • Publication number: 20180329941
    Abstract: Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.
    Type: Application
    Filed: October 27, 2017
    Publication date: November 15, 2018
    Inventors: Anisoara NICA, Reza Sherkat, Mihnea Andrei
  • Publication number: 20180329973
    Abstract: Disclosed herein are system, method, and computer program product embodiments for performing dynamic partition pruning using data statistic objects as data integrity constraints. An embodiment operates by partitioning a database table into a plurality of partitions based on a partition criterion. The embodiment creates a data statistics object for a partition in the plurality of partitions. The embodiment receives a query for the database table. The embodiment determines the data statistics object is consistent with data in the partition. The embodiment processes the query for the partition based on the data statistics object.
    Type: Application
    Filed: October 27, 2017
    Publication date: November 15, 2018
    Inventors: Reza Sherkat, Anisoara Nica, Xun Cheng, Prabhas Kumar Samanta, Mihnea Andrei
  • Publication number: 20180329974
    Abstract: Disclosed herein are system, method, and computer program product embodiments for determining a constraint data statistics object is consistent. An embodiment operates by receiving a query for a database table. The embodiment determines a constraint data statistic object associated with a partition of the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition of the database table based on consistency metadata of the constraint data statistics object. The embodiment processes the query for the database table based on the determining the constraint data statistics object is consistent with the data state of the partition of the database table.
    Type: Application
    Filed: October 27, 2017
    Publication date: November 15, 2018
    Inventors: Christian Bensberg, Alexander Boehm, Adrian Dragusanu, Xun Cheng, Reza Sherkat, Anisoara Nica, Mihnea Andrei
  • Patent number: 10042886
    Abstract: A method and system, the system including a plurality of machines each having a processor and a main memory component; a shared distributed storage facility storing a set of data and accessible by the plurality of machines over a communication network; a controller to select, in response to a state of a query execution plan comprising a plurality of executable jobs for the set of data, which one of a set of scheduling algorithms to execute; an execution engine to execute the selected scheduling algorithm to determine, for each job in the plurality of jobs, which server to schedule to execute the respective job; and providing an indication of the scheduling of the servers determined to be schedules for the execution of the jobs.
    Type: Grant
    Filed: August 3, 2015
    Date of Patent: August 7, 2018
    Assignee: SAP SE
    Inventors: Pooya Saadat-Panah, Anisoara Nica, Nathan Auch, Peter Bumbulis, Anil Kumar Goel, Jeffrey Pound
  • Patent number: 10019382
    Abstract: Disclosed herein are system, method, and computer program product embodiments for accessing and managing storage class memory (SCM) enabled main-memory database structures. An embodiment operates by traversing a first node to find a location of a second node corresponding to a search key, calculating a hash value for the search key, comparing the calculated hash value with at least one fingerprint value stored in the second node, wherein the fingerprint value is determined by hashing a stored key, accessing at least one key-value pair having a matching hash value, and returning a value associated with the matching key-value pair, wherein at least one of the traversing, calculating, comparing, accessing, and returning are performed by one or more computers.
    Type: Grant
    Filed: October 20, 2015
    Date of Patent: July 10, 2018
    Assignee: SAP SE
    Inventors: Johan Lasperas, Ismail Oukid, Anisoara Nica
  • Publication number: 20180181542
    Abstract: Disclosed herein are system, method, and computer program product embodiments for generating join histograms. An embodiment operates by a computer implemented method that includes determining, by at least one processor, a first interval associated with a first histogram of a first data structure and a first estimate frequency associated with the first interval. The method further includes determining, by the at least one processor, a second interval associated with a second histogram of a second data structure and a second estimate frequency associated with the second interval. The method further includes determining, by the at least one processor, a join interval based on the first and second intervals by calculating an intersection of the first and second intervals. The method further includes calculating, by the at least one processor, a join estimate frequency based on the first and second estimate frequencies.
    Type: Application
    Filed: December 28, 2016
    Publication date: June 28, 2018
    Inventors: ANISOARA NICA, Kaleb Paul Alway
  • Patent number: 10007698
    Abstract: Systems, methods and computer program product embodiments for providing table parameterized function (TPF) functionality in a database are disclosed herein. An embodiment includes defining a TPF in a database, wherein the definition of the TPF defines one or more parameters of the TPF, at least one of the parameters being a table parameter. A query is received that operates to call the TPF, wherein the query defines one or more input parameters, the input parameters comprising at least one table input parameter to be used as input for calling the TPF. The query is processed to produce a result, and the result of the query is returned.
    Type: Grant
    Filed: November 28, 2012
    Date of Patent: June 26, 2018
    Assignee: SYBASE, INC.
    Inventors: Mark Delafranier, Jeffrey J. Plager, Muhammed Sharique, Vipul Sharma, Ivan T. Bowman, Anisoara Nica, Anil K. Goel, Steven A. Kirk
  • Patent number: 9922088
    Abstract: A system, computer-implemented method, and computer-program product embodiments for determining a cardinality estimate for a query. A cardinality estimator identifies a predicate in a query, where the predicate is split into a plurality of equivalence classes. The cardinality estimator then generates a plurality of equivalence graphs from the plurality of equivalence classes, one equivalence graph for an equivalence class. Spanning trees are identified from the plurality of equivalence graphs, and the cardinality estimator then determines the cardinality estimate for the query from the spanning trees.
    Type: Grant
    Filed: December 31, 2013
    Date of Patent: March 20, 2018
    Assignee: SYBASE, INC.
    Inventor: Anisoara Nica
  • Publication number: 20170364554
    Abstract: Cracking page-loadable columns for in-memory data management is described herein. An embodiment operates by accessing a column according to a received query, determining that the received query requires a non-critical data structure associated with the column, and rebuilding the non-critical data structure from data associated with the column.
    Type: Application
    Filed: June 17, 2016
    Publication date: December 21, 2017
    Inventors: Anisoara Nica, Peter Bumbulis, Reza Sherkat, Mihnea Andrei, Anil K. Goel
  • Patent number: 9720774
    Abstract: A system includes determination of a plurality of secondary data structures of a database to be rebuilt, determination, for each of the plurality of secondary data structures, of a current ranking based on a pre-crash workload, a crash-time workload, the post-crash workload, and a rebuild time of the secondary data structure, determination to rebuild one of the plurality of secondary data structures based on the determined rankings, and rebuilding of the one of the plurality of secondary data structures in a dynamic random access memory based on primary data of a database stored in non-volatile random access memory.
    Type: Grant
    Filed: June 29, 2015
    Date of Patent: August 1, 2017
    Assignee: SAP SE
    Inventors: Ismail Oukid, Anisoara Nica, Peter Bumbulis, Wolfgang Lehner, Thomas Willhalm
  • Publication number: 20170132285
    Abstract: The present disclosure involves systems, software, and computer implemented methods for providing quality-driven processing of out-of-order data streams based on a configurable quality metric. In one example, the method includes identifying a configurable quality metric defined by a user or application for executing continuous queries over a sliding window, the metric specifying a user requirement for the quality of the continuous query result. A quality threshold metric is calculated based on the configurable quality metric, the configurable quality metric associated with a size of an adaptation buffer for incoming tuples of the query. In response to receiving a signal indicating a new query result, a sliding window prior to a current time is identified. A runtime quality metric associated with the incoming tuples for the sliding window is measured, and the adaptation buffer is modified based on a difference between the quality threshold metric and the measured runtime quality metric.
    Type: Application
    Filed: November 6, 2015
    Publication date: May 11, 2017
    Inventors: Yuanzhen Ji, Zbigniew Jerzak, Anisoara Nica, Gregor Hackenbroich
  • Publication number: 20170124151
    Abstract: The present disclosure involves systems, software, and computer implemented methods for optimizing continuous queries for hybrid execution over a stream processing engine and an in-memory database. In one example, a method may include identifying a continuous query executed at a stream processing engine, the continuous query including a plurality of operators. An optimal plan for execution of the identified continuous query at the stream processing engine is determined. For each of the plurality of operators in the determined optimal plan, an optimized placement decision for executing a particular operator in the stream processing engine or at a database system is determined. An optimized continuous query is generated from the identified continuous query based on the determined optimal placement decisions for each of the plurality of operators in the determined optimal plan. The optimized continuous query is then executed at the stream processing engine and the database system.
    Type: Application
    Filed: November 3, 2015
    Publication date: May 4, 2017
    Inventors: Yuanzhen Ji, Zbigniew Jerzak, Anisoara Nica, Gregor Hackenbroich
  • Publication number: 20170109295
    Abstract: Disclosed herein are system, method, and computer program product embodiments for accessing and managing storage class memory (SCM) enabled main-memory database structures. An embodiment operates by traversing a first node to find a location of a second node corresponding to a search key, calculating a hash value for the search key, comparing the calculated hash value with at least one fingerprint value stored in the second node, wherein the fingerprint value is determined by hashing a stored key, accessing at least one key-value pair having a matching hash value, and returning a value associated with the matching key-value pair, wherein at least one of the traversing, calculating, comparing, accessing, and returning are performed by one or more computers.
    Type: Application
    Filed: October 20, 2015
    Publication date: April 20, 2017
    Inventors: Johan LASPERAS, Ismail Oukid, Anisoara Nica