Abstract: The disclosed embodiments provide a system that searches a graph database. During operation, the system obtains a log-based representation of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system obtains a first query containing a first search pattern for searching the log-based representation. The system then matches the first search pattern to one or more records in the log-based representation. Finally, the system outputs, as a first result of the first query, the one or more records in a subgraph of the graph.

Abstract: Implementations for data migration in a maintenance procedure executed on a software system include actions of providing a first access schema, through which a first version of an application accesses data in a database system, establishing an API-schema, through which at least one direct consumer accesses data in the database system, the API-schema including one or more proxy objects that are mapped to respective one or more objects of the first access schema based on metadata of the API-schema, the metadata providing a mapping and one or more object definitions, and in response to execution of a maintenance procedure: providing a second access schema, through which a second version of the application accesses data in the database system, switching to the second access schema, and revising the mapping of the API-schema, such that at least one proxy object of the API-schema maps to a respective object of the second access schema.

Abstract: Detecting missing entities in a graph schema is provided. Unlabeled and unstructured data of a particular domain are divided into a plurality of Voronoi cells using a clustering algorithm that is initiated with cluster centroids proportional to a number of entity types corresponding to the particular domain existing in the graph schema. One additional cluster more than the number of entity types corresponding to the particular domain existing in the graph schema is initialized using a cluster initializing formula of the clustering algorithm. It is determined whether the one additional cluster is populated. In response to determining that the one additional cluster is populated, an entity type is determined to be missing from the number of entity types existing in the graph schema. The missing entity type is added to the graph schema.

Abstract: A method comprises counting, in a transcript of a chat session between a first user and a second user, for each theme of a plurality of themes, a number of occurrences of each keyword of a plurality of keywords assigned to a theme of a plurality of themes. The method further comprising identifying one or more themes of the chat session based on the number of occurrences of each keyword, counting the number of occurrences of a word of a first set of words and a word of a second set of words in the transcript, and assigning the transcript into a first group or a second group based on the one or more identified themes and the number of occurrences of first words and second words.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: Systems and methods are described for extracting data from digital documents, indexing the data, and providing a user interface for filtering the data and generating a document based on the filtered data. In one implementation, a method includes extracting data from one or more digital documents, the extracted data including elements of a first type, the elements of the first type including key-value pairs; indexing the extracted data; hosting a web-based application instance, the web-based application instance including a user interface for searching the indexed data and filtering elements of the first type based on rules defined by a user of the user interface; receiving rules for filtering the elements of the first type; and filtering the elements of the first type based on the received rules.

Abstract: A disaster-recovery system contains a networked array of synchronous-to-asynchronous converter (SATC) modules that connect source databases to target backup databases. During backup, the system replicates each source-database transaction through a chain of these SATCs to a corresponding target, storing a local copy of the transaction on each SATC along the way. Each transaction's path between its source-target pair is identified by a set of tracking entries, where each entry identifies one SATC in the path. Before initiating a recovery operation, the system regenerates the tracking entries in order to reconstruct paths to source databases. The system then synchronously searches SATCs along each path for local copies of lost transactions that had not time to be fully replicated before the occurrence of a catastrophic failure. The full-blown recovery is started only after all lost transactions have been properly replicated to target databases.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: Social network search techniques are described. In an implementation, one or more search criteria are stored that are usable to search for users of a social network service. Responsive to a new user joining the social network service, a search of data associated with the new user is performed using the stored one or more search criteria to determine whether the one or more search criteria are met by the new user.

Abstract: A network resource access system for providing access by a user to network resources over a communications network, the system comprising: a resource registry including stored resource records associated with each of the network resources and a stored user profile containing a list of network resources such that the network resources have a ranking relative to each other based at least in part on user behavior with respect to usage of each of the network resources, the user profile associated with the user such that the list of network resources contains the network resources previously accessed by the user; and a resource service for receiving an access query from a network terminal identifying the user and associated with submission of application data for processing by a selected network resource from the list, the resource service further configured for accessing the user profile to identify a suggested network resource from the list in view of the relative ranking and for sending identification of the su

Abstract: Techniques for processing composite commands in a file system are disclosed. A file system receives a composite command that includes an argument. The file system parses the argument and encounters a particular flag indicating that the argument includes an additional command. The file system executes the additional command using an application programming interface (API).

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: A system includes reception of a first query to search two or more heterogeneous data providers, generation of a first query language excerpt to define a combined key column based on key columns associated with a first data provider of the two or more heterogeneous data providers, for each of two or more columns of the first data provider, generation of a second query language excerpt to map the column of the first data provider to a respective result set key column and a respective result set value column, generation of a third query language excerpt to identify two or more of the result set value columns to search, and generation of a first query language statement based on the first, second and third query language excerpts.

Abstract: A method includes receiving, at a processor of a computing device, a first search query during editing of a design, the first search query including at least a first search term. The method also includes identifying at least one style attribute associated with the design and searching at least one database based on the first search term, the at least one style attribute, or a combination thereof, to generate search results. The method further includes outputting the search results. A first search result of the search results is ranked higher than a second search result of the search results based on a determination that the first search result more closely matches the at least one style attribute associated with the design than the second search result.

Abstract: Techniques for improving database searches are described herein.

Abstract: A method for presenting a trusted tag cloud to a user. The method includes associating a number of tags with a first user who applies the tags, calculating a weight of the tags being examined by a second user. The weight may be based on the identity of the second user, the identity of the first user, and examining the relationship between the two. The tags may then be presented to the user in accordance with the value of the weight.

Abstract: The invention relates to a computer-implemented method for processing a query in a database, the query comprising a search value. The database comprises a plurality of datasets the datasets comprising entries, wherein distance statistics are assigned to the datasets. The distance statistics describe the minimum and maximum distance between the values of the entries of a dataset of the plurality of datasets and a reference value. The method comprises determining the distance between the search value and the reference value, said determination resulting in a search distance, determining a subset of datasets from the plurality of datasets for which the search distance is within the limits given by the minimum and maximum distances described by the respective distance statistics, and searching for the search value in the subset of datasets.

Abstract: A process is provided for independently hashing and filtering a data set, such as during preprocessing. For the data set, one or more records, separately having one or more fields, may be identified. A record hash value set, containing one or more record hash values for the respective one or more records, may be generated. Generating a given record hash value may be accomplished as follows. For a given record, a hash value set may be generated, having one or more field hash values for the respective one or more fields of the given record. The record hash value for the given record may be generated based on the hash value set. A total hash value for the data set may be generated based on the record hash value set. The records of the data set may be filtered based on classification of the query that generated the records.

Abstract: A method, computer system, and computer program product for retrieving information is provided. The method comprises receiving an information request, determining corresponding confidence indexes of a plurality of information sources, each of the confidence indexes being indicative of a capability of the corresponding information source to respond to the information request determined according to one or more social activities relating thereto, selecting a selected information source of said information sources according to the confidence indexes, submitting the information request to the selected information source, receiving selected information from the selected information source in response to the information request, and returning the selected information as a result of the information request.

Abstract: A computer-executed method includes storing in a data store data attributes, data objects, a data analysis tool (DAT), and render functions. Each data object has an attribute set and an identifier set. The method includes identifying each data object that has an attribute set comprising a data attribute matching each reference data attribute associated with the DAT, and selecting an identified data object as an input data object for the DAT. The DAT generates a new data object as a function of the input data object, which includes analyzing the input data object with reference to an auxiliary data object and creating an identifier set for the new data object that includes an identifier of the new data object for distinguishing the new data object from each other data object in the data store, and the identifier of the auxiliary data object. The new data object is stored in the data store. Each render function is associated with a set of reference data attributes.