Patents by Inventor Frederik Transier
Frederik Transier 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).
-
Publication number: 20230394039Abstract: A system includes reception of a query specifying a database table, an aggregate function, a plurality of grouping columns and an aggregation column, determination of whether a tuple of a first row of the grouping columns in the database tables is unique in the grouping columns, storage, if it is determined that the tuple of the first row of the grouping columns is unique in the grouping columns, of a result set entry including the tuple and an aggregation value determined based on a value of the aggregation column in the first row, and, if it is determined that the tuple of the first row of the grouping columns is not unique in the grouping columns, determination of a key based on the tuple and performance of a hash lookup using the key.Type: ApplicationFiled: June 1, 2022Publication date: December 7, 2023Inventors: Frederik TRANSIER, Kai STAMMERJOHANN
-
Patent number: 11151178Abstract: In one aspect, there is provided a method. The method may include adding a tuple phrase to a phrase index as part of a lazy creation of the phrase index. The adding may include adding the tuple phrase to a dictionary mapped to the phrase index, adding to the phrase index a document identifier and a positional information for the tuple phrase, and adapting a first threshold and a second threshold value, the first threshold representing a threshold lower estimate of query processing burden associated with a least burdensome tuple phrase in the dictionary and the second threshold representing a top estimate of query processing burden associated with a most burdensome tuple phrase in the dictionary. The method may further include sending a query response including a generated query result corresponding to the tuple phrase.Type: GrantFiled: December 14, 2018Date of Patent: October 19, 2021Assignee: SAP SEInventors: Frederik Transier, Joern Schmidt
-
Patent number: 11106673Abstract: A method, a system and a computer program product for execution of queries. A first query is executed using a first query execution plan to generate a first result data by applying a first query operator to a first data stored in a first storage location. The first result data is provided to a second query execution plan for execution of a second query. The second query is executed on a second data stored in a second storage location in accordance with the second query execution plan. The second query execution plan includes a second query operator. Based on the execution of the second query, a second result data is generated in accordance with the second query execution plan by at least applying the second query operator to at least the provided first result data.Type: GrantFiled: December 4, 2018Date of Patent: August 31, 2021Assignee: SAP SEInventors: Christian Bensberg, Kai Stammerjohann, Frederik Transier, Martin Richtarsky
-
Publication number: 20200320089Abstract: The present disclosure involves systems, software, and computer implemented methods for compression operation combining duplicate index entries independent of a data model. One example method includes operations to identify an update to at least one entry in a compressed index that includes a plurality of entries, each associated with a unique entry ID. An entry ID of each entry associated with the update are identified. A self-update is performed for each entry not associated with the entry IDs associated with the update, which comprises inserting a value associated with those non-updated entries to an uncompressed index in connection with that entry's corresponding entry ID. For each entry associated with the update, a particular update value from the identified update is inserted into the uncompressed index associated with the particular entry ID. When completed, the uncompressed index is compressed into a new version of the compressed index.Type: ApplicationFiled: April 2, 2019Publication date: October 8, 2020Inventor: Frederik Transier
-
Publication number: 20200192925Abstract: In one aspect, there is provided a method. The method may include adding a tuple phrase to a phrase index as part of a lazy creation of the phrase index. The adding may include adding the tuple phrase to a dictionary mapped to the phrase index, adding to the phrase index a document identifier and a positional information for the tuple phrase, and adapting a first threshold and a second threshold value, the first threshold representing a threshold lower estimate of query processing burden associated with a least burdensome tuple phrase in the dictionary and the second threshold representing a top estimate of query processing burden associated with a most burdensome tuple phrase in the dictionary. The method may further include sending a query response including a generated query result corresponding to the tuple phrase.Type: ApplicationFiled: December 14, 2018Publication date: June 18, 2020Inventors: Frederik Transier, Joern Schmidt
-
Publication number: 20200175008Abstract: A method, a system and a computer program product for execution of queries. A first query is executed using a first query execution plan to generate a first result data by applying a first query operator to a first data stored in a first storage location. The first result data is provided to a second query execution plan for execution of a second query. The second query is executed on a second data stored in a second storage location in accordance with the second query execution plan. The second query execution plan includes a second query operator. Based on the execution of the second query, a second result data is generated in accordance with the second query execution plan by at least applying the second query operator to at least the provided first result data.Type: ApplicationFiled: December 4, 2018Publication date: June 4, 2020Inventors: Christian Bensberg, Kai Stammerjohann, Frederik Transier, Martin Richtarsky
-
Patent number: 10621153Abstract: In one respect, there is provided a method. The method can include processing a first data chunk to generate a first intermediate result. A key map can be generated based on a determination that a quantity of the key-value pairs in the first intermediate result exceeds a threshold. The key map can be generated to include keys in the first intermediate result. A second data chunk can be processed to generate a second intermediate result. The second data chunk can be processed based on the key map. The processing of the second data chunk can include omitting a key-value pair in the second data chunk from being inserted into the second intermediate result based on a key associated with the key-value pair being absent from the key map. A preview of the processing of the dataset can be generated based on the first intermediate result and the second intermediate result.Type: GrantFiled: May 16, 2017Date of Patent: April 14, 2020Assignee: SAP SEInventors: Frederik Transier, Kai Stammerjohann, Nico Bohnsack
-
Patent number: 10452693Abstract: A method can include: reordering an enriched inverted index associated with a database, the enriched inverted index including a first inverted list having a first plurality of current document identifiers of records that contain a first data value, the enriched inverted index further including a first data structure storing enrichment data, the reordering of the enriched inverted index comprising: generating an ordinal sequence corresponding to an order of a first plurality of current document identifiers that include a change of at least one of the first plurality of current document identifiers to a new document identifier; determining a reordered ordinal sequence corresponding to a sorted order of the second plurality of document identifiers; separately reordering, based at least on the reordered ordinal sequence, the first plurality of current document identifiers in the first inverted list and the enrichment data in the first data structure.Type: GrantFiled: April 7, 2017Date of Patent: October 22, 2019Assignee: SAP SEInventors: Frederik Transier, Christian Lemke, Sebastian Seifert
-
Patent number: 10185742Abstract: Flexible text searching for data objects can be implemented. For example, inexact matching of key name terms can be supported. An inverted index can be used to find data objects having key names with terms that are a superset of the key name term being searched. A similar index can be used for values, and the search results can be determined via an intersection. Pattern searching and other features can be supported. Text searching for schema-less collections of data objects can be supported for use in enterprise computing scenarios.Type: GrantFiled: December 16, 2015Date of Patent: January 22, 2019Assignee: SAP SEInventors: Steffen Geissinger, Frederik Transier
-
Publication number: 20180336230Abstract: In one respect, there is provided a method. The method can include processing a first data chunk to generate a first intermediate result. A key map can be generated based on a determination that a quantity of the key-value pairs in the first intermediate result exceeds a threshold. The key map can be generated to include keys in the first intermediate result. A second data chunk can be processed to generate a second intermediate result. The second data chunk can be processed based on the key map. The processing of the second data chunk can include omitting a key-value pair in the second data chunk from being inserted into the second intermediate result based on a key associated with the key-value pair being absent from the key map. A preview of the processing of the dataset can be generated based on the first intermediate result and the second intermediate result.Type: ApplicationFiled: May 16, 2017Publication date: November 22, 2018Inventors: Frederik Transier, Kai Stammerjohann, Nico Bohnsack
-
Publication number: 20180293298Abstract: A method can include: reordering an enriched inverted index associated with a database, the enriched inverted index including a first inverted list having a first plurality of current document identifiers of records that contain a first data value, the enriched inverted index further including a first data structure storing enrichment data, the reordering of the enriched inverted index comprising: generating an ordinal sequence corresponding to an order of a first plurality of current document identifiers that include a change of at least one of the first plurality of current document identifiers to a new document identifier; determining a reordered ordinal sequence corresponding to a sorted order of the second plurality of document identifiers; separately reordering, based at least on the reordered ordinal sequence, the first plurality of current document identifiers in the first inverted list and the enrichment data in the first data structure.Type: ApplicationFiled: April 7, 2017Publication date: October 11, 2018Inventors: Frederik Transier, Christian Lemke, Sebastian Seifert
-
Publication number: 20170177672Abstract: Flexible text searching for data objects can be implemented. For example, inexact matching of key name terms can be supported. An inverted index can be used to find data objects having key names with terms that are a superset of the key name term being searched. A similar index can be used for values, and the search results can be determined via an intersection. Pattern searching and other features can be supported. Text searching for schema-less collections of data objects can be supported for use in enterprise computing scenarios.Type: ApplicationFiled: December 16, 2015Publication date: June 22, 2017Applicant: SAP SEInventors: Steffen Geissinger, Frederik Transier
-
Publication number: 20170147393Abstract: A system provides determination of a first plurality of the plurality of data records assigned to a first processing unit, identification of a first record of the first plurality of data records, the first record associated with a first key value, determination of a first partition based on the first key value, allocation of a first memory block associated with the first partition, the first memory block comprising a first two or more memory locations, generation of a mapping between the first record and a first one of the first two or more memory locations, identification of a second record of the first plurality of data records, the second record associated with a second key value, determination of the first partition based on the second key value, and generation of a mapping between the second record and a second one of the first two or more memory locations.Type: ApplicationFiled: November 20, 2015Publication date: May 25, 2017Inventors: Kai Stammerjohann, Nico Bohnsack, Frederik Transier
-
Patent number: 9177025Abstract: According to some embodiments, a system and method for a parallel join of relational data tables may be provided by calculating, by a plurality of concurrently executing execution threads, hash values for join columns of a first input table and a second input table; storing the calculated hash values in a set of disjoint thread-local hash maps for each of the first input table and the second input table; merging the set of thread-local hash maps of the first input table, by a second plurality of execution threads operating concurrently, to produce a set of merged hash maps; comparing each entry of the merged hash maps to each entry of the set of thread-local hash maps for the second input table to determine whether there is a match, according to a join type; and generating an output table including matches as determined by the comparing.Type: GrantFiled: January 15, 2013Date of Patent: November 3, 2015Assignee: SAP SEInventors: Christian Bensberg, Christian Mathis, Frederik Transier, Nico Bohnsack, Kai Stammerjohann
-
Patent number: 9009155Abstract: A system, method and medium may provide determination of a first plurality of a plurality of data records assigned to a first processing unit, identification of a first record of the first plurality of data records, the first record associated with a first key value, generation of a first dictionary entry of a first dictionary for the first key value, storage of a first identifier of the first record as a tail identifier and as a head identifier in the first dictionary entry, storage an end flag in a first shared memory location, the first shared memory location associated with the first record, identification of a second record of the first plurality of data records, the second record associated with the first key value, replacement of the tail identifier in the first dictionary entry with a second identifier of the second record, and storage of the first identifier in a second shared memory location, the second shared memory location associated with the second record.Type: GrantFiled: October 15, 2012Date of Patent: April 14, 2015Assignee: SAP SEInventors: Nico Bohnsack, Kai Stammerjohann, Frederik Transier
-
Patent number: 8805808Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: June 25, 2013Date of Patent: August 12, 2014Assignee: SAP AGInventors: Frederik Transier, Franz Faerber
-
Publication number: 20130290327Abstract: A system, method and medium may provide determination of a first plurality of a plurality of data records assigned to a first processing unit, identification of a first record of the first plurality of data records, the first record associated with a first key value, generation of a first dictionary entry of a first dictionary for the first key value, storage of a first identifier of the first record as a tail identifier and as a head identifier in the first dictionary entry, storage an end flag in a first shared memory location, the first shared memory location associated with the first record, identification of a second record of the first plurality of data records, the second record associated with the first key value, replacement of the tail identifier in the first dictionary entry with a second identifier of the second record, and storage of the first identifier in a second shared memory location, the second shared memory location associated with the second record.Type: ApplicationFiled: October 15, 2012Publication date: October 31, 2013Inventors: Nico Bohnsack, Kai Stammerjohann, Frederik Transier
-
Publication number: 20130290345Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: June 25, 2013Publication date: October 31, 2013Applicant: SAP AGInventors: Frederik Transier, Franz Faerber
-
Patent number: 8527518Abstract: A search query for a collection of electronic documents is parsed to identify one or more terms and such identified terms are associated with one or more languages (i.e., spoken languages such as English, German, Spanish, etc.). A terms inverted index and a language inverted index are accessed to identify documents responsive to the query. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: December 16, 2010Date of Patent: September 3, 2013Assignee: SAP AGInventors: Frederik Transier, Holger Schwedes, Wolfgang Stephan, Thomas Peh
-
Patent number: 8498972Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: December 16, 2010Date of Patent: July 30, 2013Assignee: SAP AGInventors: Frederik Transier, Franz Faerber