Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby a collaborative data layer and associated logic facilitate, for example, efficient access to, and implementation of, collaborative datasets. In some examples, a method may include receiving data representing a query into a collaborative dataset consolidation system, identifying datasets relevant to the query, generating one or more queries to access disparate data repositories, and retrieving data representing query results. In some cases, one or more queries are applied (e.g.

Abstract: A smart tuple manager includes a mechanism for splitting a smart tuple, and for automatically generating one or more classes from existing classes when a smart tuple is split. When a first smart tuple is split into second and third new smart tuples, classes for the second and third smart tuples are automatically generated from the class for the first smart tuple. The classes for the second and third smart tuples are subsets of the data elements and code segments in the first class. After a class is automatically generated, new code segments may be added to the class as needed.

Abstract: A method of retrieval of items of particular relevance from a particular domain. A processor receives from a remote computing device a resource-identifying string that has a combination of a predefined notation and a resource-related sub-string. The processor uses the resource-identifying string to retrieve a subset of data items from within a data set, the subset of data items relating to a subset of resources within a set of resources available to be served by the particular domain over a distributed network. The processor uses the subset of data items to generate a list of the subset of resources and serves the list to the remote computing device.

Abstract: The present disclosure relates to transmitting a request for a set of data records, the request indicating encrypted data items associated with first and second interval boundaries, and selectively traversing a partially ordered set to determine an encrypted data item of the partially ordered set that is associated with an interval boundary of the first and second interval boundaries, based on no cache entries being associated with any encrypted data item associated with the interval boundary. The selectively traversing may include decrypting one or more portions of the partially ordered set, determining the encrypted data item of the partially ordered set, and transmitting a request to retrieve a data element of a linear order annotated to the encrypted data item of the partially ordered set associated with the interval boundary, to cause generation of a new cache entry including the encrypted data item and the data element.

Abstract: Certain example embodiments relate to systems and/or methods for cloud-based event-driven integration, which in essence inverts the current point-to-point integration pattern by using an event-driven system in its place. Certain example embodiments transform and normalize integration patterns in connection with an underlying framework that helps decouple data producers from data consumers and advantageously allows additional systems to simply “plug into” the framework. Data from event sources is transformed into an event with a well-defined event type that may be picked up by an event sink, transformed into a format relevant for that event sink, and subsequently processed.

Abstract: An image display device, a method for driving the same, and a computer readable recording medium are provided. The image display device includes a speech acquirer configured to acquire a speech query associated with a query created by a user, a display configured to display a query list composed of candidate queries having the same as or similar semantic as the acquired speech query, and an operation performer configured to perform an operation related to the query selected from the displayed query list.

Abstract: Methods and systems are provided for providing search results while maintaining search context. A search system may display a plurality of links related to a received search query, wherein the links are all of the same entity type. The system may display sets of search results related to the plurality of links, while continuing to display the plurality of links.

Abstract: A system and method for searching databases is disclosed herein. A database system may comprise a first database cluster H and a second database cluster L. After receiving a search request from a requester, the search request is executed in the first database cluster H to retrieve a first set of results. If the first set of results is greater than a minimum number of results, then the first set of results are presented to the requester. Otherwise, the second database cluster L is searched to retrieve a second set of results. Then the first set of results and the second set of results are presented to the requester. The first database cluster H is stored on a first database server; and the second database cluster L is stored on a second database server apart from the first database server. Other embodiments are also disclosed herein.

Abstract: The present disclosure relates generally to question answering systems and methods and, particularly, to systems and methods for domain adaptation in question answering.

Abstract: As information becomes more accessible to the public, the ability to predict and estimate sensitive data from the data already available to the general public becomes easier. The existing privacy-preserving data mining approaches only consider the information the user is querying and do not consider the information the user already has, and how the user can use that information in combination with the query information to create sensitive data that the user should not have access to. Some embodiments of the present invention provide a query analysis (QA) program that solves the aforementioned problem by taking into account data that a user may already have, whether it is private data or data that is available to the public, and then using that data, along with the data that would be returned in the query, to determine if sensitive data could be recreated.

Abstract: In some example embodiments, a first alias creation statement is received. The first alias creation statement comprises a first table identifier of a first table, a second table identifier of a second table, a first alias identifier, and a first common table expression, and the first common table expression comprises the first table identifier. A first alias for the second table is generated based on the first alias creation statement, with the first alias comprising the first alias identifier and the first common table expression. The first alias is stored as metadata of the second table. A first query statement is received, with the first query statement comprising the second table identifier and the first alias identifier, and the first query statement is rewritten using the first common table expression based on the first alias identifier to generate a first rewritten query statement.

Abstract: Automated database manager aspects selectively apply different active constraints within a definition statement for a hybrid constraint name to a relational database management system table data field. One at a time the definition statement constraints are selected and tested, their logical set values to TRUE in response to the testing meeting their defined conditions and an OR statement output generated of the logical values of all of the hybrid constraint name definition statement constraints, wherein the logical values are linked by logical OR operators and the output is TRUE in response to the logical value of any one of the constraints having a logical value of TRUE. In response to the OR statement output set to TRUE, the data operation is performed on the target table name and affected column name without testing any other untested ones of the constraints within the definition statement.

Abstract: As information becomes more accessible to the public, the ability to predict and estimate sensitive data from the data already available to the general public becomes easier. The existing privacy-preserving data mining approaches only consider the information the user is querying and do not consider the information the user already has, and how the user can use that information in combination with the query information to create sensitive data that the user should not have access to. Some embodiments of the present invention provide a query analysis (QA) program that solves the aforementioned problem by taking into account data that a user may already have, whether it is private data or data that is available to the public, and then using that data, along with the data that would be returned in the query, to determine if sensitive data could be recreated.

Abstract: The present disclosure relates to a computer system for querying a database residing on a server computer of the computer system, said database storing data records, the database further comprising a relation, wherein the relation comprises data items, wherein the data items are encrypted with a first encryption method in the relation, wherein the data items form a partially ordered set in the relation, the partial order being formed with respect to the data items in non-encrypted form, wherein a referential connection exists assigning each encrypted data item in the relation to a respective data record of the data records, wherein the encrypted data items are annotated with data elements of a linear order in the database, the linear order corresponding the order in which the encrypted data items are stored in the relation with respect to the partial ordered set, the computer system further comprising a client computer, the client computer being configured for sending to the server computer a request for data

Abstract: A system and method for logging changes to a database table comprises an administration tool, table metadata, a history table, and a service engine. The administration tool provides an interface through which a database administrator (DBA), database programmer, or other user can manage the table metadata and the history table, including the selection of columns within the table for which the system will track changes.

Abstract: Methods, stored instructions, and computer systems are described for selecting an OR-expansion state of a query. A query processor accesses a certain query and a control parameter. The certain query comprises disjunctive predicates, and the control parameter indicates a certain procedure of a plurality of alternative stored procedures for expanding queries comprising disjunctive predicates into semantically equivalent candidate queries comprising combinations of subqueries. Based at least in part on the control parameter, the query processor selects the certain procedure to expand the certain query into one or more certain semantically equivalent candidate queries, each comprising a different combination of two or more subqueries. The query processor causes cost-based evaluation of subject queries, including the certain query and the one or more certain semantically equivalent candidate queries.

Abstract: Methods and apparatus for associating an entity with at least one search query. Some implementations are directed to methods and apparatus for identifying multiple queries associated with an entity and identifying one or more of the queries as an entity search query that provides desired search results for the entity. Some implementations are directed to methods and apparatus for identifying a particular entity and, in response to identifying the particular entity, identifying an entity search query corresponding to the particular entity.

Abstract: A method for providing an output data stream in a network system comprises receiving a request for a desired output data stream and identifying at least one input data stream on the basis of the desired output data stream. The method further comprises identifying at least one relationship between the at least one identified input data stream and the desired output data stream, determining at least one operator on the basis of the at least one identified relationship and creating a query for generating an output data stream corresponding to the desired output data stream. The query is created by applying the at least one operator to the at least one identified input data stream.

Abstract: A translation system can translate a storage request having multiple fields to a physical address using the fields as keys to traverse a map. By using a map table, multiple storage services can be condensed into a single map traversal. The map can be made of nodes that include one or more node entries. The node entries can be stored in a hashed storage area or sorted storage area of a node. A node entry of root nodes or inner nodes can include a link to a next node. A node entry of a leaf node can include a physical address. Using the request fields as a key to a node, a node entry can be determined. A pointer in a root node entry or inner node entry can be followed to a next node. A physical address in a leaf node can be the translation of the storage request.

Abstract: A method and apparatus are provided for navigating through a media object collection using a mobile device. Users navigate to the target media objects by repeatedly specifying filters. After a user specifies a filter, the filter is applied in combination with all previously specified filters to produce a filtered set of media objects. After a filter is applied, a display level is selected for each hierarchical dimension for which the media objects have metadata. The selection of the display level may be based on the number of distinct values that the media objects in the filtered set have for each level of the hierarchical dimension. Single-action controls are then displayed for each of the values that the media objects in the filtered set have for the selected display level.

Abstract: A encrypted text wildcard search method enables wildcard search of encrypted text by using a permuterm index storing permuted keyword strings that are encrypted using an order preserving encryption algorithm. The permuted keyword strings are encrypted using an order preserving encryption algorithm or a modular order preserving encryption algorithm and stored in the permuterm index. In response to a search query containing a wildcard search term, the encrypted text wildcard search method transforms the wildcard search term to a permuted search term having a prefix search format. The permuted search term having the prefix search format is then used to perform a range query of the permuterm index to retrieve permuted keyword strings having ciphertext values that fall within the range query. In some embodiments, the encrypted text wildcard search method enables prefix search, suffix search, inner-wildcard search, substring search and multiple wildcard search of encrypted text.

Abstract: A computer-implemented method for processing query information includes receiving query information at a server system. The query information includes a portion of a query from a search requestor. The method also includes obtaining a set of predicted queries relevant to the portion of the search requestor query based upon the portion of the query from the search requestor and data indicative of search requestor behavior relative to previously submitted queries. The method also includes providing the set of predicted queries to the search requestor.

Abstract: A first stream operator can receive a first tuple including a first set of attributes to be stored in a first window and a second tuple including a second set of attributes to be stored in a second window. The first window and the second window can each have an eviction policy. In response to triggering the eviction policy for the first window and the second window, the first tuple stored in the first window can be compared with the second tuple stored in the second window. Based upon the comparing, it can be determined that the first tuple and the second tuple go outside of a join threshold. In response to determining that the first tuple and the second tuple go outside of a join threshold, the eviction policy of the first window can be altered.

Abstract: A fair scheduling system with methodology for fairly scheduling queries for execution by a database management system. The system obtains query jobs for execution by the database management system and cost estimates to execute the query jobs. The cost estimate can be a number of results the query is expected to return. Based on the cost estimates, the system causes the database management system to execute the query jobs as separately sub-query tasks in a round-robin fashion. By doing so, the execution latency of “low cost” query jobs that return few results is reduced when the query jobs are concurrently executed with “high cost” query jobs that return a large number of results.

Abstract: A method, system, and computer program product for transforming RDF quads to relational views. The method commences by receiving a named graph, the named graph comprising at least one RDF quad, and analyzing the named graph to produce analysis metadata. The method uses the analysis metadata to generate relational views. The method further comprises publishing a relational view in the form of a SPARQL query. The quality of the results can be quantitatively measured and reported by calculating a goodness score based at least in part on aspects of the relational view definitions. Several variants for transformation include generating relational view definitions formed using a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant. The transformations can form outputs responsive to characteristics or properties such as a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.

Abstract: In managing a relational database, a relational manager sets a foreign key lookup value to an unavailable state in a source table row containing each of a foreign key value and the foreign key lookup value in a source table in a relational database, wherein the foreign key value references a primary key value in a referenced row in a separate destination table in the relational database. The relational manager, responsive to looking up, for the foreign key value, in a data structure separate from the source table, a location of the referenced row in the relational database, when the foreign key lookup value is set to the unavailable state, updating the foreign key lookup value with the location, wherein the foreign key lookup value in the source table is looked up for identifying the location of the referenced row for subsequent retrievals of the referenced row for the foreign key value.

Abstract: Certain example embodiments described herein relate to techniques for introducing semantic concepts into complex event processing (CEP) systems and/or methods. In an event processing system, for example, an event bus is configured to receive a stream of events, each having a predefined event type. An event processing agent is configured to execute predefined queries on the events, with each query conforming to a query language, and with the query language being enhanced via a semantic extension corresponding to an ontology. An ontology management component in communication with the event processing agent stores mappings (optionally specified at design time) between concepts of the query language and concepts of the ontology that enhances the query language.

Abstract: A method includes, receiving, during a first portion of an execution of a main program including a database query program and based on a first configuration for monitoring the database query program, a parameter value representing performance of execution of the database query program. The method further includes determining that a performance condition has been satisfied based on the parameter value, and triggering execution of a second configuration for monitoring the database query program during a second portion of the execution of the main program in response to the performance condition being satisfied.

Abstract: Processing time sequence data for multiple sensors, wherein the multiple sensors are divided into multiple sensor groups and each data comprises a time stamp and a value associated with the timestamp. The method comprises: receiving time series data from each sensor; assigning the time series data received to a sensor group to which the sensor belongs; storing time series data in a first database of a first memory, such that multiple time series data assigned to the same sensor group in the multiple sensor groups are stored in at least one database record of the first database; obtaining the time series data of each sensor among the multiple sensors from the first database; storing time series data in a second database of a second memory, such that the multiple time series data from the same sensor are stored in at least one database record of the second database.

Abstract: Tuple communication and decision determination is provided in a streaming environment. A processor: generates mission tuples, places the mission tuples in a computing stream of a stream application, accesses computing time upon, obtains the computing time of the mission tuples, determines: a current position in the computing stream for the mission tuples and a class and one or more sub-classes that each of the mission tuples belongs to, and communicates data: between the mission tuples and between the mission tuples and one or more runtime processes associated with the computing stream or one or more external processes associated with the computing stream. The mission tuples are configured to modify operations of the computing operators in the computing stream.

Abstract: A translation system can translate a storage request to a physical address using fields as keys to traverse a map of nodes with node entries. A node entry can include a link to a next node or a physical address. Using a portion of the key as noted in node metadata, a node entry can be determined. When adding node entries to a node, a node utilization can exceed a threshold value. A new node can be created such that node entries are split between the original and new node. Node metadata of the parent node, new node and original node can be revised to identify which parts of the key are used to identify a node entry. When removing node entries from a node, node utilization can cross a minimum threshold value. Node entries from the node can be merged with a sibling, or the map can be rebalanced.

Abstract: The present invention provides a method and device for pushing information. The method comprises: obtaining a designated query input on a web page; matching the designated query with queries in a query candidate set including queries having a tendency of carrying an image; and when a query in the query candidate set matches the designated query, outputting a corresponding image on the web page according to the designated query.

Abstract: Embodiments are disclosed that relate to enforcement of user policies in a multi-user interactive computing environment by end user review. For example, one disclosed embodiment provides, on a computing device, a method comprising receiving a notification of a current policy controversy, and sending information regarding the current policy controversy to each end user reviewer of a plurality of end user reviewers, each end user reviewer being a member of an enforcement federation of a plurality of enforcement federations. The method further comprises receiving enforcement decisions from one or more responding end user reviewers of the plurality of end user reviewers, and if the enforcement decisions received meet an enforcement threshold, then automatically enforcing a policy rule.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a source independent query language. One of the methods includes receiving a first executable statement, the first executable statement referencing a second set of fields in a dataset, the first executable statement having instructions to cause the query processor to perform operations on data in the dataset. The method includes Generating a second executable statement based on the first set of fields and the first executable statement. The method includes determining a mapping between the first set of fields and the second set of fields. The method includes specifying a derived dataset using the corresponding values and the mapping. The method includes generating instructions to cause the query processor to perform the operations on the derived dataset. The method includes sending the second executable statement to the query processor.

Abstract: Systems and methods described herein provide for determining alternative names for a target name. A plurality of candidate alternative names is retrieved. For example, if the target name is “bush”, the candidate alternative names may include “George W. Bush”, “George H. W. Bush”, “Jeb Bush”, “Bush, Illinois (location)”, and “Bush (plant)”. A plurality of information sources associated with the target name are identified (e.g., documents, media assets or other information associated with “bush”). A first value and a second value are computed for a first candidate name (e.g., “George W. Bush”) and second candidate name (“George H. W. Bush”), respectively, based on how many of the identified information sources refer to the first and second candidate names, respectively. In response to determining that the first value exceeds the second value, the first candidate name, instead of the second candidate name, is assigned as an alternative name for the target name.

Abstract: A stored data access controller, configured to control access to data items, stored in a data storage apparatus, composed of data values encoding a labelled link between a subject graph node and an object graph node. The stored data access controller comprising: a query module, configured to receive a query requesting a specified subset of the data items and further configured to obtain the specified subset of the data items as a preliminary query result. The stored data access controller further comprising: a suppression module, configured to obtain the preliminary query result from the query module, and to generate a revised version of the preliminary query result by selectively suppressing the data value of one or more graph nodes in accordance with access control information attributed to the label of a labelled link between the subject graph node and the object graph node.

Abstract: Tuple communication and decision determination is provided in a streaming environment. A processor: generates mission tuples wrapped in a computing object or that wrap the computing object, places the mission tuples in a computing stream of a stream application, accesses computing time upon, communicates the computing time to the mission tuples one of incrementally or periodically, determines: a current position in the computing stream for the mission tuples and a class and one or more sub-classes that each of the mission tuples belongs to, and communicates information: between the mission tuples and between the mission tuples and one or more runtime processes associated with the computing stream or one or more external processes associated with the computing stream. The mission tuples are configured to modify operations of the computing operators in the computing stream.

Abstract: A product placement engine and method for automatically identifying products for association with a document, the engine including a parser, an analysis module adapted to determine word scores and to adjust the word scores of the words by predetermined weightings, a keyword constructor module adapted to construct a keyword query search string using words having the highest word scores, a search engine adapted to search a products database having product records to identify products satisfying the keyword query search string and assign product scores, and a post processing module adapted to identify word matches in each of the product records and the document and update the product score.

Abstract: Technologies pertaining to generating crowd-sourced answers are described herein. A text string is received, and the text string is parsed to determine if the text string represents an information need that is desirably answered by a collective of crowd workers. When it is determined that the information need is desirably answered by the collective of crowd workers, a query or question that represents the information need is provided to a first plurality of crowd workers, who generate proposed answers for the information need. The proposed answers are provided to a second plurality of crowd workers, who vote on the proposed answers. An answer to the information need is output based upon responses of the crowd workers.

Abstract: Presentation of transformation chain output on devices. The transformation chain includes one or more presentation nodes that drive rendering of output, such that a change in a value in the presentation node causes rendering to occur. In response to a change in value of the presentation node, the presentation system identifies characteristics or various devices that may be used to render the corresponding output. The presentation system identifies an appropriate device based on the identified characteristics of that device. The presentation system then facilitates rendering of at least a version of the output on the selected device, perhaps even transforming the output in a manner suitable for the selected device. In some embodiments, the transformation chain may be a compound transformation chain constructed by joining multiple constituent transformation chains.

Abstract: A computer system detects a request to access a first data object stored in a tiered data structure that includes internal nodes and leaf nodes. In response to detecting the request, the computer system determines whether the first data object is stored in a cache that includes a plurality of data objects from the tiered data structure that are stored separately from their corresponding leaf node in the cache. When the first data object is stored in the cache, the computer system returns the first data object from the cache and when the first data object is not stored in the cache, the computer system traverses the tiered data structure to a leaf node that includes the first data object and returns the first data object from the leaf node for the first data object in the tiered data structure.

Abstract: In various embodiments, a system for ingesting, organizing, and storing data is disclosed. The system comprises a processor and a memory unit. A document database is stored by the memory unit. The document database is configured to store data without any foreknowledge of a structure of the data. The data comprises an ontology comprising a plurality of terms describing the data within the document database. A graph database is stored by the memory unit. The graph database comprises a materialized view of the document database. The graph database provides connections between the ontology. The document database and the graph database share common entity profile UUIDs.

Abstract: Provided is a system which distributes a processing load of security measures and enforce a security policy to be applicable to a large system. Policy information indicating a security measure to be executed on user information transmitted from a client to a server is stored in a policy storing section. Measure arrangement information indicating the security measure executable in each of a plurality of policy enforcement sections is stored in a measure-arrangement storing section. One or more of the policy enforcement sections are selected on the basis of the policy information and the measure arrangement information. Each of the one or more policy enforcement sections executes the security measure on the user information and outputs, on the basis of a selection result, the user information to the other policy enforcement sections among the one or more policy enforcement sections or to the server.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for refining search results. In one aspect, a method includes presenting search results that are responsive to a search query on a search engine results page and each search result includes a snippet. The method also include receiving a refinement to the search query through the search engine results page and generating a request to update one or more of the snippets based on the refinement. The method also includes receiving one or more updated snippets in response to the request and updating one or more of the search results presented on the search engine results page using the one or more updated snippets.

Abstract: Methods, systems, an apparatus, and computer program products, for pre-caching query suggestions. In one aspect, a method includes receiving from a client device a request for a search resource; providing to the client device in response to the request the search resource, the search resource including: first instructions that cause the client device to generate a search interface that includes a first query input field; initial query suggestions; second instructions that cause the client device to: store the initial query suggestions in a suggestion store on the client device; compare query characters input in the first query input field to the query suggestions stored in the suggestion store; select query suggestions that match the query characters input in the first query input field based on the comparison; and display the selected query suggestions as query suggestions for the query characters input into the first query input field.

Abstract: Embodiments are disclosed that relate to enforcement of user policies in a multi-user interactive computing environment by end user review. For example, one disclosed embodiment provides, on a computing device, a method comprising receiving a notification of a current policy controversy, and sending information regarding the current policy controversy to each end user reviewer of a plurality of end user reviewers, each end user reviewer being a member of an enforcement federation of a plurality of enforcement federations. The method further comprises receiving enforcement decisions from one or more responding end user reviewers of the plurality of end user reviewers, and if the enforcement decisions received meet an enforcement threshold, then automatically enforcing a policy rule.

Abstract: A method of determining search engine rank for digital content. The method may include performing a search for digital content on a network using a search term to obtain search results. The method may also include obtaining search engine optimization data from the search results and analyzing the search engine optimization data to determine a position of digital content related to an entity with respect to non-category specific search results and sub-links of non-category specific search results.

Abstract: The disclosure generally describes computer-implemented methods, software, and systems for creating and using shared queries based on heterogeneous data sources. One example method includes receiving a request to execute a shared query, identifying at least one data source and a query specification associated with the shared query, generating a native query for each identified data source based on the identified query specification, executing the generated native queries at the respective data sources to collect a set of query results from the respective data sources, and formatting the set of query results from the respective data sources into a unified set of query results.

Abstract: Approximate string matching of a target string to a trie data structure in which the trie data structure has a root node and generations of child nodes, each node representing at least one character in an alphabet to provide a lexicon of words and word fragments. Traversing the trie data structure includes starting from the root node by comparing each node of a branch of the trie data structure to characters in the target string and adding characters traversed in a branch of the trie data structure to a gathered string to provide suggestions of approximate matches. If a node is reached that is flagged as a node for a word or a word fragment and, and if the target string is longer than the gathered string, the method loops back to the root node, and continues the traverse from the root node.

Abstract: Described herein are systems and methods for providing context-sensitive data security, for business application performance optimization. In accordance with an embodiment, the system can be used together with a Role Based Access Control model. Data security predicates can be made context-sensitive, by taking into account the context in which an end-user is navigating an application. By providing context-sensitive data security in this manner, the complexity of database queries can be reduced, and the underlying relational database management system can create better-optimized execution plans.