Abstract: Techniques for optimizing result presentation for a database query. A database query is received. The database query is performed with a clause indicating one or more offset values to be used in displaying results from the database query. The one or more offset values indicate a subset within the results from the database query to be presented. An order is imposed on the results from the database query. The subset is presented as determined by the one or more offset values.

Abstract: The technology relates to determining an establishment's presence at a geolocation. A computing device may receive a first image including location data associated with the first image's capture. A set of images, which include location information and one or more identification marks associated with one or more establishments may also be received. The computing device may compare the first image to the set of images to determine whether the first image contains one of the one or more identification marks, and determine that one of the one or more establishments, associated with the one of the one or more identification marks contained in the first image, is currently located within a set proximity of the first image location. The computing device may also update a location database by associating the one of the one or more establishments with a location within a set proximity of the first image location.

Abstract: Embodiments of systems and methods for information retrieval are disclosed. Embodiments of such systems and methods may perform information retrieval based on a language model that is used to generate a single vector for the search terms of a query. Similarly, a single vector representation of each of the data records to be searched is obtained and the single vector representing the search terms of the query compared to the single vector of each data record to determine a similarity metric. The resulting similarity metrics associated with each of the data records can be used to rank, present or return one or more data records.

Abstract: Some embodiments may be associated with a cloud-based computing environment. A centralized multi-tenancy service may include an application interface to receive a query from one of a plurality of applications. A tenant policy store may contain declarative tenant policies, and a tenant policy manager engine may automatically process the received query based on at least one tenant policy. If the received query is not processed successfully, the centralized multi-tenancy service may return an error message to the application via the application interface. If the received query is processed successfully, the centralized multi-tenancy service may exchange information with a multi-tenant service instance (e.g., a multi-tenant database as a service instance) and return a data result to the application via the application interface.

Abstract: Systems, methods, and computer-readable media for event sourcing datastores are provided. Events are sent to an event sourcing datastore (ESDS) from an external service, and the events are appended to an event log. The ESDS maintains the event log in one table and the events are automatically aggregated via streaming. The ESDS is linearly scalable, and enforces uniqueness, consistency, and user-defined constraints when appending events to the event log. The aggregate state is computed asynchronously and transparently cached, which provides increased read throughput and reduced latency. Other embodiments may be described and/or claimed.

Abstract: A current state of a dataset is represented by a mutable B+ tree, while each snapshot of the dataset is represented by an immutable B+ tree. An ordering of B+ trees in the ordered set logically arranges those B+ trees into layers, with the mutable B+ tree representing the current state of the dataset being logically arranged as an upper layer, and with immutable B+ trees representing snapshots of the dataset being progressively arranged as lower layers with the oldest snapshot being a lowest layer. Each B+ tree stores dataset records with a strong or a weak reference state; strong records are independent of any lower-layer record, while weak records are dependent on at least one lower-layer record. A snapshot deletion includes merging the snapshot's corresponding B+ tree with its highest neighbor B+ tree, including merging overlapping records based on their weak vs. strong reference state.

Abstract: A program stored on non-transitory computer-readable storage medium executes a method of evaluating a graph over a query. Decomposition instructions decompose the query into a plurality of subqueries. Evaluation instructions evaluate a subquery of the plurality of subqueries and generate a substitution multiset representing a result of the evaluation of the subquery. Filtration instructions or expansion instructions may operate upon the generated substitution set before passing the substitution set to a next subquery to be evaluated. The filtration instructions identify one or more mappings in the substitution multiset that cannot be safely passed to the second subquery and delete the identified one or more mappings from the substitution multiset. The expansion instructions determine, in a case where the subquery is operated upon by a non-distributive query operator, an expansion of the substitution multiset based at least on adding one or more new substitutions to the substitution multiset.

Abstract: As part of providing the services to users, an online system stores multiple records that are accessible by users of the online system. When a user provides a search query, the online system extracts morphological and dictionary features from the query. The online system provides the extracted features to a machine learning model as an input. The machine learning model outputs a score for each potential entity type that indicates a likelihood that the search query is for a record associated with the entity type. The output from the machine learning model is used by the online system to select one or more entity types that the user is likely searching for. The online system searches the stored records based on the search query but limits the searching to records associated with at least one of the selected entity types.

Abstract: A system for reducing database query latency, the system comprising: a memory storing instructions; and at least one processor configured to execute the instructions to perform operations comprising: receiving data reflecting performance of a role on a virtual server; identifying tokens associated with terms in the received data; mapping an index comprising the tokens and the terms; storing the mapped index in a first database; storing a key-value pair in a second database, the key corresponding to the mapped index, and the value corresponding to a portion of the received data; receiving a query; optimizing the query to reduce query processing time; constructing a search key based on results obtained by running the optimized query against the first database; retrieving a result value from the second database corresponding to the search key.

Abstract: A computer receives a visual specification, which specifies a data source, visual variables, and data fields from the data source. Each visual variable is associated with either data fields or filters. The computer obtains a data model encoding the data source as a tree of related logical tables. Each logical table includes logical fields that corresponds to either a data field or a calculation that spans logical tables. The computer constructs a query corresponding to the visual specification. The query references two logical tables connected via multiple linking fields. To generate the query, the computer generates a first left-outer join of the two tables, forms a hidden join key expression using a coalesce, according to the data model, and generates another left-outer join using the hidden join key expression. The computer executes the query and displays a data visualization according to the results of the query.

Abstract: One embodiment provides a method, including: generating a plurality of ontologies wherein each ontology is generated by: monitoring interactions of a user with lineage information, wherein the monitoring comprises monitoring (i) filter interactions and (ii) access interactions; aggregating the monitored interactions of the user with monitored interactions of other users having a given business role; and generating an ontology for the given business role, wherein the subset comprises (i) event types, (ii) event constraints, (iii) event metadata, and (iv) event context; and upon a user having one of the plurality of business roles accessing lineage information on the data platform, providing a subset of the lineage information.

Abstract: An application component contained in a template is identified. The repository is scanned to determine whether the application component identified from the template is preexisting in the repository. In response to a determination that the identified application component is preexisting, the identified application component is removed before the template is saved in the repository and in response to a determination that the identified application component is not preexisting, the identified application component is posted in the repository.

Abstract: A system formats and normalizes data stored in received files. A data processing engine identifies a filetype and format of the file based on samples of the file contents. The system detects a schema of the file to determine the datatypes and locations of data within the file. The schema detection process may depend on the identified filetype of the file. Once a filetype and schema have been determined, the system can reformat data stored within different sections of the file in view of the datatypes. The formatted file is stored in a data lake with other files received by the system. The formatting process can involve normalization of certain datatypes, which facilitates access of the data later by a user querying the data stored in files at the data lake.

Abstract: An apparatus and method are disclosed. The method, which may be performed by one or more processors, may comprise receiving timestamp data representing a plurality of database transactions and dividing the timestamp data into a plurality of partitioning quanta (nPQ), each partitioning quantum (PQ) of the plurality of partitioning quanta representing a range of timestamps. Further, for each partitioning quantum (PQ) of the plurality of partitioning quanta (nPQ), the method may comprise allocating the timestamp data, such that sequentially adjacent timestamps are allocated to different partitions of a physical storage system for subsequent storage at the allocated partitions.

Abstract: A method may include receiving a data file comprising receivable information associated with at least one transaction; detecting that the data file fails to conform to a defined format; separating the receivable information into a plurality of fields; receiving input identifying remittance information in the plurality of fields; reformatting the data file according to the input into a reformatted data file; and transmitting the reformatted data file for processing of the remittance information.

Abstract: The present invention relates to autonomous tuning of a data grid of documents in a database. Herein are techniques for storage cells to autonomously maintain local indices and other optimization metadata and algorithms to accelerate selective access into a distributed collection of documents. In an embodiment, each storage cell persists a respective subset of documents. Each storage cell stores, in memory, respective index(s) that map each item to location(s), in one or more documents of the respective subset of documents, where the item occurs. One or more computers execute, based on at least a subset of the indices of the storage cells, a data access request from a database management system. In an embodiment, a cloud of JSON document services provides an easy-to-use, fully autonomous JSON document database that horizontally and elastically scales to deliver fast execution of document transactions and queries without needing tuning by a database administrator.

Abstract: The method, computer program product and computer system may include computing device which may collect message data containing one or more metadata tags from one or more collaboration and social media communication networks. The computing device may load the message data into a datastore. The computing device may determine the utility of the one or more metadata tags contained within the message data. The computing device may determine the effectiveness of the one or more metadata tags contained within the message data. The computing device may combine the calculated frequency and the calculated information gain of the one or more metadata tags using regression analysis and may activate a metadata tag management routine for the one or more metadata tags if the combined frequency and information gain falls below a threshold value.

Abstract: The present application relates to systems for generating new variants from an existing corpus of documents and methods for using the same. The systems and methods generally comprise a corpus of documents and one or more types of variety provided by a user. The system generates one or more documents that are variants of the documents in the corpus of documents.

Abstract: A reliable and scalable data repository service can be supporting cooperative transactions. In an example, multiple data producers may use the data repository service to upload data in one or more transactions. Data contained in one transaction may be treated as an atomic unit. In an embodiment, the data repository service manages multiple candidate transactions associated with an election transaction such that at most one candidate transaction may begin and/or commit a given time. During a commit of a candidate transaction, the data uploaded during the candidate transaction may become associated with the election transaction. The data repository service may maintain metadata associated with each of the candidate transactions. In response to a request for data associated with the election transaction, the metadata may be used, in conjunction with a user-specified isolation level, to locate the data uploaded some of the candidate transactions for the election transaction.

Abstract: A method is described for processing keyed data items that are each associated with a value of a key, the keyed data items being from a plurality of distinct data streams, the processing including collecting the keyed data items, determining, based on contents of at least one of the keyed data items, satisfaction of one or more specified conditions for execution of one or more actions and causing execution of at least one of the one or more actions responsive to the determining.