Abstract: A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.

Abstract: Methods, devices and systems are described for implementing a method for positioning a non-constrained amount of data in semblance of a tree. The method includes receiving genealogical data including nodes and generating a directed graph of the nodes of the genealogical data. The directed graph is to maintain parent-child relationships among the nodes and to maintain generations. The genealogical data includes a root node. The method includes moving the nodes along the horizontal axis such that each node is in an equal spacing with respect to each node's parent node, determining a number of generations in the genealogical chart, and generating a number of quadratic curves equal to the number of generations. The apex of the quadratic curves is the position of the tree's trunk. The method includes dropping the nodes in the Y-axis along the curve of the quadratic curves. Each generation is in line with the quadratic curve.

Abstract: In one embodiment, a method includes maintaining a data store of nodes and edges and for each of one or more users: scanning items of content associated with the corresponding user node; identifying a candidate item of content; searching for matches between the candidate item of content and existing nodes; determining whether or not a match between the candidate item of content and an existing node exists; and when it is determined that at least one match exists, generating an edge from the user node to the existing node for which the best match is determined; and when it is determined that no match exists, generating a new node based on the candidate item of content, and generating an edge from the user node to the new node.

Abstract: An apparatus, and corresponding method, for generating a graph used in performing a search for a match of at least one expression in an input stream is presented. The graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc of a current node represents a character match in an expression of a character associated with the current node. Arcs which are not valid may be pruned. Non-valid arcs may include arcs which point back to a designated node(s), or arcs that point to the same next node as the designated node(s) for the same character. Typically, the majority of arcs associated with a node are non-valid. Therefore, pruning the non-valid arcs may greatly reduce graph storage requirements.

Abstract: An extensible identification system for nodes in a hierarchy is described wherein each node is assigned a concatenation of decimal based values. The values assigned uniquely identify the node, provides an order for the node, and identifies its parent, child, and sibling relationships with other nodes Furthermore, the IDs assigned can be encoded to be byte comparable. Furthermore, the ID's assigned to nodes need not be modified when changes (adding/deleting a child node or a subtree of nodes) are made in the hierarchy. Additionally, in the event of such a change, the order and relationships between the parent, child, and sibling nodes are retained.

Abstract: In one embodiment, a method includes maintaining access to information comprising nodes and edges; receiving a request from a first user corresponding to a first user node for a structured document corresponding to a first concept node; determining a first data set that identifies concept nodes connected by edges with user nodes that are each connected by edges with both the first user node and the first concept node; determining a second data set that identifies concept nodes connected by edges with the first concept node and user nodes that are each connected to the first user node; generating a score for each concept node in the data sets; selecting one or more concept nodes based on their scores as recommended nodes; and transmitting to the client device the structured document and code executable by a client application to render node names or identifiers of the recommended nodes for display.

Abstract: Data stream query mediation may utilize a query handler configured to receive a query from a stream application to be applied against a stream of data including multiple tuples representing events. A stream window manager may be configured to express the query in a specification which defines a window including a subset of the tuples, the specification defining content of the window as a range of the tuples having a range attribute over which the content is specified, defining when to update the window using a synchronization attribute specifying a movement of the window over time with respect to the content, and defining an evaluation of the content of the window using an evaluation attribute specifying when to perform the evaluation. A query translator may be configured to translate the query including mapping the range attribute, the synchronization attribute, and the evaluation attribute to a stream processing language of a data stream management system (DSMS), to thereby obtain a translated query.

Abstract: A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure.

Abstract: An index data structure comprises a plurality of index keys for uniquely identifying potential data object context nodes. Each index key is, in turn, associated with one or more potential context nodes. Moreover, the index key has a label that provides semantic content to a user. The index data structure further comprises one or more routing tables associated with each index key that generally include a plurality of path references.

Abstract: There is provided a computer-implemented method for user query reformulation. A graph is created to represent a relationship between previous user query terms. The graph may represent the previous user searches in n-grams that correspond to nodes. A random walk analysis is performed to determine probabilities that various n-grams corresponding to nodes of the graph could be used to effectively alter a user search term. The probabilities represent a quantification of relationships between nodes of the graph. A determination may be made regarding whether to reformulate the user query based on a relationship between a user search term in the user query and a graphed search term represented by a node of the graph. The determination takes into account a relationship between the user search term and the graphed search term.

Abstract: A computer-implemented method for managing updates for a node in a graph is described. An update relating to a node is received. The update is written to a graph database file system. A node update message is broadcast to at least one graph server when the update includes a change to a characteristic of the node.

Abstract: A method for mapping relationships in a database results in a cluster graph. A representative sample of records in each of a plurality of tables in the database is analyzed for nearest neighbor join edges instantiated by the record. Records with corresponding nearest neighbor join edges are grouped into clusters. Cluster pairs which share a join relationship between two tables are identified. A weighting may be applied to cluster pairs based on the number of records for the cluster pair. Meaningful cluster pairs above a weighted threshold may be ordered according to table and displayed as a cluster graph. Analyses of the cluster graph may reveal important characteristics of the database.

Abstract: Methods and systems for implementing a splitter operation in an extract, transform, and load (ETL) process are provided. In one implementation, the method includes receiving a data flow including a splitter operation, and generating an execution plan graph based on the data flow. The execution plan graph includes structured query language (SQL) code for implementing the splitter operation, in which the structured query language (SQL) code is respectively executable among database servers associated with different vendors.

Abstract: This present invention describes an innovative solution in the area of indexing and searching binary files including various binary files such as multimedia files, including image files, mp3 files and other audio/video files from the public Internet. The invention introduces a way to index binary files such as multimedia files according to their content signatures, which uniquely identify themselves, and search for related files by walking through a graph database constructed during the index phase. The present invention can be used in a search engine and a download engine, as well as with text based index and search technologies. As a result, such extended usage will broaden a multimedia file's context and increase relevant accuracy of the keywords describing the context.

Abstract: A system for information item categorization in which each non-leaf node in a hierarchical organization of nodes represents a category, and each leaf node represents an information item. A number P is associated with each node. For non-leaf nodes, the associated number P is selected from a subset of relatively prime elements chosen from an appropriate Unique Factorization Domain (UFD), such as a set of relatively prime numbers which are a subset of the familiar set of integers. For leaf nodes, P is set to 1. A number M is also associated with each node. For each root node, M is set to the value of P for that node. For each non-root node, M is set to the product of the M's of all parent nodes of the node and the P of that node.

Abstract: Systems and associated methods for automated and semi-automated building of domain models for documents are described. Embodiments provide an approach to discover an information model by mining documentation about a particular domain captured in the documents. Embodiments classify the documents into one or more types corresponding to concepts using indicative words, identify candidate model elements (concepts) for document types, identify relationships both within and across document types, and consolidate and learn a global model for the domain.

Abstract: Systems and methods for automatically processing a textual document by identifying occurrences of a piece of text having a predetermined format in the textual document; determining a depth-of-treatment value for each piece of formatted text in the textual document, the depth-of-treatment value indicating a depth of treatment in the textual document afforded to the particular piece of formatted text; associating an abstract with each piece of formatted text in the textual document; and generating a data record containing each identified piece of formatted text from the textual document, the depth-of-treatment value and the abstract associated with each piece of formatted text in the textual document.

Abstract: A method, an apparatus, and computer instructions are provided for a context based cache infrastructure to enable subset query over a cached object. Responsive to detecting a query to a root context of a context tree, the tree is traversed for a parent context of a subcontext corresponding to the name and value pair, which is identified by a user in the query. If the parent context caches all query results, the query results are iterated and the remaining name and value pairs are filtered out. However, if the parent context does not cache all query results, the traversing step is repeated for next parent context of the subcontext until a root context is encountered. If a root context is encountered, a query is issued to the database for the name and value pair and the result of the database query is cached in a new context.

Abstract: A method, system and article of manufacture for processing queries and, more particularly, for graphically representing relationships between different queries. One embodiment provides a method for graphically representing a relationship between a first and a second query. The method includes selecting, from the first and second queries, elements to be compared. On the basis of the selected elements, a degree of similarity between the first and second queries is calculated. The method further includes displaying a first query object representative of the first query and a second query object representative of the second query in a user interface. The first and second query objects are positionally arranged on the basis of the calculated degree of similarity. The positional arrangement reflects the relationship between the first and second queries.

Abstract: Systems and methods for use in representing a path in a graph of nodes. A computing device determines an acyclical collection of primary edges that collectively reach all nodes within the graph, and also determines one or more secondary edges (e.g., edges other than the primary edges) between nodes of the graph. The computing device further determines a path between a first node of the graph and a second node of the graph. The path includes one or more of the primary edges and one or more of the secondary edges. The computing device represents the path as an abbreviated path including the first node, the second node, and the secondary edges in the path. The abbreviated path excludes one or more of the primary edges in the path.

Abstract: A system graphically plots articles. The system executes one or more search queries to search stored articles and receives results of the executed one or more search queries, where the results identify selected articles of the stored articles. The system further designates a graphical marker for each of the selected articles and plots each of the graphical markers on a graphical display.

Abstract: A method, computer program product, and a data processing system that facilitates navigation through a directed graph for selection of sub-processes of a modified business process derived from a business process is provided. A bounding box is used for evaluating and selecting sequences of nodes representative of business sub-processes or services. The bounding box has a predefined depth for limiting the scope of the evaluation. The bounding box is shifted during the evaluation as sequences of nodes are selected. Additionally, state data is maintained such that a sense response model may be employed to detect and account for changes to the environment in previously evaluated services. By maintaining state data, a transition to a previously evaluated sub-process may be implemented to account for significant changes in the environment.

Abstract: The subject matter of this specification can be embodied in, among other things, a method that includes determining, for a portion of users of a social network, label values each comprising an inferred interest level of a user in a subject indicated by a label, associating a first user with one or more second users based on one or more relationships specified by the first user, and outputting a first label value for the first user based on one or more second label values of the one or more second users.

Abstract: An information management system creates data structures based entirely on the content of source files, then compares these data structures to discover synergies and commonalities. In one embodiment, the system accepts a first collection of source files, and extracts text from each source file. The text is compared to tags in one or more dictionaries, which comprise hierarchical listing of tags. Tags matching the text are associated with each source file. The system then generates a virtual relational network in which each source file having matching tags is a node. Tags associated with two or more source files are links between the nodes. This virtual relational network may be compared with another virtual relational network to discover common nodes or links. Source files later added to a collection are massively linked by associating all tags from all source files with the newly added source file, and vice versa.

Abstract: Systems, methods, and other embodiments associated with visualizing data using summary graphs are described. One example method includes constructing a summary graph for display. The summary graph represents the data as a summary node having a plurality of property edges connected to the summary node. The summary node represents the set of values for the node in the data.

Abstract: A method and system to derive association-explicit metadata, about a target data collection, that is useful to facilitate access and searching of the data collection, regardless of the organizational structure of the collection. The metadata may be generated to comprise DetailSelectors describing lowest level data elements; groups thereof that provide context for member DetailSelectors, plus Boolean properties for queries using such Selectors, and association links to higher-level GlueSelectors that comprise such DetailSelectors, as well as association links to yet higher levels, eventually to Items, which are of a level greater than the highest level GlueSelector, reference a predetermined collection of data in the target collection, and comprise suitable matches for all of the DetailSelectors represented. Such metadata may be used to present choices to a user for terms to add to a query while ensuring suitable match by information in at least one Item.

Abstract: Information values are created by nodes and directed edges describing dependencies between two nodes or information values, respectively, in the form of a directed graph for a database query. By using a path distance describing a number of directed edges between a selected node and a target tuple, formed of two nodes connected to a directed edge and a associated directed edge, a reduction of a complexity of a database query and thus an acceleration of the database query can be achieved. The search method can be used, for example, for monitoring systems or in medical databases. Furthermore, the search method can be used for databases which are dynamically extended, for example by new events in the monitoring system.

Abstract: A database processing apparatus generates a first processing instruction for acquiring an element included in the processing-target structured document, a second processing instruction for performing a natural join by using result data including the acquired element, a third processing instruction for performing a cross join by using the result data, and a fourth processing instruction for updating a correspondence relation between a result of the execution of the natural join and a result of the execution of the cross join by using these result of executions, and joins these processing instructions to generate the process plan. At this time, the database processing apparatus converts the first processing instruction into a fifth processing instruction for transmitting an acquisition request for the element to the database servers, and receiving the result data including the acquired element from the plural database servers.

Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets.

Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets.

Abstract: A system, method and computer-readable medium provide for assigning sampling methods to each input stream for arbitrary query sets in a data stream management system. The method embodiment comprises splitting all query nodes in a query directed acyclic graph (DAG) having multiple parent nodes into sets of independent nodes having a single parent, computing a grouping set for every node in each set of independent nodes, reconciling each parent node with each child node in each set of independent node, reconciling between multiple child nodes that share a parent node and generating a final grouping set for at least one node describing how to sample an input stream for that node.

Abstract: A data structure for representing information as a binary directional graph comprising a set of points connected by three distinct types of directed edges. Each point must have a unique left (parenting) edge and a unique right (parenting) edge with end points, and an identity edge that can be null (i.e. have no end point). All connected paths of edges upwards eventually converge at a maximal point in the structure. The points are uniformly assigned a fixed set of data as their content. Rules are defined to construct the structure and allow representation of information, with methods described for translating conventional forms of representation, such as tables, properties, classes, relations, and functions. The structure can be represented as a single relation (i.e. a single table with a fixed structure) and can be implemented using a conventional relational database.

Abstract: A computer implemented method of storing, manipulating, assessing, and displaying data and its relationships, and a computer system (with memory) programmed to implement such method. The data is stored into nodes, and visualized as a sea of linked nodes.

Abstract: A method for service creation based on graph mapping including constructing a graph having leaf nodes in an environment including business support nodes associated with respective services and operations support nodes including attribute models, identifying a plurality of services at a level of the leafs in the graph, extending the graph by representing existing services offerings in terms of operation level service definitions and new services at the level of the leafs, and re-combining leaf nodes to define new services at service creation time.

Abstract: A method of constructing a plurality of downloadable files from an application file and a plurality of transcripts. The application file stores data blocks and implements an application. Each of the transcripts stores at least one order in which at least a portion of the data blocks of the application file were accessed by the application when executed previously. The transcripts are combined into a combined transcript storing at least one combined order comprising a combined portion of the data blocks. The data blocks of the combined portion are arranged in a data structure having an origin. A first set of data blocks within a predetermined distance from the origin is stored in at least one initial execution file. A second set of data blocks outside the predetermined distance from the origin is stored in downloadable sequence files.

Abstract: A method, system, computer program product and computer readable media for matching using degree distribution information are disclosed. An embodiment of the method can include performing b-matching on a graph data structure expanded using degree distribution information in order to identify neighbors of a selected input node. The b-matching can be performed using belief propagation. The belief propagation method is adapted to use a compressed message update rule and to be suitable for use with distributed processing systems. An embodiment can also include enhancing a matching result by applying degree distribution information to a first matching result to generate a second matching result. Embodiments for online advertisement/search term matching, product recommendation, dating service and social network matching, auction buyer/seller matching and resource allocation, among other, are disclosed.

Abstract: An information-processing apparatus includes: a link information-generating portion that reads two or more pieces of operation information having a user identifier and an object identifier for identifying an object on which a user has performed an operation, detects two or more object identifiers linked via a user identifier contained in the two or more pieces of operation information, and generates link information indicating a link relationship between two or more objects; an object identifier-accepting portion that accepts one object identifier; an in-group object identifier-acquiring portion that acquires an object identifier having at least a predetermined level of relevance with the one object identifier accepted by the object identifier-accepting portion, using the generated link information; and an in-group object information output portion that outputs object information, which is information related to an object identified with the object identifier acquired by the in-group object identifier-acquiri

Abstract: An educational institution (also referred as a university) is rich with multiple kinds of data: students, faculty members, departments, divisions, and at university level. Relating and correlating this data at and across various levels help in obtaining a perspective about the educational institution. A structural representation captures the essence of all of the relationships in a unified manner and an important aspect of the relationship is the so-called “influence factor.” This factor indicates influencing effect of an entity over another entity, wherein the entities are a part of the structural representation. A system and method for the construction of such a structural representation of an educational institution based on the educational institution specific information is discussed.

Abstract: Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query.

Abstract: An embodiment of the invention comprises, providing an initial object graph to a database, the initial object graph being generated by applying a set of rules to resources included in a resource set at a specified time, or by revising a previous object graph at the previous time, the resource set at the specified time comprising an initial resource set. The method includes providing the initial object graph to a working memory, maintained in separation from the database; discovering a changed fact associated with one of the resources of the initial resource set; and upon discovering the changed fact, determining modifications required by the changed fact to the initial object graph. If modifications are required, the initial object graph is revised in the working memory to include such modifications. The same revisions are then made to the initial object graph in the system database.

Abstract: A method, system and medium for recording events in a system management environment is described. As system events are detected in an enterprise computing environment they are stored in a manner allowing them to be “replayed” either forward or reverse to assist a system administrator or other user to determine the chain of events that affected the enterprise. The system engineer and business process owner are therefore presented with pertinent information for monitoring, administrating and diagnosing system activities and their correlation to business services.

Abstract: A graph traversal system is described herein that efficiently identifies strongly connected components with entries, exits, and corresponding edges at the same time. Entry and exit nodes can be recognized by scanning every node after the strongly connected components have been identified, but revisiting these nodes incurs undesirable overhead. The graph traversal system identifies entries and exits during a single pass while the strongly connected components are being identified. In addition, the system modifies the semantics for some applications so that a single node all alone is not considered to be a strongly connected component. Thus, the graph traversal system allows efficient identification of entries to and exits from strongly connected components in a manner that can be applied to a variety of computer software problems that use directed graphs for data structures.

Abstract: A data management and archive method and apparatus, such as for implementation in an automated system to monitor and manage status, performance and configuration data for a plurality of networked storage components. Analysis and cross-correlation of data related to the plurality of storage components can be done individually, collectively and/or comparatively. A collection manager component of a workload analyzer is implemented to start and stop data collection in the context of a system comprising at least one storage component (or at least two networked storage components). The collection manager includes a command and control module that coordinates requests of data from at least one collection agent configured on at least one host connected to the storage component(s). The collection manager manages collection of data and effects file transfer of collected data according to a user specified policy, and maintains status of the data collected.

Abstract: Decision trees are efficiently represented in a relational database. A computer-implemented method of representing a decision tree model in relational form comprises providing a directed acyclic graph comprising a plurality of nodes and a plurality of links, each link connecting a plurality of nodes, encoding a tree structure by including in each node a parent-child relationship of the node with other nodes, encoding in each node information relating to a split represented by the node, the split information including a splitting predictor and a split value, and encoding in each node a target histogram.

Abstract: The present invention automatically builds a contracted dictionary from a given list of multi-word proper names and performs fuzzy searches in the contracted dictionary. The contracted dictionary of proper names includes two linked trie-based dictionaries: a first dictionary is used to store single word names, each word name having an ID number; and a second dictionary is used to store multi-word names encoded with ID numbers. Information related to the multi-word names is also stored as a gloss to the terminal node of the multi-word entry of the trie-based dictionary. An approximate lookup for a multi-word name is conducted first for each word of the multi-word name using an approximate matching technique such as a phonetic proximity or a simple edit distance. Accordingly, N suggestions is determined for each word of the multi-word name under consideration. Then, multi-word candidates are assembled in ID notation.

Abstract: There is provided a method and system to communicate information. The system receives a first query that contains at least one constraint and retrieves a first plurality of data items from a database based on the first query. Next the system generating a first distribution based on the first plurality of data items, the first distribution utilizing a first plurality of domains used to identify data items. Next the system generates a second distribution based on a plurality of requests to view a second plurality of data items. Next the system generates a third distribution based on the first distribution and the second distribution. Finally the system generates interface information, to be communicated to a user, based on the third distribution.

Abstract: A computer-implemented method identifies nodes that are beneficiaries of node importance inflating links in a directed graph of linked nodes. The directed graph of linked nodes corresponds to a linked database, and the nodes correspond to documents within the linked database. The method is performed by a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the method. The method includes computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function, and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node.

Abstract: A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system.

Abstract: A system is disclosed for customizing a geographic location index based on user preferences. The system obtains geographic data provided by a user and generates a customized geographic region based on the obtained geographic data. The system generates relationship data corresponding to the new customized geographic region. The system updates the geographic location index based on the new customized geographic region and corresponding relationship data. Thereafter, on-line content may be delivered to an audience associated with the new customized geographic region, thereby allowing the user, such as an advertiser or publisher, to define targeting regions that are optimal to their specific business environment.

Abstract: A computer-implemented method to access a tree data structure in a computing environment is provided. The method includes generating a tree data structure in a computing environment, wherein the tree data structure includes nodes and links to link the nodes, wherein each node includes fields for various data types, accessing contents of the tree data structure with a single command in a computing environment.