Abstract: A data analysis system allows users to interact with distributed data structures stored in-memory using natural language queries. The data analysis system receives a prefix of a natural language query from the user. The data analysis system provides suggestions of terms to the user for adding to the prefix. Accordingly, the data analysis system iteratively receives longer and longer prefixes of the natural language queries until a complete natural language query is received. The data analysis system stores natural language query templates that represent natural language queries associated a particular intent. For example, a natural language query template may represent queries that compare two columns of a dataset. The data analysis system compares an input prefix of natural language with the natural language query templates to determine the suggestions. The data analysis system receives user defined metrics or attributes that can be used in the natural language queries.

Abstract: A method of organizing higher education data is provided. The method includes: (a) providing a plurality of higher education data sources, each of the plurality of higher education data sources including respective higher education data organized using corresponding higher education identifiers; and (b) generating a single higher education identifier organizational structure for accessing the respective higher education data from each of the plurality of higher education data sources.

Abstract: Methods and systems allow organizations to discover accounts, subscriptions, properties, sites and other online portals within each distinct social network platform and across disparate social network platforms, publishing platforms and networks that represent, claim to represent or are relevant to their organization and/or brands based on search terms and facilitate the statistical reporting and analysis of activities on the discovered properties.

Abstract: Example embodiments involve a system, computer-readable storage medium storing at least one program, and computer-implemented method for processing deferred clauses used in conjunction with data definition statements. The method may include receiving a data definition statement signaling creation of a database object. The received data definition statement specifies a dependency of the database object on a non-existing database object. The method may further include determining whether a deferred clause is included in the data definition statement; and based on determining that the deferred clause is included in the data definition statement, creating the database object with the dependency on the non-existing database object.

Abstract: Systems and methods are provided to automatically respond to questions on websites. An electronic communication comprising words is received over a network. In some embodiments, the electronic communication could comprise a message posted by a user on a social networking website. The words of the electronic communication are matched to words in prior search queries, where the prior search queries are associated with online content. A reply is then returned in response to the electronic communication. The reply comprises a representation of the online content, for example, a URL linking to the online content.

Abstract: Systems and methods are provided for tracking System Management Facility (SMF) record types using a small array. An index entry can be modified by adding an extension that tracks what record types are missing, rather than what record types are included in a particular history file. As log data comprising a plurality of history files is received, a flag bit in the header of each history file indicates that the associated history file comprises extended record types. An extension is added to each of the index entries associated with the history files that contain extended record types. Extensions may indicate record type gaps in the associated history file. Upon receiving a query for a particular record type of data stored in the data store, the extension can be utilized to determine which history files do not have the particular record type and can be skipped in the search.

Abstract: The disclosure provides a processing method, device and system for data of a distributed storage system. The method includes: acquiring a first schema structure of target data and a second schema structure of source data; and processing the source data into structural data of the first schema structure according to the first schema structure and the second schema structure. The disclosure solves a problem that a data schema structure in a distributed storage system in related arts is inflexible to be described. There is a beneficial effect of improving description flexibility of the data schema structure so as to improve data processing efficiency.

Abstract: A method and system for providing a rapid access data aggregation information source having a contact portal for rapidly connecting to single or multiple information resources, e.g., databases or retrieval portals, in order to provide owner approved access to various types of remotely readable, addressable, and/or interaction-capable information resources. A focal intention of the data aggregation system is to provide rapid response support through a contact point for locating and contacting a specific database, potentially among a multitude of databases, which holds specific information, located mainly by its type, characteristics, or generic category such as but not limited to medical/health coverage details, medical records, legal documents, estate details, etc.

Abstract: Generating a data model may include receiving a raw data set and generating a first repository based on a first set of features of the raw data set, a second repository having a second set of features based on an aggregation of features of the first repository, and a third repository having a third set of features based on the first and second features sets. The data model may be generated based on a tradeoff between accuracy and provenance of the model.

Abstract: According to an aspect of the present disclosure, a query builder sends to a node in a cloud, a request for meta-data related to objects, and in response receives from the node, the meta-data specifying information related to objects exposed by the node. Upon receiving from a user a partial query and a current edit location during building of a corresponding complete query, the query builder determines, based on the received meta-data, the current edit location, and the partial query, a list of identifiers which are potential candidates for insertion at the current edit location. The query builder then displays the list of identifiers to the user, and receives a selection of an identifier from the displayed list. The query builder incorporates the selected identifier in the partial query at the current edit location to form a further developed query.

Abstract: A method for generating a mapping rule for converting relational data into RDF format data includes obtaining a first mapping rule for converting relational data in a first relational database into RDF format data, wherein a URI pattern of the first mapping rule expresses features of the relational data in the first relational database; parsing a generated rule for the URI pattern of the first mapping rule; determining that a second relational model of the second relational database and a first relational model of the first relational database conform to pattern matching; and generating a second mapping rule for converting the relational data of the second relational database into RDF format data, based on a mapping relationship between the generated rule and the pattern matching of the first relational model and the second relational model.

Abstract: A method for generating a mapping rule for converting relational data into RDF format data includes obtaining a first mapping rule for converting relational data in a first relational database into RDF format data, wherein a URI pattern of the first mapping rule expresses features of the relational data in the first relational database; parsing a generated rule for the URI pattern of the first mapping rule; determining that a second relational model of the second relational database and a first relational model of the first relational database conform to pattern matching; and generating a second mapping rule for converting the relational data of the second relational database into RDF format data, based on a mapping relationship between the generated rule and the pattern matching of the first relational model and the second relational model.

Abstract: Targeted chunking of data is described. A system identifies a length of a sliding window that a data chunking routine applies to a data buffer to create data chunks. The system identifies an expected chunk boundary in the data buffer. The system adjusts the expected chunk boundary, based on the length of the sliding window. The system enables the data chunking routine to start applying the sliding window at the adjusted expected chunk boundary in the data buffer instead of starting application of the sliding window at a beginning of the data buffer.

Abstract: This invention relates to query management. A query management method includes receiving a database query, generating an abstract syntax tree representation of the database path query into a set of java objects, and processing the abstract syntax tree representation of the database path query. The method further includes determining a selector upon processing the abstract syntax tree representation of the database path query and deriving a SELECT clause from the selector clause, where the SELECT clause indicates a portion of an expression from an XMeta Query Language (XMQL) query. The method yet further includes appending a FROM clause to the expression for the XMQL query, appending a WHERE clause to the expression for the XMQL query, and executing the expression for the XMQL query including the appended FROM clause and also the appended WHERE clause to access objects in an object repository.

Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.

Abstract: An example device for providing device information to a device management infrastructure includes a memory subsystem; a communication interface to: receive, from a first device, first device information in a first device-native format; receive, from a second device, second device information in a second device-native format different than the first device-native format; transmit the first device information to a remote server in a device-agnostic format; and transmit the second device information to the remote server in the device-agnostic format; and a device information processor to convert the first device information and the second device information into the device-agnostic format.

Abstract: This invention is a system for integrating relational databases into a semantic web framework utilizing a simple mapping process and the SQL query optimizer present in the SQL database engine.

Abstract: A system and method for mapping a standard set of database query statements to a set of query statements for a target database, including a processor to receive an identification of a target database and identify any extension set of query statements of the target database, receive a plurality of standard database query statements, and map each standard database query statement to a query statement for the target database on the basis of an extension set associated with the target database. A statement mapping database may be created to map the query statements of the target database to the standard database query statements such that the processor may receive a standard database query statement and identify a corresponding query statement that is appropriate for the target database, and receive a query statement of the target database and identify a corresponding standard database query statement.

Abstract: Some embodiments of the present invention include a method for providing social information of members of one or more social networks includes receiving a request for a social handle of a person via a social handle application programming interface (API), the request including contact information about the person, performing a search for the social handle of the person using the contact information, normalizing the social handle if it is not already normalized to generate a normalized social handle, storing the normalized social handle as being associated with the contact information, and providing the normalized social handle in a response to the request.

Abstract: Methods and apparatus for a relational modeler and renderer for non-relational data are disclosed. In response to an indication of non-relational data sources, a relational data model based on one or more model inclusion criteria is generated to represent at least some contents of the non-relational data sources. In response to a model population request from a client, data obtained from the one or more non-relational data sources for one or more tables of the model is stored in cache storage allocated on behalf of the client. In response to a read-only operation request directed to the model, results of the read-only operation are obtained from the cache storage and provided to the requester.

Abstract: A computer-implemented method is provided for analysis of process data. The method comprises receiving an APE statement (Advanced Process Algebra Execution), wherein the APE statement defines a query of process instances from the storage means, and wherein the APE statement comprises at least one process operator, and executing the APE statement and reading the process instances according to the APE statement from the storage means, and providing the result of the query for further processing.

Abstract: In an on demand database system, a query engine applies a custom index for inner queries. The query engine receives a query and determines that the query has an inner query nested within the primary query. The query engine identifies that a custom index exists for a client associated with the query, and applies the custom index to filter results for the query. The custom index includes a subset of information of a table that includes accounts for multiple different clients. By using the custom index, the query engine can filter the results more efficiently that if solely using the multiple client table.

Abstract: A software and hardware facility persistently maintains metrics on directories at different levels within a tree of a filesystem. The facility hierarchically aggregates attributes of files contained by directories and stores them as metric values in each directory within a tree. The stored values represent summed or otherwise aggregated data from the descendant directories and files. The metric values represent aggregated attributes such as checksums, MIN and/or MAX aggregates, sameness bits, bloom filter aggregates, queryable user tags, moving average aggregates, b-tree aggregates, etc. The facility provides mechanisms for efficiently sampling activities performed by the filesystem and visually representing these activities.

Abstract: Systems and methods are provided to automatically respond to questions on websites. An electronic communication comprising words is received over a network. In some embodiments, the electronic communication could comprise a message posted by a user on a social networking website. The words of the electronic communication are matched to words in prior search queries, where the prior search queries are associated with online content. A reply is then returned in response to the electronic communication. The reply comprises a representation of the online content, for example, a URL linking to the online content.

Abstract: In general, techniques are described for representing services, network resources, and relationships between such services and resources in a graph database with which to validate, provision, and manage the services in near real-time. In one example, a controller device includes at least one processor; and at least one memory to store a graph database comprising a graph that represents network resources and relationships between network resources. The controller device receives, at an application programming interface, a data-interchange formatted message that indicates a service request to configure a network service; queries, at least a portion of the plurality of the graph, to determine whether a set of the plurality of network resources can satisfy the service request to provision the network service within the network; and configures the set of the plurality of network resources to provide the network service.

Abstract: Methods and devices for clustering a plurality of sub-networks of a larger interaction network using an enhanced hierarchical clustering algorithm are disclosed. The methods provide expression based sub-network generation using differentially expressed markers. The enhanced hierarchical clustering algorithm clusters the generated sub-networks based on a user defined customizable similarity coefficient. The methods use non-Boolean links to cluster similar sub-networks. This provides consideration of indirect relationships among sub-networks. The customizable similarity coefficient enables the methods to be used for diverse applications such as biomarker detection, patient stratification, personalized therapy, drug efficacy prediction, genetic similarity analysis in genetic diseases. The methods enable patient grouping based on the enhanced hierarchical clustering algorithm.

Abstract: Disclosed are pluggable, distributed computing-system architectures allowing for embedding analytics to be added or removed from nodes of a system hosting an in-memory database. The disclosed system includes an API that may be used to create customized, application specific analytics modules. The newly created analytics modules may be easily plugged into the in-memory database. Each user query submitted to the in-memory database may specify different analytics be applied with differing parameters. All analytics modules operate on the in-memory image of the data, inside the in-memory database platform. All the analytics modules, may be capable of performing on-the-fly analytics, which may allow a dynamic and comprehensive processing of search results.

Abstract: A user interface is generated that displays a set of selectable terms from a glossary of business terms and is configured to generate a business metadata query that identifies a forum with member profiles. A data movement executable is generated that identifies the forum and an analytical processing environment. The data movement executable is deployed and data is moved from the forum into the analytical processing environment. Analytics are performed on the data from the forum. Metadata is identified from the analytics. The glossary of business terms is updated using the metadata from the analytics.

Abstract: A method of managing documents in an active repository that includes receiving one or more documents having metadata from a plurality of cache repositories; registering the metadata in a registry; storing the one or more documents in the active repository; and replicating the stored one or more documents and the registered metadata to a backup system.

Abstract: Systems and methods for foreign key identification are described. The method includes computing a threshold value for each of a primary key-foreign key (PK-FK) pair of a super-set of PK-FK, and generating a sub-set of PK-FK pairs based on comparison of the threshold value and a predefined threshold value. The predefined threshold value is indicative of an acceptance criterion. Further, the method includes determining a conformance score for each of the PK-FK pair of the subset of PK-FK pairs. The conformance score is based on deviations between Cumulative Probability Distribution (CPD) values of PK and CPD of FK for each PK-FK pair. Further, the method includes comparing the conformance score of the each PK-FK pair of the sub-set of PK-FK pairs with a predetermined acceptability index. The predetermined acceptability index is indicative of an acceptance of at least one positive FK from the set of PK-FK pairs.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for natural language processing. One of the methods includes receiving a search query from a user during a user session; obtaining a plurality of prior search queries by the user received during the user session; generating a plurality of candidate query rewrites, wherein the candidate query rewrites are derived from the search query and the plurality of prior search queries by the user; scoring each candidate query rewrite, wherein scoring each candidate rewrite includes determining a quality of each candidate query rewrite based on an analysis of search results responsive to the candidate query rewrite; selecting a candidate query rewrite having a score that satisfies a threshold value; and providing search results responsive to the selected candidate query rewrite.

Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.

Abstract: An in-memory database system and method for administrating a distributed in-memory database, comprising one or more nodes having modules configured to store and distribute database partitions of collections partitioned by a partitioner associated with a search conductor. Database collections are partitioned according to a schema. Partitions, collections, and records, are updated and removed when requested by a system interface, according to the schema. Supervisors determine a node status based on a heartbeat signal received from each node. Users can send queries through a system interface to search managers. Search managers apply a field processing technique, forward the search query to search conductors, and return a set of result records to the analytics agents. Analytics agents perform analytics processing on a candidate results records from a search manager.

Abstract: Disclosed is a method, system, and program product for providing an efficient mechanism to provide updateable relational views over XML. This will allow application developers to write both queries and updates using a relational (SQL) syntax, even though the underlying data is stored as XML. According to some approaches, this is accomplished by implementing a reverse mapping from the data within the views to the node addresses of the corresponding data in the underlying XML document.

Abstract: This invention is a system for integrating relational databases into a semantic web framework utilizing a simple mapping process and the SQL query optimizer present in the SQL database engine.

Abstract: According to one embodiment of the present invention, a system searches content managed by a search engine. The system receives a relational database type query, translates the relational database type query into a query for the search engine, and submits the translated query to the search engine to retrieve information. The system formats resulting information from the search engine into a relational database query result set. Embodiments of the present invention further include a method and computer program product for searching content managed by a search engine in substantially the same manners described above.

Abstract: Some embodiments provide a file system for purging content based on a single traversal of the file system that identifies the directory containing the content without performing a secondary traversal within the directory to target the operation to only the file that are associated with content such that other files contained in the directory are unaffected. The file system supplements traditional directory structures with file-level directories. Each file-level directory is created to contain a root file associated with particular content, different variants of the particular content, and supporting files. Consequently, the file system can complete an operation targeting particular content by performing that operation on the file-level directory containing the particular content, thereby eliminating the need to conduct a file-by-file traversal of the containing directory as a prerequisite to identifying the files associated with the particular content and performing the operation on the files individually.

Abstract: Techniques for calculating a ranking of at least one item in a plurality of items. The techniques include receiving user preferences comprising a plurality of first-order user preferences indicative of a user's preferences for items in the plurality of items, and at least one second-order user preference indicative of the user's preferences among first-order user preferences in the plurality of first-order user preferences; calculating, with at least one processor, a ranking of the at least one item in the plurality of items based, at least in part on, at least one data structure encoding a preference graph that represents the received user preferences; and identifying and outputting at least a subset of the plurality of items to a user, in accordance with the ranking.

Abstract: Technologies are described herein for executing queries expressed with reference to a structured query language against unstructured data. A user issues a structured query through a traditional structured data management (“SDM”) application. Upon receiving the structured query, an SDM driver analyzes the structured query and extracts a data structure from the unstructured data, if necessary. The structured query is then converted to an unstructured query based on the extracted data structure. The converted unstructured query may then be executed against the unstructured data. Results from the query are reorganized into structured data utilizing the extracted data structure and are then presented to the user through the SDM application.

Abstract: Techniques and mechanisms to manage data. A relational database environment having at least a relational database storage device is coupled with a server entity. Data stored in the relational database is stored in a custom object, which is one or more custom database tables that allow a customer/tenant/organization to store information unique to the customer/tenant/organization. A non-relational database environment having at least a non-relational database storage device is also coupled with the server entity. Data stored in the non-relational database is immutable. A single user interface and search language is utilized by the server entity to provide access to both the relational database environment and the non-relational database environment.

Abstract: A system and process is provided in which original video or dialog content is securely received from the content owner. Subtitle language data is derived, translated, stored and served on a separate database for synchronous playback with the content in video streaming, downloading or online TV following the activation of an option by the end user through a media player.

Abstract: The mobile device includes a client that has a number of modules, and the MMR Gateway and MMR matching unit are implemented as a server that has a number of modules. The implementation of the MMR system as a client and a server is advantageous because the modules may be distributed among the client and the server in a variety of configurations. The present invention includes a capture module, a preprocessing module, a feature extraction module, a retrieval module, a send message module, an action module, a prediction module, a feedback module, a sending module, an MMR database, a streaming module, an e-mail module, a voice recognition system and an audio database. These modules and systems are operational upon the client or the server.

Abstract: A method for accelerating time series data base queries includes segmenting an original time series of signal values into non-overlapping chunks, where a time-scale for each of the chunks is much less than the time scale of the entire time series, representing time series signal values in each chunk as a weighted superposition of atoms that are members of a shape dictionary to create a compressed time series, storing the original time series and the compressed time series into a database, determining whether a query is answerable using the compressed time series or the original time series, and whether answering the query using the compressed time series is faster. If answering the query is faster using the compressed representation, the query is executed on weight coefficients of the compressed time series to produce a query result, and the query result is translated back into an uncompressed representation.

Abstract: This invention relates to a service registry and repository system, method and computer program product for accessing objects in an object repository. A method of managing an object database for objects comprising: receiving a database XPATH query; translating the database path query into an object query; and querying the object database using the object query. The translating comprises: breaking the path query into nodes; examining each node to identify objects for selection and objects from which selection is made; consolidating objects for selection from each node; consolidating objects from which selection is made; and forming the object query from a SELECT clause made up of the consolidated objects for selection from each node and from a FROM clause made up of the consolidated objects from which selection is made.

Abstract: A telemetry system can parse and transform one or more change sets from a format intended to be processed by a computer to a form that is readily consumable by a human. The report or display generated to present the results can be customized for a particular domain.

Abstract: A system, method and computer product for managing distributed transactions of a database. A transaction manager is provided for each of a plurality of transactions of the database. Each transaction manager is configured to perform functions that include generating a transaction token that specifies data to be visible for a transaction on the database. The database contains both row and column storage engines, and the transaction token includes a transaction identifier (TID) for identifying committed transactions and uncommitted transactions. A last computed transaction is designated with a computed identifier (CID), record-level locking of records of the database is performed using the TID and CID to execute the transaction, and the plurality of transactions of the database are executed with each transaction manager.

Abstract: A search engine server supports delivery of search results using an international search string option by identifying websites that provide support in English as well as the language of the international search string. The international search string is a search string in any of the languages that are listed/supported by the search engine server. The search engine server delivers web links of websites that provide support in both English as well the language of the international search string by identifying conjugate English terms, strings or phrases for the international search string, that provide exact or approximate equivalent meaning for searching. In addition, the search engine server also provides web links of websites that provide international language support by utilizing a thesaurus in English that provides synonyms for the conjugate English terms. The search engine server also translates websites where there is no support in the language of the search string.

Abstract: According to one embodiment, a speech translation apparatus includes a speech recognition unit, a translation unit, a search unit and a selection unit. The speech recognition unit successively performs speech recognition to obtain a first language word string. The translation unit translates the first language word string into a second language word string. The search unit search for at least one similar example and acquires the similar example and a translation example. The selection unit selects, in accordance with a user instruction, at least one of the first language word string associated with the similar example and the second language word string associated with the translation example, as a selected word string.

Abstract: Methods, systems and apparatus, including computer program products, for expanding search queries. One method includes receiving a search query, selecting a synonym of a term in the search query based on a context of occurrence of the term in the received search query, the synonym having been derived from statistical machine translation of the term, and expanding the received search query with the synonym and using the expanded search query to search a collection of documents. Alternatively, another method includes receiving a request to search a corpus of documents, the request specifying a search query, using statistical machine translation to translate the specified search query into an expanded search query, the specified search query and the expanded search query being in the same natural language, and in response to the request, using the expanded search query to search a collection of documents.

Abstract: Certain example embodiments relate to techniques for creating queries on model data of at least one data source (DS1, . . . , DS3) in accordance with at least one data source specific format. A graphical query builder (QB) is configured to enable a user to graphically define a query including multiple building blocks in accordance with a data source independent format (MM). At least one adapter (A1, . . . , A3) for the at least one data source (DS1, . . . , DS3) is configured to translate the query in the data source independent format (MM) into at least one corresponding query in the data source specific format.