Searching indexed data based on user roles
US-9516029-B2 · Dec 6, 2016 · US
US11546343B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-11546343-B1 |
| Application number | US-202117141151-A |
| Country | US |
| Kind code | B1 |
| Filing date | Jan 4, 2021 |
| Priority date | Aug 12, 2011 |
| Publication date | Jan 3, 2023 |
| Grant date | Jan 3, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.
Opening claim text (preview).
What is claimed is: 1. A method implemented using a computing device, comprising: identifying a resource allocation associated with a project, wherein the resource allocation identifies computing resources assigned to the project, and wherein the project uses the computing resources to receive data and to store the data in a dynamically scalable index store; determining a time window within which the resources assigned to a project receive additional data; modifying, based on one or more rules associated with the project and an amount of the additional data, the resource allocation associated with the project within the time window; and adjusting the computing resources based on the modified resource allocation. 2. The method of claim 1 , wherein the dynamically scalable index store is accessible by an indexer server, and the indexer server is associated with a virtual machine. 3. The method of claim 1 , wherein determining the time window comprises identifying the time window based on past event traffic. 4. The method of claim 1 , wherein determining the time window comprises identifying the time window based on predicted event traffic. 5. The method of claim 1 , wherein the data stored in the dynamically scalable index store is available to a user of the project, and wherein data stored in an overflow index store is unavailable to the user of the project. 6. The method of claim 1 , further comprising: based on determining that a data volume limit assigned to the project has been increased, copying data stored in an overflow index store to the dynamically scalable index store. 7. The method of claim 1 , wherein the one or more rules specify an optimal speed for indexing data corresponding to the project. 8. The method of claim 1 , wherein the one or more rules include a rule-based trigger that is triggered when a speed for indexing the data corresponding to the project falls below a threshold. 9. The method of claim 1 , wherein the one or more rules include a scheduled trigger for adjusting the computing resources assigned to the project. 10. The method of claim 1 , wherein adjusting the computing resources comprises placing a request to adjust the computing resources in a request queue until the request can be fulfilled. 11. One or more non-transitory computer-readable media comprising instructions that, when executed by one or more processors, cause the one or more processors to: identify a resource allocation associated with a project, wherein the resource allocation identifies computing resources assigned to the project, and wherein the project uses the computing resources to receive data and to store the data in a dynamically scalable index store; determine a time window within which the resources assigned to a project receive additional data; modify, based on one or more rules associated with the project and an amount of the additional data, the resource allocation associated with the project within the time window; and adjust the computing resources based on the modified resource allocation. 12. The one or more non-transitory computer-readable media of claim 11 , wherein the dynamically scalable index store is accessible by an indexer server, and the indexer server is associated with a virtual machine. 13. The one or more non-transitory computer-readable media of claim 11 , wherein determining the time window comprises identifying the time window based on past event traffic. 14. The one or more non-transitory computer-readable media of claim 11 , wherein determining the time window comprises identifying the time window based on predicted event traffic. 15. The one or more non-transitory computer-readable media of claim 11 , wherein the data stored in the dynamically scalable index store is available to a user of the project, and wherein data stored in an overflow index store is unavailable to the user of the project. 16. The one or more non-transitory computer-readable media of claim 11 , further comprising: based on determining that a data volume limit assigned to the project has been increased, copying data stored in an overflow index store to the dynamically scalable index store. 17. The one or more non-transitory computer-readable media of claim 11 , wherein the one or more rules specify an optimal speed for indexing data corresponding to the project. 18. The one or more non-transitory computer-readable media of claim 11 , wherein the one or more rules include a rule-based trigger that is triggered when a speed for indexing the data corresponding to the project falls below a threshold. 19. A computer system comprising: a memory storing instructions; and a processor for executing the instructions to perform the steps of: identify a resource allocation associated with a project, wherein the resource allocation identifies computing resources assigned to the project, and wherein the project uses the computing resources to receive data and to store the data in a dynamically scalable index store; determine a time window within which the resources assigned to a project receive additional data; modify, based on one or more rules associated with the project and an amount of the additional data, the resource allocation associated with the project within the time window; and adjust the computing resources based on the modified resource allocation. 20. The computer system of claim 19 , wherein the dynamically scalable index store is accessible by an indexer server, and the indexer server is associated with a virtual machine.
Delete operations (erasing in storage systems G06F3/0652) · CPC title
Indexing; Web crawling techniques · CPC title
Spatial or temporal dependent retrieval, e.g. spatiotemporal queries · CPC title
Document structures and storage, e.g. HTML extensions · CPC title
Multiple levels of security · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.