Abstract: Various embodiments enable a web site to expose various search providers that it promotes to browsers that navigate to that site. In at least some embodiments, the search providers are exposed using the HTML of a web page. When a browser navigates to that site, it processes the HTML of the associated web page and exposes the promoted search providers to the user. In at least some embodiments, the browser can permit use of one or more search providers without requiring the user to install the search provider. Alternately or additionally, in at least some other embodiments, the browser can enable the user to quickly and efficiently install the search provider so that the search provider can be available whenever the user uses their browser application.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources and operators are tries, and in input trie for a higher-order set operation can be the output of a lower-order set operation which is evaluated on demand. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: An optimistic byzantine agreement protocol (the protocol) first tries to reach agreement via an efficient deterministic algorithm (synchronous protocol) that relies on synchrony for termination. If an agreement is not reached (e.g., due to asynchrony), the protocol uses a randomized asynchronous algorithm (asynchronous protocol) for fallback. Although randomized asynchronous algorithms are considered to be costly, the rationale here is to bound communication in non-synchronous runs after an equivalent cost has already paid.

Abstract: Disclosed herein is a computer-implemented method of processing a query using a columnstore comprising a plurality of segments, the method comprising: receiving a query comprising a parameter; determining a key corresponding to the parameter; identifying a mapping structure, from a plurality of mapping structures, relating to said key, wherein each mapping structure corresponds to a respective segment of the columnstore; interrogating the identified mapping structure to determine a value corresponding to the key, wherein the value identifies an entry of an index table of a plurality of index tables that corresponds to the respective segment, wherein the entry of the index table identifies a row of the respective segment of the columnstore relating to the parameter; and retrieving data relating to the parameter from a data source based on data stored in the entry of the index table.

Abstract: In some implementations, the method includes receiving data characterizing a user request indicative of retrieval of a portion of a hierarchical dataset associated with a hierarchical industrial asset and stored in a partition of a database. The user request includes pagination criteria and a search parameter. The method also includes selecting the portion of the hierarchical dataset based on the search parameter. The method further includes generating a plurality of data subsets from at least the portion of the hierarchical dataset. The searching is based on a threshold data subset size included in the pagination criteria. The generating includes dividing the portion of the hierarchical subset into the plurality of data subsets. The size of each data subset of the plurality of data subsets is less than the threshold data subset size. The method further includes providing the plurality of data subsets.

Abstract: A storage node of a database replica group may distribute different portions of data in local storage and external storage, where local storage and external storage are organized using different types of index structures. Responsive to receiving an access request for a database, a storage node may determine that an item of the database to be accessed by the request does not reside within a first portion of the database stored locally at the storage node. Responsive to this determination, the storage node may obtain from an external storage service a second portion of the database, the second portion including a plurality of items including the item, and the second portion organized according to a structure different from the first portion. The storage node may then store the plurality of obtained items in the first portion and process the request using the first portion of the database.

Abstract: Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.

Abstract: A method, apparatus, and computer program product for executing a relational database management system (RDBMS) in a computer system, wherein the RDBMS manages a relational database comprised of at least one column-partitioned base table storing data. Column values from at least one column of the column-partitioned base table are stored in one or more containers spread across one or more data blocks. Metadata comprising summarized information about the column values in the containers is stored in a metadata index subtable. A query with a filtering condition on the column is applied to the metadata index subtable before the column-partitioned base table is accessed, so that only qualified containers and data blocks are accessed, and unqualified containers and data blocks are eliminated, when responding to the query.

Abstract: A method of controlling resynchronization of a source database and a target database may comprise detecting that a connection between the source database and the target database has been restored. Based on the detecting, the method may also comprise identifying a first edit flag for a first row in a first table on the source database. Based on the identifying, the method may also comprise sending the first row from the source database to the target database. Based on the sending, the method may also comprise clearing the first edit flag for the first row.

Abstract: A computer-implemented database system for storing data relating to a series of events may include a memory storing instructions and at least one processor configured to execute the instructions to perform a process. The process may include receiving data relating to a first return request initiated by a first customer via a first user device, and creating a first data structure for the first return request into a first database. The process may also include create a first event for the first return request, and storing the first event in the first data structure. The process may further include receiving data relating to an update associated with the first return request, creating a second event for the update, and inserting the second event into the first data structure.

Abstract: Techniques are described for enabling a database service to provide a zonal consistency model for read and write operations involving database tables replicated across a plurality of availability zones of a cloud provider network according to some embodiments. A database service routes zonally consistent operations to request routers and storage nodes that are located in a same availability zone as the client device from which the request originates. For example, in contrast to standard write operations and strongly consistent read operations, which are processed by a leader storage node that may be located in a different availability zone than the originating request, zonally consistent operations can be processed by any storage node and, in particular, by a storage node in a same availability zone as the originating client device.

Abstract: Techniques for reconstructing or building metadata pages in storage nodes that have a delta-log based architecture. The techniques include walking “up” an ancestor chain of a metadata page, detecting the most recent delta update for a metadata entry of the metadata page, writing the most recent delta update to a location of the metadata entry in the metadata page, setting a bitmap entry corresponding to the location of the metadata entry in the metadata page, detecting a less recent delta update for the metadata entry of the metadata page, and, having previously set the bitmap entry corresponding to the location of the metadata entry in the metadata page, avoiding writing the less recent delta update to the location of the metadata entry in the metadata page. In this way, the need to save in memory the entire ancestor chain of the metadata page can be eliminated.

Abstract: Structured object generation is disclosed. A source record is accessed. The source record includes a plurality of object data fields. An interpolated source record that has a plurality of object data fields corresponding to the plurality of object data fields of the first source record is generated. A template record is accessed. The template record includes a plurality of template record data fields. Subsequent to generating the interpolated source record, an interpolated template record is generated by, for each template record data field that includes a variable, accessing content of the object data field in the interpolated source record to which the variable refers, and replacing the variable with the content to generate a fixed value for the object data field in the interpolated template record.

Abstract: Implementations are directed to receiving a search query from a user, obtaining environmental signal(s) associated with an environment in which the user is located when the search query is received, processing the environmental signal(s) to generate a privacy measure associated with submission of the search query, obtaining additional environmental signal(s) associated with the environment in which the user is located when user input directed to a search interface is received, processing the additional environmental signal(s) to generate an additional privacy measure associated with the user input, selecting, from a superset of historical search queries of the user, a subset of the historical search queries based on at least the privacy measure and the additional privacy measure, and causing the subset of the historical search queries to be presented to the user in response to receiving the user input directed to the search interface.

Abstract: There is described a system and method for managing timeseries data. A timeseries consumer receives timeseries data from multiple devices, provides the timeseries data to a particular partition of a data table based on an insert time of the timeseries data to the data table, and records metadata associated with the timeseries data provided to the particular partition at a track table. A timeseries archiver identifies recent records of the data table based on insert time(s) and archival time(s) of a milestone table, archives the timeseries data of the data table associated with the recent records to an external system, and updates the archival time(s) of the milestone table and the track table. The timeseries purger drops an archived partition of the data table based on determining that all records of the archived partition have been archived.

Abstract: A system may receive a cluster prediction requirement. The system may determine a first node conglomerate by sorting a first dataset into a first plurality of nodes. The system may determine a plurality of attributes by sorting a second dataset associated with the cluster prediction requirement. The system may determine a second node conglomerate for each of the plurality of attributes. A node confidence score may be assigned to each of the second plurality of nodes. The system may determine a node graph based on a comparison between the first node conglomerate and the second node conglomerate. The node graph may be iteratively modified based on a node optimization threshold value to generate a harmonized node graph. The node optimization threshold value may be based on a map confidence score allotted to the node graph.

Abstract: Systems, methods, and storage media are provided that are useful in a computing environment for receiving, modifying, and transforming service level information from database servers and entities in a hosted database environment. Multiple application programming interface (API) calls are made by a database observation system to request information for multiple service level indicators from database servers belonging to multiple different entities. Database observation system receives and aggregates the information for multiple service level indicators from each of the database servers belonging to multiple different entities. The database observation system provides, within a dashboard interface, the aggregated information for each of the multiple service level indicators, individual service level indicator scores, and aggregated service level indicator scores for each of the database servers for each of the multiple entities.

Abstract: Systems, software, and computer implemented methods can be used to present stylized text snippets with search results received from a search query. A search query is received and at least one web-addressable document responsive to the search query is identified. At least a portion of the text associated with the at least one responsive document and including at least a portion of the search term is retrieved. Further, style information associated with the retrieved portion of text is also retrieved. The style information is then applied to the associated portion of text to create a stylized portion of text associated with the at least one responsive document. A set of search query results including a listing of responsive documents and, for at least one of those documents, a stylized portion of text, is presented.

Abstract: A system clock is protected by limiting clock changes, change frequency, and calculating skew. System and secure clocks are initialized to a same time. First and second thresholds are set. The first threshold corresponds to an alert and the second threshold corresponds to an action. At a time interval at which the secure clock is to be updated, a skew is calculated between the system and secure clocks, and a cumulative skew is calculated. Upon a determination that the cumulative skew has reached the first threshold, but not the second threshold, the alert is triggered while deletions of files having retention locks that have expired according to the system clock are allowed to continue. Upon a determination that the cumulative skew has reached the second threshold, the action is triggered. The action includes blocking the deletions of files having retention locks that have expired according to the system clock.

Abstract: A system may receive a query configured to access a column in a data table. The data table may be in a flat file in a big data storage format. The system may detect the language type of the query and validate the query against the syntax of the language type. The system may also validate an access permission for data in the data table. The access permission may be stored in a permissions database. The system may generate a temporary table including the column with the temporary table configured to support the language type. The system may execute the query against the temporary table to generate a query result based on the temporary table as though it were the underlying data table. The system may enforce column-level or row-level access permissions by excluding columns or rows from the temporary table.