Abstract: Architecture and its implementation of an event-based media management system and method are disclosed. A generic model for events is used for developing architecture for media management, called Eventcentric Media Management (EMMa) system. The system focuses on event experiences and provides flexible functionality for media management. The system and method analyze cross-media files for features to extract atomic events and apply algorithms to cluster files including similar or related features. Thus, the EMMa system allows unified media indexing of multiple media types, better abstraction of the real world, use of context, media processing operations to compute and store features and tags, and a more intuitive support for multiple users. It provides environments for querying and browsing media related to events and authoring of multimedia presentations for sharing with other individuals.

Abstract: A method and system for determining interest levels of online content based on rates of change of content access traffic. According to one embodiment, a method may include detecting content request traffic directed to a content source, determining a time rate of change of said content request traffic, and determining an indication of content interest associated with the content source, where the indication is dependent upon the time rate of change of the content request traffic. The method may further include storing the indication of content interest on a computer-accessible medium.

Abstract: A computer-implemented method for generating online search results includes receiving, over the Internet, referring URL data including a query, and a network site ID for a network site that was visited based on third party search engine analysis of the query; generating indexed query and network site data based on the received referring URL data and network site; receiving a new query from a user; determining a network site relevant to the new query based on the indexed query and network site data; and displaying to the user a link to the network site. Systems for generating online search results are also disclosed.

Abstract: Techniques for accessing a parallel database system via an external program using vertical and/or horizontal partitioning are provided. An external program to a database management system (DBMS) configures external mappers to process a specific portion of query results on specific access module processors of the DBMS that are to house query results. The query is submitted by the external program to the DBMS and the DBMS is directed to organize the query results in a vertical or horizontal manner. Each external mapper accesses its portion of the query results for processing in parallel on its designated AMP or set of AMPS to process the query results.

Abstract: A technique for factoring uncertainty into cost-based query optimization includes: determining the degree of uncertainty involved in the cost estimates for the query, determining the degree of sensitivity the query has to that uncertainty, and determining if there is an access path that performs well across the range of possible conditions that could occur at execution time, reducing the risk of performance spikes and performance volatility. If such an access path exists, select that access path; if not, perform parametric query optimization or query re-optimization.

Abstract: Methods, techniques, and systems for using natural language processing to recommend related content to an associated text segment or document. Example embodiments provide a NLP-based content recommender (“NCR”) which uses NLP-based search techniques, potentially in conjunction with context or other related information, to locate and provide content related to entities that are recognized in the associated material. NCRs may be embedded as widgets, for example on Web pages to assist users in their perusal and search for information, provided by means of browser plug-ins or other application plug-ins, provided in libraries or in standalone environments, or otherwise integrated into other code, programs, or devices. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: Data query in a share-nothing database includes obtaining a query request and generating an optimized access plan with respect to the query request. The query request relates to external data stored in an external data source and contains a definition for expected distribution of the external data. The data query also includes obtaining data distribution information related to the expected distribution based on the optimized access plan, transmitting the data distribution information to the external data source so that the external data source splits and returns the external data in accordance with the data distribution information, and executing query-related processing of the split external data in accordance with the optimized access plan.

Abstract: Methods, systems, and apparatus, including computer program products, for translation of markup language documents with display replacement. In some implementations, a method includes displaying a markup language document in an original language by rendering an internal representation of the document, sending a data structure containing the texts from the text nodes of the internal representation, as distinct data entities, to a translation service, replacing the texts with translated texts received from the translation service resulting in a translated representation, and displaying a first translation of the document by rendering the translated representation. In some implementations, partial, incremental translation is performed. In some implementations, a method includes receiving a notification that a phrase in a markup language document has been selected, requesting translation of the text of the selected phrase, and then displaying a received translation in a user interface.

Abstract: A method for performing an invitation triggered search by a query engine, involving receiving an invitation message associated with a project, wherein the query engine is a recipient of the invitation message, extracting at least one attribute from the invitation message, searching a plurality of sources to identify a plurality of resources associated with the at least one attribute, and sending a reply message including a display of the plurality of resources associated with the at least one attribute to a sender of the invitation message.

Abstract: A protocol circuit layer is described. The protocol circuit layer may employ a routing layer to determine optimal routes when establishing a circuit. The circuit layer may employ a link layer to send data packets over links to other network nodes. A naming layer may employ circuits to establish a distributed database of associations between network node addresses and their network locations.

Abstract: A generic Internet based system for viewing supply chain data is provided. The system includes an Internet based data viewing engine and a data store that holds both viewable data and metadata associated with the viewable data. The metadata can be employed by the Internet based data viewing engine to control the presentation of the viewable data. The generic Internet based supply chain data viewing engine may be employed in a virtual private supply chain (VPSC). A VPSC includes a data acceptor that can receive supply chain data items from supply chain members, a supply chain data store that can store transformed, validated supply chain data items received from the supply chain members and a data accessor operable to selectively present supply chain data items stored in the supply chain data store to viewing supply chain members. One example of the data accessor is the generic Internet based viewing engine.

Abstract: Systems and methods are provided for transmitting data for secure storage. For each of two or more data sets, a plurality of shares are generated containing a distribution of data from an encrypted version of the data set. The shares are then stored in a shared memory device, wherein a data set may be reconstructed from a threshold number of the associated plurality of shares using an associated key. Also provided are systems and methods for providing access to secured data. A plurality of shares containing a distribution of data from an encrypted version of a data set are stored in a memory device. A client is provided with a virtual machine that indicates the plurality of shares, and the capability to reconstruct the data set from the plurality of shares using an associated key.

Abstract: A data structure for storing items of information having a time of life includes a time of life interval for each item of information, and methods for using the same. The items of information are organized in a data structure having nodes and edges connecting the nodes. This data structure is preferably a directed acyclic graph structure. The data structure includes parent nodes and child nodes. The time of life interval specified for any child node generally is contained within the time interval specified for that child node's parent node, such that the data structure includes no child nodes with a time of life interval that falls outside of the time of life interval of its parent node.

Abstract: In one embodiment, a computer implemented method is illustrated as including receiving selection data generated by a media player application, the selection data being related to digital content. Additionally, generating an instruction set that includes the selection data, the instruction set being formatted based upon a Uniform Resource Identifier (URI) schema. Inserting the instruction set into a query portion of a URI. A method is also illustrated as including receiving a URI associated with digital content, the URI containing an instruction set in a query portion of the URI. Parsing the instruction set to retrieve selection data relating to the digital content. Further, the method may include retrieving the digital content based upon the selection data. Moreover, the method may include generating a data stream including the digital content. Additionally, the method may include transmitting the data stream including the digital content.

Abstract: A method for restoring an object comprises receiving a request to restore an object. Also, the method includes outputting a representation of available backup files and receiving a selection of at least one of the available backup files. Further, the method comprises restoring at least one of the selected backup files into a temporary location and mounting at least one of the restored backup files as a server. In addition, the method includes outputting a representation of available objects from the server and receiving a selection of at least one of the available objects to be restored from the server. Also, the method includes copying one or more selected objects from the server into an Active Directory.

Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: In one aspect, a method related to receiving, retrieving and presenting information. In addition, other method, system, and program product aspects are described in the claims, drawings, and/or text forming a part of the present disclosure.

Abstract: Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes.

Abstract: Computer program products and methods for query collection optimization and executing a query collection against one or more electronic documents are disclosed. According to one embodiment, a method of executing a query collection having a plurality of full term queries against an electronic document includes receiving the query collection, determining common terms, and searching the electronic document for the common terms in accordance with a frequency that the common terms appear in the query collection. The method further includes, for each common term found in the electronic document, searching the electronic document for full term queries that include the common term that was found in the electronic document. The method further includes, for each common term not found in the electronic document, preventing a search of the electronic document for the full term queries that include the common term that was not found in the electronic document.

Abstract: Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.

Abstract: A computer-readable storage medium storing an update program that causes a computer to execute a process includes: acquiring an automaton performing matching of data in an input stream hierarchized by tags to a keyword in a query, the automaton in which an initial state, a start state indicating a start tag symbol, an end state indicating an end tag symbol, a transition between the initial state and the start state, a transition between the initial state and the end state, and a transition from the initial state to the initial state are defined; generating a path identifying the position of a start tag based on a hierarchy in the input stream when the start tag is read from the input stream; judging whether or not the generated path meets a condition corresponding to the keyword in the query; generating, when the generated path is judged to meet a condition.

Abstract: Techniques are disclosed for invalidating, at one or more processing elements, data streams containing data tuples. A plurality of tuples is received via a data stream, whereupon the data stream is determined to be invalid based on at least one tuple in the plurality of tuples. The data stream is then invalidated, and a message is issued that causes one or more data streams included in the stream-based computing system and related to the invalidated data stream to also be invalidated.

Abstract: A plan combining unit combines a plan including all predicate nodes by increasing a size of a subplan stepwise while selecting the subplan with a low cost using an analysis graph generated by a query analyzing unit and plan combination constraint data extracted by a constraint extracting unit. The analysis graph is the one expressed by a graph including a variable node corresponding to a variable to which an object on a database is bound and a predicate node indicating a condition between the variable nodes. The plan combination constraint data represents a constraint to a plan and a subplan extracted from the analysis graph as a condition between the nodes.

Abstract: Systems and processes for data presentation may be implemented with a variety of operations and techniques. In particular aspects, a system and process for data presentation may include the ability to receive a data request at a data distribution device and determine data responsive to the data request, the responsive data including textual data. The system and process may also include the ability to modify the textual responsive data based on a user interface for visually presenting the textual responsive data and generate a data response including the modified textual responsive data.

Abstract: A system, method, and non-transitory computer readable medium are provided to access a graph comprising a plurality of nodes and at least one edge. Each node is associated with at least one database operation. Computer code is constructed that corresponds to the graph in accordance with a nesting level. The nesting level represents a degree of temporary storage to be allocated for intermediate output produced by the at least one database operation.

Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.

Abstract: An adaptive query execution plan enhancement is provided by: selecting a sample of literal sets from an execution history of a query statement; determining a plurality of access paths by applying each literal set in the sample to the query statement; for each given access path of the plurality of access paths, determining a total execution cost by applying each literal set in the sample to the given access path; and selecting a preferred access path from the plurality of access paths based on the total execution costs for each given access path. A plurality of preferred access paths for a plurality of query statements in an application workload is collected and may be presented as a query execution plan enhancement recommendation to users.

Abstract: Methods and apparatus for optimizing an abstract query are disclosed. Embodiments of the present invention allow an abstract database to optimize an abstract query composed from a set of logical fields. Each logical field includes a field name and an access method used to map the logical field to an underlying physical representation of the data. After a user composes an abstract query and submits it for execution, a runtime component and optimization component may be configured to resolve the abstract query to a physical query of the underlying physical data source using an access method associated with each logical field. In addition, as the runtime component builds a query consistent with the schema of the underlying database, an optimizing component may modify the query using any suitable optimization techniques.

Abstract: A method, system and computer program product for identifying reference data tables in an Extract-Transform-Load (ETL) process, by identifying, by operation of one or more computer processors, at least a first reference data operator in the process, wherein the first reference data operator references one or more tables and evaluating at least a first table referenced by the reference data operator to determine whether the first table is a reference data table by assigning a score to the first table, wherein the score is indicative of the likelihood that the first table is a reference data table and wherein a reference data table contains a set of values that describes other data.

Abstract: Systems and methods for generating dynamic communication contracts in a multi-tenant database system based on the datamodel of the user using the service. The communication contract contains objects, e.g., SOAP-objects, custom to the specific user's datamodel, including standard objects customized to the user's own security model and business purpose as well as entirely unique custom objects that are created by the user and available to only the user's organization. A database server queries the database for all objects available to that user (standard and custom), and all the fields on all those objects that are available to that user. The server iterates over the set of objects and each of their sets of fields and generates a contract that is specifically tailored to the user's own datamodel and field level security. The unique contract can be used to communicate with the server to access information in the user's own schema.

Abstract: Various embodiments of systems and methods for database consistent sample data extraction are described herein. The technique uses production data as input and outputs sample data in the same relational schema while preserving the integrity of joins of the different tables in the schema. For a given relational schema, the master tables are found. Then a subset is created by placing selection criteria in a query defining how to sample the data for these master tables. Following the joins, the dependent tables are added to the query automatically.

Abstract: A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.

Abstract: A document preprocessor preprocess a document to enhance the statistical features of the document. The system preprocesses the document by matching a prefix and a trailing context in the document with one or more matching prefixes in a transformation database, where the prefix is a first string of one or more tokens in the first document and the trailing context is a second string of one or more tokens in the first document that trail the prefix. Alternatively, the system preprocesses the document by computing cyclic permutations of the document, sorting these permutations and taking the last token from each of the sorted permutations.

Abstract: According to an embodiment, there is provided a method of generating a data structure stored in computer memory for processing a search query in a network of interconnected nodes, wherein the method comprises selecting landmark nodes by the following steps and storing the selected landmark nodes in the data structure: sampling from the network nodes a first sample of vertex pairs, computing the shortest path for each vertex pair, each shortest path comprising a set of vertices between each vertex in the vertex pair; identifying a first landmark node which occurs in more of the shortest paths more often than any other vertex; removing from the network vertices shortest paths including the first landmark node and identifying a second landmark node which occurs in more of the remaining shortest paths than any other remaining vertex.

Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.

Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.

Abstract: System and methods for directing a federated search using a location description file to locate a data source are provided. For a federated search, a location description may be used to describe the location of each data source searched, and may further be used to connect the user to that particular data source. The format of such a location description file may include several elements, some of which provide information on how to display the file (e.g., name, description, author, icon link, etc.) and other elements (e.g., simple location, location type, etc.) are used to connect the user to the location of the data source.

Abstract: A system and/or method are implemented to process queries to a database. In particular, the processing of queries to the database is enhanced by enhancing the determination of join orders of tables implicated in queries. Join orders between relatively large numbers of tables are determined by dividing the set of tables to be ordered into a plurality of subsets of tables, and ordering the individual subsets of tables.

Abstract: A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point.

Abstract: Disclosed herein are systems, methods, and computer readable-media for dynamically managing data-centric searches. The method includes receiving information associated with an event related to domain-specific searches to a database, identifying data at a first memory location in the database, the data being data identified in response to the domain-specific searches, duplicating the data at least once to at least one new memory location, and distributing processing more domain-specific searches amongst the at least one of the new memory location and the first memory location. The system can distribute the processing for more or additional domain-specific searches randomly, serially or using any other approach.

Abstract: A database query optimizer optimizes a query that uses multiple networks. The query optimizer optimizes a query to reduce network traffic on a network or node that is overloaded or above an established parameter in a node/network attribute table. The query optimization to reduce network traffic may result in a sub-optimal query in other respects such as execution time. The result is a query optimizer that rewrites or optimizes a query to execute on multiple nodes or networks to reduce traffic on a network or node according to the loading characteristics and assigned attributes of a node or network.

Abstract: A search apparatus includes a graph memory, a root node specification receiving unit, and a search unit. The graph memory stores data of a graph having nodes representing data elements and a link representing a relationship between the data elements. The root node specification receiving unit receives a root node specified from among the nodes in the graph. The search unit searches for an adjacent node which is connected to a target node via a link and which satisfies a search condition that at least one of the target node and the adjacent node has a predetermined attribute. The search unit searches for an adjacent node using the root node as the target node. The search unit iteratively performs a process of searching for an adjacent node using a previously determined adjacent node as the target node for a subsequent iteration to obtain a concatenation of adjacent nodes.

Abstract: A unified user interface is described that allows a user to search, browse, and launch items from the same user interface. For example, a single text input box may be provided that allows the user to perform all these functions by typing in a portion of an item name or an entire item name. The various functions may be selectively performed depending upon the text inputted by the user into the text input box. For example, where the text appears to be the beginning of an item name, then those items matching the input text will dynamically appear as the user types. Or, where the text appears to be the beginning of a file path, then items in that file path may be presented. In addition, advanced items such as system files may be suppressed so that inexperienced users do not accidentally stumble across these items.

Abstract: System(s), method(s), and/or technique(s) (“tools”) are described that enable a user to open a network-enabled electronic document in either a specific software application associated with the electronic document or a network browser. In some cases the tools do so using a single link. On selection of the link, if the user's computing device has access to the specific software application, the tools may load the electronic document using that application. Or, if the user's computing device does not have access to the specific software application, the tools may render the electronic document with a network browser. In so doing, the tools may make the document available to a larger set of potential users through their browsers, allow users the convenience of accessing the document within a browser, optimize users' experience in working with the document through a specific software application, or provide a simpler opening procedure.

Abstract: A method for storing intermediate result sets in a database is provided. An access plan for a single query for accessing data stored in the database system is received. An intermediate result set is generated during execution of the access plan. A value of an intermediate result set rating of the intermediate result set is determined during execution of the access plan at runtime of the query for determining if the intermediate result set, generated during the execution of the access plan, is to be stored. Based on determining that the value of the intermediate result set rating meets a predefined criterion, the determined intermediate result set is stored for a longer period of time than the runtime of the query as a stored intermediate result set.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.

Abstract: A computer program product and method for estimating a filter factor for access path optimization in a database are provided. The method includes extracting from a statement segment for database query a relation condition which defines the relationship between a variable and a first table. The method includes obtaining first statistics information according to the relation condition and the statistics information of the first table. The method includes extracting from the statement segment a filter condition which defines the relationship between the variable and a second table. The method includes obtaining second statistics information according to the filter condition and the statistics information of the second table, and according to the first statistics information and the second statistics information, estimating the filter factor of the filter condition.

Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.

Abstract: A batched shortest path problem, such as a one-to-many problem, is solved on a graph by using a preprocessing phase, a target selection phase, and then, in a query phase, computing the distances from a given source in the graph with a linear sweep over all the vertices. Contraction hierarchies may be used in the preprocessing phase and in the query phase. Optimizations may include reordering the vertices in advance to exploit locality and using parallelism.