Abstract: A computer-implemented method includes receiving, by an application executing on a computing device, a first environment with a first identifier, in response to a first request comprising an authentication code. The method further includes associating, by the application, the first identifier with the authentication code, sending, by the application, a second request comprising the first identifier and the authentication code, and in response to sending the second request, receiving, by the application, a second environment with a second identifier. The second environment is a version snapshot of the first environment.

Abstract: A computer-implemented method includes receiving, by an application executing on a computing device, a first environment with a first identifier, in response to a first request comprising an authentication code. The method further includes associating, by the application, the first identifier with the authentication code, sending, by the application, a second request comprising the first identifier and the authentication code, and in response to sending the second request, receiving, by the application, a second environment with a second identifier. The second environment is a version snapshot of the first environment.

Abstract: A computer-implemented method includes receiving, by an application executing on a computing device, a first environment with a first identifier, in response to a first request comprising an authentication code. The method further includes associating, by the application, the first identifier with the authentication code, sending, by the application, a second request comprising the first identifier and the authentication code, and in response to sending the second request, receiving, by the application, a second environment with a second identifier. The second environment is a version snapshot of the first environment.

Abstract: Systems and methods for accessing multiple resources via one identifier are described, including receiving an input that includes at least an authentication code from an application; associating the authentication code with a resource; receiving another input, which includes at least an identifier associated with the resource and the authentication code, from the application requesting the resource; determining that the application can access another resource based on the authentication code; and based on the determining, providing the another resource to the application.

Abstract: A computer-implemented method includes receiving, by an application executing on a computing device, a first environment with a first identifier, in response to a first request comprising an authentication code. The method further includes associating, by the application, the first identifier with the authentication code, sending, by the application, a second request comprising the first identifier and the authentication code, and in response to sending the second request, receiving, by the application, a second environment with a second identifier. The second environment is a version snapshot of the first environment.

Abstract: Systems and methods for accessing multiple resources via one identifier are described, including receiving an input that includes at least an authentication code from an application; associating the authentication code with a resource; receiving another input, which includes at least an identifier associated with the resource and the authentication code, from the application requesting the resource; determining that the application can access another resource based on the authentication code; and based on the determining, providing the another resource to the application.

Abstract: Systems and methods for accessing multiple resources via one identifier are described, including receiving an input that includes at least an authentication code from an application; associating the authentication code with a resource; receiving another input, which includes at least an identifier associated with the resource and the authentication code, from the application requesting the resource; determining that the application can access another resource based on the authentication code; and based on the determining, providing the another resource to the application.

Abstract: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

Abstract: A computer-implemented method for retrieving information from a dataset of multiple records includes the steps of receiving a search phrase from a user or client application, the search phrase having a query keyword prefix, and traversing a multilayered spatial tree using the query keyword prefix until a termination condition occurs. The multilayered spatial tree is constructed using geographic information and has a root node and a plurality of child nodes including a plurality of leaf nodes. Each leaf node is associated with a corresponding list of records. At least some of the nodes are each associated with a corresponding hybrid filter including an object filter and a child filter. The object filter directly points to one or more records, and the child filter points to one or more child nodes for a subsequent traversal step.

Abstract: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

Abstract: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

Abstract: A computer process, called VGRAM, improves the performance of these string search algorithms in computers by using a carefully chosen dictionary of variable-length grams based on their frequencies in the string collection. A dynamic programming algorithm for computing a tight lower bound on the number of common grams shared by two similar strings in order to improve query performance is disclosed. A method for automatically computing a dictionary of high-quality grams for a workload of queries. Improvement on query performance is achieved by these techniques by a cost-based quantitative approach to deciding good grams for approximate string queries. An approach for answering approximate queries efficiently based on discarding gram lists, and another is based on combining correlated lists. An indexing structure is reduced to a given amount of space, while retaining efficient query processing by using algorithms in a computer based on discarding gram lists and combining correlated lists.

Abstract: A computer process, called VGRAM, improves the performance of these string search algorithms in computers by using a carefully chosen dictionary of variable-length grams based on their frequencies in the string collection. A dynamic programming algorithm for computing a tight lower bound on the number of common grams shared by two similar strings in order to improve query performance is disclosed. A method for automatically computing a dictionary of high-quality grams for a workload of queries. Improvement on query performance is achieved by these techniques by a cost-based quantitative approach to deciding good grams for approximate string queries. An approach for answering approximate queries efficiently based on discarding gram lists, and another is based on combining correlated lists. An indexing structure is reduced to a given amount of space, while retaining efficient query processing by using algorithms in a computer based on discarding gram lists and combining correlated lists.

Abstract: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.