-
公开(公告)号：US10185742B2
公开(公告)日：2019-01-22
申请号：US14971883
申请日：2015-12-16
Applicant: SAP SE
Inventor： Steffen Geissinger , Frederik Transier
Abstract: 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.
-
公开(公告)号：US20180276122A1
公开(公告)日：2018-09-27
申请号：US15469818
申请日：2017-03-27
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger
IPC: G06F12/02
CPC classification number: G06F12/0269 , G06F12/0253 , G06F2212/1024 , G06F2212/154 , G06F2212/163 , G06F2212/70
Abstract: Methods, systems, and computer-readable storage media for determining that a transaction of a plurality of transactions performed in at least a portion of a system includes a delete operation, the plurality of transactions being managed by a secondary transaction manager and including a subset of all transactions performed in the system, in response to the delete operation, inserting a clean-up entry in the secondary transaction manager, attaching the clean-up entry to a subsequent transaction in order to determine and assign a time to the cleanup-entry that is used to subsequently trigger garbage collection, and selectively comparing the time to a most-recently-reported minimum read timestamp that is periodically reported to the secondary transaction manager from a primary transaction manager of the system, wherein the clean-up entry is executed in response to determining that the time is less than the most-recently-reported minimum read timestamp.
-
公开(公告)号：US20180129696A1
公开(公告)日：2018-05-10
申请号：US15344223
申请日：2016-11-04
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger
IPC: G06F17/30
CPC classification number: G06F16/2365 , G06F16/93
Abstract: A system for storage, access, and/or pruning of documents of a document store is provided. In some implementations, the system performs operations comprising analyzing a plurality of parameters of a plurality of documents stored among a plurality of slices in a database and generating, based on the analyzing, statistics about the plurality of parameters including a range of document identifiers present in corresponding slices from the plurality of slices. The operations can further comprise pruning, based on the statistics, one or more slices of the plurality of slices, the pruning triggered in response to a query related to at least a portion of the plurality of stored documents. The operations can further comprise responding to the query based on slices that are not pruned. One or more of the operations can be implemented by a database server. Related systems, methods, and articles of manufacture are also described.
-
公开(公告)号：US20170147633A1
公开(公告)日：2017-05-25
申请号：US14949699
申请日：2015-11-23
Applicant: SAP SE
Inventor： Steffen Geissinger , Ivan Schreter
CPC classification number: G06F16/2393 , G06F16/27 , G06F16/283 , G06F16/284
Abstract: A new unique value to be added to a column of a database table can be written to an in-memory array representing a dictionary of the column, and space can be allocated in at least one dictionary block on at least one page maintained on a persistent storage without writing the new unique value to the at least one dictionary block. A pending materialization bit for the at least one page can be set to identify the at least one page for deferred materialization.
-
25.发明授权公开(公告)号：US11947823B2
公开(公告)日：2024-04-02
申请号：US17750900
申请日：2022-05-23
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger
IPC: G06F3/06 , G06F16/22 , G06F16/23 , G06F16/2455
CPC classification number: G06F3/0644 , G06F3/0604 , G06F3/064 , G06F3/0673 , G06F16/2282 , G06F16/2308 , G06F16/2379 , G06F16/2455
Abstract: A data storage and retrieval system for a computer memory including a memory slice formed of segments and adapted to contain one or more documents and a checkpoint adapted to persist the memory slice. The checkpoint includes a document vector containing a document pointer corresponding to a document. The document pointer including a segment identifier identifying a logical segment of the memory slice and an offset value defining a relative memory location of the first document within the identified segment. There are checkpoint memory blocks, each storing a copy of a corresponding segment of the memory slice. The segment identifier of the document pointer identifies a checkpoint memory block and the offset value of the document pointer defines a relative location of the document within the checkpoint memory block.
-
Patent Agency Ranking
公开(公告)号：US11481321B2
公开(公告)日：2022-10-25
申请号：US15469818
申请日：2017-03-27
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger
IPC: G06F12/02
Abstract: Methods, systems, and computer-readable storage media for determining that a transaction of a plurality of transactions performed in at least a portion of a system includes a delete operation, the plurality of transactions being managed by a secondary transaction manager and including a subset of all transactions performed in the system, in response to the delete operation, inserting a clean-up entry in the secondary transaction manager, attaching the clean-up entry to a subsequent transaction in order to determine and assign a time to the cleanup-entry that is used to subsequently trigger garbage collection, and selectively comparing the time to a most-recently-reported minimum read timestamp that is periodically reported to the secondary transaction manager from a primary transaction manager of the system, wherein the clean-up entry is executed in response to determining that the time is less than the most-recently-reported minimum read timestamp.
-
公开(公告)号：US10817507B2
公开(公告)日：2020-10-27
申请号：US15969124
申请日：2018-05-02
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger
Abstract: Provided are systems and methods to acquire a manifest data file and a binary copy of a document store slice log having a first filename and comprising a plurality of entries, each of the plurality of entries associated with a respective database transaction and a commit identifier, and the manifest data file indicating one or more data partitions and one or more slices of each of the one or more data partitions, acquire a partition log for one of the indicated one or more data partitions, the generated partition log comprising a log entry associated with a transaction to create a slice and including a second filename associated with the slice, sort the plurality of entries of the document store slice log based on their associated commit identifiers, change the commit identifiers of each of the plurality of entries to a same commit identifier, and store the sorted and changed entries in a second document store slice log having the second filename.
-
公开(公告)号：US10810092B2
公开(公告)日：2020-10-20
申请号：US15959744
申请日：2018-04-23
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger , Thorsten Glebe
Abstract: Provided are systems and methods for storing checkpoints of an in-memory storage device. In one example, the method may include detecting database transactions performed on a slice of an in-memory storage and storing a record of the database transactions in a log file, receiving a request to persist the slice of in-memory storage, the request comprising a timing indicator corresponding to a timing of database transactions, trimming the log file based on the timing indicator to remove a record of one or more database transactions from the log file that occurred prior to the timing indicator and to preserve a record of one or more database transactions that occurred after the timing indicator, and persisting, to disk, data from the slice of in-memory storage and the trimmed log file preserving the record of the one or more database transactions that occurred after the timing indicator.
-
公开(公告)号：US20200183918A1
公开(公告)日：2020-06-11
申请号：US16730023
申请日：2019-12-30
Applicant: SAP SE
Inventor： Christian Bensberg , Steffen Geissinger
IPC: G06F16/23
Abstract: A database system can receive, from a client, a query specifying at least one database operation implicating data within a first database and within a second database. The first database can have a first transaction manager and the second database can have a second transaction manager. Thereafter, a plurality of transactions are initiated that are responsive to the query to access the data within the first database and the second database. The first transaction manager and the second transaction manager together coordinate execution of the plurality of transactions. All changes specified by the at least one database operation are persisted in persistence of the first database including changes implicating data stored within the second database. Data responsive to the query can then optionally be provided to the client. Related apparatus, systems, techniques and articles are also described.
-
30.发明申请公开(公告)号：US20190384841A1
公开(公告)日：2019-12-19
申请号：US16009779
申请日：2018-06-15
Applicant: SAP SE
Inventor： Steffen Geissinger , Christian Bensberg
IPC: G06F17/30
Abstract: A data storage and retrieval system for a computer memory configured according to a document store adapted to contain documents. The document store includes a document data structure containing a header and a document having one or more members. The document store further includes a chain of one or more differential data structures, each having a header and at least one updated member. The updated member has a value which is updated relative to a value in a corresponding member having a same identifier in the document data structure or in a preceding differential data structure in the chain. A header of each of the differential data structures includes a pointer to the document data structure or the preceding differential data structure in the chain, and a flag indicating that each of the differential data structures contains less than all of the members of the document data structure.
-
-
-
-
-
-
-
-
-
Search Results
50
records
(took 0.014 seconds)
