Abstract: A geospatial indexing module operating in a server device operates on an efficient index for retrieving and providing map features which represent geographic entities such as streets, roads, cities, states, buildings, bodies of water, etc. The index includes identification information for a map feature fragment, which represents at least a portion of a map feature, as well as a node in a tree data structure to which the map feature fragment corresponds and a range of levels of detail for which the map feature fragment is valid. When a user requests map data for a geographic region at a level of detail, the geospatial indexing module queries the index for all map feature fragments within the requested region and level of detail and provides the retrieved map feature fragments to the user.

Abstract: Techniques for generating domain and client-specific application program interface recommendations are provided. In one example, a computer-implemented method comprises determining a semantic similarity between a first client application program interface and a second client application program interface based on a modified client application program interface being generated by removing text data associated with a first description of the first client application program interface. The computer-implemented method can further comprise matching the first description to a second description of the second client application program interface based on the semantic similarity, resulting in on or more matched client application program interfaces. Additionally, the computer-implemented method can further comprise associating the first client application program interface with a community based on the one or more matched client application program interfaces.

Abstract: Update elements allow logical data object instances, and change requests therefor, to be converted from a first schema to a second schema. For logical data object instances, a transformation function can add nodes to, or remove nodes from a hierarchy of the first schema, or rearrange them. Use of the transformation function can allow second schemas to be defined that change a node hierarchy, yet can be used with existing logical data object instances in the first schema. Changes to logical data object instances can be converted using a mapping or a transformation function, such as a transformation function useable to convert logical data object instances between the first and second schemas. The migration of change requests to the second schema can allow logical data object instances having previously scheduled change requests to be updated from the first schema to the second schema prior to execution of the change request.

Abstract: Disclosed is a method performed by a network node (300) in a communication network for correlating information of a first network domain (310) with information of a second network domain (320), the second network domain being different from the first network domain. The method comprises receiving (102) event information of a first event that occurred in the first network domain and receiving (104) event information of a second event that occurred in the second network domain, wherein the event information of the first event and the event information of the second event each comprises a user ID, UID; a time stamp, and a geographical information.

Abstract: Techniques for generating domain and client-specific application program interface recommendations are provided. In one example, a computer-implemented method comprises modifying, by a device operatively coupled to a processor, a description of a client application program interface by removing text data associated with the description of the client application program interface, resulting in a modified description of the client application program interface. The computer-implemented method can further comprise analyzing, by the device, a performance associated with the client application program interface to generate an ontology based on a semantic similarity between the modified description of the client application program interface and one or more previous descriptions of one or more previous client application program interfaces.

Abstract: A system for detecting a conflict of interest between entities includes a server and a database. The server defines categories and stores information at the database arrangement. A category to be evaluated is selected for detecting whether or not two given entities have a conflict of interest. A tree structure is created with the category and child and descendent categories of the category. The category and the child and descendent categories are hierarchically arranged as nodes of the tree structure. For the two given entities a conflict potential value is computed for each node of the tree structure. A conflict index value based upon the conflict potential value of that node for each of the two given entities is computed. A conflict of interest between the two given entities is detected if the conflict index value (c) of a node of the tree structure matches at least one predefined criterion.

Abstract: Techniques for improving search using generalized linear mixed models are disclosed herein. In some embodiments, a computer-implemented method comprises: receiving a search query comprising at least one search term and being associated with a user; extracting features from corresponding profiles of a plurality of candidates; for each one of the candidates, generating a corresponding score based on a generalized linear mixed model comprising a generalized linear query-based model and a random effects user-based model; selecting a subset of candidates from the plurality of candidates based on the corresponding scores; and causing the selected subset of candidates to be displayed to the user in a search results page for the search query.

Abstract: A computer-implemented method queries a database that comprises modeled objects. Each modeled object represents a physical attribute of a respective real object. The database comprises for each modeled object, a respective simplicial complex. The method comprises providing a query that includes a signature criterion, and returning, as results of the query, respective modeled objects of the database. The respective modeled object is returned based on an extent to which the respective modeled object has a respective simplicial complex that respects the signature criterion. Such method system improves the field of searching modeled objects in a database.

Abstract: Methods and systems for recovering databases and other applications with reduced downtime using recoverable chains are described. When protecting or backing up a database, an integrated data management and storage system may capture snapshots of the database at a snapshot frequency (e.g., at 15 minute intervals) and acquire database transaction logs that include data changes of the database at a frequency that is greater than the snapshot frequency. The integrated data management and storage system may generate a particular point in time version of the database by identifying a recoverable chain that comprises a combination of one or more database snapshots including the snapshot closest to the recovery point and one or more database transaction logs.

Abstract: Systems, devices, media, and methods are presented to identify a set of attributes, generate attribute clusters, and select data sets corresponding to relative values of the attributes within an attribute cluster. The systems and methods receive a first identifier associated with a first member profile of a first member, identifying a set of second members with second member profiles associated with the first member profile, generating a cluster for the first member profile and one or more of the second member profiles. The systems and methods generate a cluster representation with a set of cluster attributes, identify a plurality of data sets associated with a set of core attributes of the cluster attributes, and cause display of an identification of at least one data set.

Abstract: Systems and methods are provided for loop escape analysis in executing computer instructions. In one embodiment, a method comprises instructions performed by at least one computer process. The method comprises receiving a set of executable computer instructions stored on a storage medium (e.g., by reading the instructions from a tangible, non-transitory storage medium). The method further comprises analyzing the computer instructions to determine a loop, analyzing the computer instructions to determine at least one new variable in the loop, and storing, in a data structure, at least one of an operation related to the variable or a value related to the variable. The method further comprises determining whether to compress the data structure upon reaching the end of the loop, and, based on the determination, compressing the data structure. Systems and computer-readable media are also provided.

Abstract: The present disclosure relates to a method for processing data in a database engine. The method includes storing a first instance of a first table in the database engine in plaintext. Encryption information about encryption methods and encryption keys of at least one predefined column of the first table may be maintained. In response to data changes in the column, first log entries for the data changes may be written in plaintext. The data changes may be encrypted by an encryption component using the encryption information. This results in encrypted data changes. Second log entries for the encrypted data changes may be written and applied to a second instance of the first table. The second instance of the first table is stored at a further database engine.

Abstract: The present disclosure relates to a method for processing data in a database engine. The method includes storing a first instance of a first table in the database engine in plaintext. Encryption information about encryption methods and encryption keys of at least one predefined column of the first table may be maintained. In response to data changes in the column, first log entries for the data changes may be written in plaintext. The data changes may be encrypted by an encryption component using the encryption information. This results in encrypted data changes. Second log entries for the encrypted data changes may be written and applied to a second instance of the first table. The second instance of the first table is stored at a further database engine.

Abstract: A data acquiring section specifies individual tables to serve as reference destinations of designated respective foreign key columns and, for each combination of key values in primary key columns of the specified individual tables, acquires a total value of relation values in a designated relation value column. A grouping section groups the respective key values in the primary key columns of the individual tables on the basis of the total value acquired for each combination of the key values in the primary key columns of the individual tables and a statistical model of a designated type. An attribute value column adding section adds, to each individual table, an attribute value column of which attribute value is identification information on a group to which each key value in each primary key column of each individual table belongs.

Abstract: New methods of relational database management are described, for example, to enable completion and checking of data in relational databases, including completion of missing foreign key values, to facilitate understanding of data in relational databases, to highlight data that it would be useful to add to a relational database and for other applications. In various embodiments, the schema of a relational database is used to automatically create a probabilistic graphical model that has a structure related to the schema. For example, nodes representing individual rows are linked to rows of other tables according to the database schema. In examples, data in the relational database is used to carry out inference using inference algorithms derived from the probabilistic graphical model. In various examples, inference results, comprising probability distributions each for an individual table cell, are used to fill missing data, highlight errors, and for other purposes.

Abstract: Retrieving data records from a database is provided. A query is received by a database access API requesting a number of data records stored in the database. A parallel batch processor is created for data transmittal, and the parallel batch processor is returned to a client program. A next data record responsive to the query is requested, and the next data record is removed from a list of records. The next data record is then provided from the parallel batch processor to the client program.

Abstract: Distributed processing of a data collection includes receiving information for configuring a distributed processing system. A first configuration of components is formed including sources of data elements and workers configured to process data elements, distributed among computing resources. Each data element includes a partition value that identifies a subset of the workers according to a partition rule. Data elements are accepted from the sources for a first part of the data collection in a first processing epoch and the data elements are routed through the first configuration. After accepting a first part of the data collection, change of configuration is initiated to a second configuration. A succession of two or more transitions between configurations of components is performed to a succession of modified configurations, a last of which corresponds to the second configuration. Further data elements are accepted from sources of the second configuration in a second processing epoch.

Abstract: Techniques for generating representative images are disclosed herein. In particular, various embodiments utilize an image generation service to generate representative images for categories and sub-categories of objects. Each representative image can be a stylized depiction of an aggregated image corresponding to a particular category of objects. A user can refine the search, or continue to browse, by selecting one of the representative images. This enables users to quickly identify features the user is looking for or would like to exclude, by depicting the sort of objects associated with that category.

Abstract: Aspects of the present disclosure relate to systems and methods that help automate the validation of a configuration of a functional product. Every functional product, be it a service, device, or combination thereof, has one or more documents associated with it. These documents may include such documentation as: (1) Release Notes; (2) Configuration Guides; (3) command line interfaces (CLIs)/application program interfaces (APIs); (4) Data Sheets; (5) Installation Guides; (6) User Manuals; (7) Errata notices; and (8) other documentation. In embodiments, datatset used for validating a configuration setting may be extracted using natural language processing from technical documentation. In embodiments, this extracted information is used to validate a design vector representing a configuration setting.

Abstract: A distributed file system may be configured with file blocks of a first type and file blocks of a second type, from allocation units that comprise a logical volume containing the file system. File blocks of the second type may be defined from one or more file blocks of the first type. A thick file may be instantiated with a number of allocation units totaling a size greater than or equal to a specified file size of the thick file. The allocation units may be allocated to the thick file in units of file blocks of the first type or file blocks of the second type, depending on the specified file size of the thick file.