US2017228421A1PendingUtilityA1
Querying data set tables in a non-transactional database
Est. expiryJan 3, 2034(~7.4 yrs left)· nominal 20-yr term from priority
G06F 17/30554G06F 17/3033G06F 17/30442G06F 16/245G06F 16/22G06F 16/2228G06F 16/2255G06F 16/248G06F 16/2453
43
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A method and apparatus for facilitating data set query is disclosed. In the method and apparatus one or more tables may be created for the data set, whereby each table of the one or more tables may enable searching the data set using one or more records that are associated with one or more indices of the data set. Upon receiving a request to search the data set, a table of the one or more table is identified based at least in part on the one or more bases for query and is searched to provide a yielded record.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer-implemented method for searching a data set, comprising:
for a data set that is indexed by a plurality of indices, receiving a request to create a search index for querying the data set, the request specifying a query object and a basis for query for the data set, the query object being a data field to become searchable based at least in part on the basis for the query; constructing a table in a database, the table having the basis as a primary key and the query object as a secondary index; and making the table available to service queries.
2 . The computer-implemented method of claim 1 , further comprising:
receiving a request to query the data set; identifying the table based at least in part on the basis; searching the table to yield a record of the secondary index; and providing the record of the secondary index.
3 . The computer-implemented method of claim 1 , wherein the database is a non-transactional database.
4 . The computer-implemented method of claim 1 , further comprising storing the data set.
5 . The computer-implemented method of claim 1 , wherein the primary key comprises a hash key and a hash range.
6 . The computer-implemented method of claim 1 , further comprising:
receiving an update to the data set; and updating the table according to the update.
7 . The computer-implemented method of claim 6 , wherein:
the method further comprises transmitting a notification of the update; and updating the table is triggered as a result of the notification.
8 . A system, comprising at least one computing device configured to implement one or more services, the one or more services:
for a data set in a NoSQL database, receives a query pair that comprises a query object for the data set and a basis, the query object being associated with an index of the data set; creates a table for the data set, the table being searchable based at least in part on a set of records of the basis, the table having a primary key comprising a hash key and a hash range; and makes the table available to be searched to yield a yielded record that belongs to the query object of the query pair.
9 . The system of claim 8 , wherein the one or more services:
receives a request to query the data set; identifies the table based at least in part on the basis; searches the table to yield the record; and provides the record.
10 . The system of claim 9 , wherein the query specifies the basis.
11 . The system of claim 8 , wherein the primary key comprises a hash key and a hash range.
12 . The system of claim 8 , wherein the one or more services:
receives an update to the data set; and updates the table according to the update.
13 . The system of claim 8 , wherein the one or more services:
transmits a notification of an update to the data set; and triggers updating the table as a result of the notification.
14 . The system of claim 13 , wherein the one or more services comprises a queue service that receives the notification.
15 . A non-transitory computer-readable storage medium having collectively stored thereon executable instructions that, as a result of execution by one or more processors of a computer system, cause the computer system to at least:
for a data set that is indexed by a plurality of indices, receive a request to create a search index for querying the data set, the request specifying a query object and a basis for query for the data set, the query object being a data field to become searchable based at least in part on the basis for the query; construct a table in a database, the table having the basis as a primary key and the query object as a secondary index; and make the table available to service queries.
16 . The non-transitory computer-readable storage medium of claim 15 , wherein the instructions further comprise instructions that, as a result of execution by the one or more processors, cause the computer system to further:
receive a request to query the data set; identify the table based at least in part on the basis; search the table to yield a record of the secondary index; and provide the record of the secondary index.
17 . The non-transitory computer-readable storage medium of claim 15 , wherein the instructions further comprise instructions that, as a result of execution by the one or more processors, cause the computer system to further:
provide a web-based interface through which updates to the data set can be effected.
18 . The non-transitory computer-readable storage medium of claim 15 , wherein the primary key comprises a hash key and a hash range.
19 . The non-transitory computer-readable storage medium of claim 15 , wherein the instructions further comprise instructions that, as a result of execution by the one or more processors, cause the computer system to further transmit a notification of an update to the data set to cause the table to be updated.
20 . The non-transitory computer-readable storage medium of claim 15 , wherein the instructions further comprise instructions that, as a result of execution by the one or more processors, cause the computer system to:
receive an update to the data set; and update the table according to the update.Join the waitlist — get patent alerts
Track US2017228421A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.