Abstract: A scheme for accessing an index structure using a reference minimum bounding shape is disclosed. In one example embodiment, a reference minimum bounding shape that encloses two or more minimum bounding shapes may be identified from an index structure stored in memory. Each of the two or more minimum bounding shapes may correspond to a data object associated with a corresponding leaf node of the index structure. In one example embodiment, the index structure may be accessed using the reference minimum bounding shape. In one example embodiment, at least one minimum bounding shape of the two or more minimum bounding shapes may be represented in a relative representation calculated relative to the reference minimum bounding shape. Also disclosed are a method, a system and a non-transitory computer-readable storage medium for accomplishing the same scheme as described above.

Abstract: Map display systems, map data processing apparatuses, map display apparatuses, and map display methods for general navigation systems are provided. A map data processing section categorizes original three-dimensional map data into scene graph data representing a data structure of a three-dimensional map using a tree structure and rendering data for rendering an object included in the three-dimensional map and processes the scene graph data and the rendering data. A map data display section specifies a display area by referring to the scene graph data and reads and displays the rendering data in accordance with the specified display area.

Abstract: A method for controlling a relational database system by executing a database query in a relational database which contains, as an associated data structure, a plurality of data tables interconnected through relations, by using a database language, with a table of the relations being provided. A processable database statement without relation-related operations is created by indicating the data tables to which the processing functions are to be applied and by indicating the order of the selected data tables according to which the processing is to be carried out, and an access path, which concretely states the order of access to the database, is determined by first computing a partial access path, via the table of relations, between each two subsequent, selected data tables on the basis of the relations which exist between the subsequent data tables, and then assembling the access path from all computed partial access paths.

Abstract: A method, system, and computer readable medium for controlling user access from a segmented network to shared remote applications stored on a remote server. The method begins by generating a folder/file structure for a remote application that is to be shared on the segmented network. A file server drive mapping to a linking infrastructure data is generated for the remote application and an icon associated with the remote application is retrieved. An application launcher file is generated for the remote application. Then, an application linker file associated with the application launcher file for the remote application is generated. A command file is generated for copying the application linker file to a user's desktop. The linker file is updated to point to the file server drive. A folder for user access to the remote application is then deployed that includes the remote application icon, the application linker file, the application launcher file, and the command file.

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 computer-implemented method is provided for managing a plurality of data objects including dimensional attributes. The method includes receiving a plurality of data objects including dimensional attributes and assigning each of a plurality of nodes to one or more of a plurality of keyspace positions of a keyspace, wherein the plurality of nodes define partitions of the keyspace. A space filling curve is applied to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions, and each of the plurality of data objects is transmitted to one or more of the plurality of nodes assigned to a keyspace position corresponding to the key value of the respective data object. A system for managing a plurality of data objects including dimensional attributes is further provided.

Abstract: The present invention aims to facilitate integration of databases by classifying a plurality of tables in databases into a group of similar tables. A table classification device 1 includes a semantic classifying unit 20 carrying out classification with considering meanings of columns which form a database and a statistical classifying unit 30 carrying out classification based on statistical information of the columns. The tables are classified hierarchically by combining a classification method of the semantic classifying unit 20 and a classification method of the statistical classifying unit 30.

Abstract: A system and method of identifying relational patterns across a plurality of databases using a data structure and the data structure itself. The data structure including one or more data node branches, each of the one or more data node branches including one or more data nodes, each of the one or more data nodes representing a data item of interest and corresponding data item support values for the data item across the plurality of databases in relation to other data items represented in the data node branch. The data structure can be used to mine one or more relational patterns considering pattern support data across the plurality of databases at the same time.

Abstract: A method for parsing a text file defines a tree pattern and a plurality of character string patterns. A tree structure corresponding to the text file is determined according to the tree pattern, and the desired data are retrieved from the text file according to the character string patterns. The retrieved desired data are output into a storage system.

Abstract: A system and method are provided for summarizing multiple aspects of tags associated with media events. In the system and method, tag metadata for tags generated at one or more user interfaces associated with at least one media event is obtained. Thereafter, tags are organized into a hierarchy of tags based on the metadata and a metadata sorting criteria. Additionally, tag significance data for tags is computed based on the metadata and the hierarchy. A visual representation of the tags can then be generated, where indicia for the tags is spatially arranged to visually depict the hierarchy of the tags are selected to visually depict at least a relative significance among sibling tags in the hierarchy.

Abstract: Embodiments of the present invention pertain to determining top combinations of items to present to a user. According to one embodiment, data that includes information describing a plurality of combinations of records is accessed. Each record describes a plurality of items. The data is analyzed using a branch and bound search procedure to determine top combinations of items based on a specified metric and a specified number. According to one embodiment, the metric is value enabled and the specified number determines how many combinations of items are associated with the top combinations of items.

Abstract: A method of database update processing for updating efficiently database index keys, when new database index keys are supplied to replace index keys already in the database, generates a delta data between the new and old data comprising insert and delete keys by delete processing from a coupled node tree holding the index keys in the old data using index keys of new data as delete keys, and generates new data by delete and insert processing from and into a coupled node tree holding index keys in old data as index keys using the delete keys and insert keys of the delta data.

Abstract: A volatile memory manager of a data handling system can be configured to convert the one-to-many external reference into an external reference that references the common ancestor node of the contiguous region. Specific pathing and/or termination conditions can be contained in a Relationship_Path parameter of the external reference. The hierarchical data structure can also be loaded into volatile memory by the volatile memory manager as data structure references. The volatile memory manager can be further configured to perform various functions utilizing the external and data structure references.

Abstract: A system can process an XML document associated with a schema. The system includes a matching component that is capable of receive a discrete piece from a stream of discrete pieces of the XML document. The matching component is capable of further analyzing the schema associated with the XML document and grabbing one or more discrete pieces of the XML document that are related to the discrete piece based on the schema and keeping in memory only the discrete piece of the XML document and said one or more related discrete pieces of the XML document. Then, the matching component can perform a match on said discrete piece and the one or more related discrete pieces of the XML document, and pass the discrete piece and the one or more related discrete pieces of the XML document to a user object for handling when a match is reached.

Abstract: An Internet telephony registry 190 comprises a server 140 and an associated data store 160. Routing and/or policy data associated with telephone number strings are stored in the data store 160 in a tree data structure 240 and a data index map 230. The tree data structure 240 comprises parent nodes and leaf nodes and each parent node of the tree data structure 240 has ten child nodes. The tree data structure 240 stores an index associated with each telephone number string and the data index map stores routing and/or policy attributes 233 represented by the indices 232.

Abstract: The invention concerns a method for assisting user searches in a support system and a system for performing the method which comprises the steps of providing a support data structure with nodes comprising support information of a support database, and providing at least one behavioral data structure comprising information about the time the user(s) spend at said nodes, and information about the transition probabilities between each upper node and its lower nodes, and calculating for each lower node that is located below a current node, navigated to by a user of the support data structure, the expectation value of the time gained by navigating directly to that lower node, and selecting at least one of the lower nodes based on said expectation value.

Abstract: A data storage and retrieval device and method is disclosed. The device includes at least one magnetic storage medium configured to store target data and at least one re-configurable logic device comprising an FPGA coupled to the at least one magnetic storage medium and configured to read a continuous stream of target data therefrom, having been configured with a template or as otherwise desired to fit the type of search and data being searched. The re-configurable logic device is configured to receive at least one search inquiry in the form of a data key and to determine a match between the data key and the target data as it is being read from the at least one magnetic storage medium. This device and method can perform a variety of searches on the target data including without limitation exact and approximate match searches, sequence match searches, image match searches and data reduction searches.

Abstract: A method of creating a family tree includes receiving a request from a user to return a file that includes the family tree and using a plurality of primary source records to construct the family tree based on the request. The records indicate multiple alternatives for at least one branch of the family tree. The method also includes sending a file that includes the family tree to the user. The file includes the alternatives.

Abstract: A network device to determine the presence of one or more of the pre-defined strings in a message based on searching for a suffix and a reverse prefix in response to receiving a key search data indicating possible presence of any of the plurality of pre-defined strings. The network device indicates the presence or absence of one or more of the pre-defined strings in the message based on the suffix and prefix search results.

Abstract: A retrieval device according to the present embodiment associates one tag key with one node and removes a node not having a tag key when a trie tree generating unit generates a trie tree. Moreover, because a tag key having a low priority is registered in a node close to a root node when the trie tree generating unit registers tag keys in the nodes of the trie tree, the retrieval device can narrow down a node region that is a comparison target when a trie tree searching unit performs a retrieval process.

Abstract: An injective function can execute against two different data repositories to generate a textual state representation for each of the different data repositories. The injective function can be a function that preserves distinctness, where the distinctiveness can be a one-to-one mapping of each element within the element domain to one element of a co-domain. The hash function can be executed for each of the different textual state representations to generate a corresponding hash number. The hash numbers can be compared to each other. When results from the comparing indicate the hash numbers are equivalent, the two different data repositories can be determined to be equivalent to each other and when results indicates the hash numbers are not equivalent, the two different data repositories can be determined to be not equivalent to each other.

Abstract: A computer system comprising storage devices having different characteristics, a client computer, and a file access controller managing the storage devices with the HSM is disclosed. The file access controller provides a normal directory tree and a virtual directory tree, according to the configuration, and provides a first file stored in a first storage device through the normal directory tree and the virtual directory tree. And, the file access controller switches providing of a second file stored in a second storage device, depending on a used directory tree, which is used by the at least one client computer, and which is the normal directory tree or the virtual directory tree. Examples of the switch are about accessibility of the second file and recall processing of the second file.

Abstract: In a method for managing a directory (10) stored on at least one server (8), the directory (10) includes entries (12) arranged in a tree structure. Each entry (12) includes at least one attribute. An alias entry (12A) includes an attribute pointing to a target entry (12T). The method includes assigning to an application (14) an owner role in relation to an alias entry (12A). An application (14) is referred to as owner of the alias entry (12A). The method further includes requesting, by an application (14), deletion of the alias entry (12A), determining if a deletion condition is satisfied, and, if so, deleting the alias entry (12A). The deletion condition includes that the application (14) is the only owner of the alias entry (12A). A controller (30) for managing a directory (10), a server (8) including a directory (10), a system, and a computer program are also disclosed.

Abstract: Provided is a k-nearest neighbor search method of searching for a query number k of nearest points to an arbitrary point in a DBMS for creating a spatial index from multidimensional points, comprising setting a search conditions, judging which of a lowest branch and an intermediate branch of the spatial index a nearest region to the query point is, calculating, when the nearest region is judged to be the lowest branch, a distance between the query point and a child region of the nearest region, storing information of a divided region which has become a calculation target, calculating, when the nearest region is judged to be the intermediate region, a distance between the query point and a point included in the nearest region, storing information of the point which has become a calculation target, finishing search processing when the search conditions are satisfied, and obtaining a search result from the DBMS.

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: A term analyzer receives an ordered collection of text-based terms. The ordered collection can contain terms from a document that have been filtered to remove “noise” such as stopwords. The term analyzer analyzes groupings of consecutive text-based terms in the ordered collection to identify occurrences of different combinations of text-based terms in the ordered collection. In addition, the term analyzer maintains frequency information representing the occurrences of the different combinations of text-based terms in the collection. The frequency information can then be used to determine relatively significant keywords and/or keyword phrases in the document. In an example configuration, the term analyzer creates a tree in which a first term in a given grouping of the groupings is defined as a parent node in the tree and a second term in the given grouping is defined as a child node of the parent node in the tree.

Abstract: A method and system for dividing a tree structure of a structured document based on a tree structure defined by a schema of the structured document. The method includes the following steps: calculating an index value of size of a subtree having each element as a root for at least part of at least one element included in the tree structure defined by the schema, and deciding on a division pattern using the index value, where the division pattern is used to divide the tree structure of the structured document to which the schema is applied so that the size of the subtree, after being divided, meets a predetermined standard.

Abstract: A computer memory stores a data structure representing a ternary search tree (TST) representing multiple word n-grams for a corpus of documents. The data structure includes plural records in a first memory, each record representing a node of the TST and comprising plural fields. At least some n-grams have a sequence of units. The plurality of fields includes one for identifying a given unit of the sequence for a given node, one reserved for storing payload information for the given node, and plural child fields reserved for storing information for a first, second and third child nodes of the given node. The child fields store a null value indicating the absence of the child node or an identifier identifying a memory location of the child node. For at least one record, at least one of the child fields stores an identifier identifying a memory location of a memory different than the first memory.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Architecture that addresses the efficient detection of conflicts and the merging of data structures such as trees, when possible. The process of detecting conflicts and merging the trees is a meld operation. Confluent trees offer transactional consistency with some degree of isolation, and scaling out a concurrent system based on confluent trees can be accomplished where the meld operation is more efficient than the transaction computations. Transactions execute optimistically using lazily versioned “intention trees” that efficiently describe dependencies and effects using structure and content version information for each intention subtree. The data structure is modified by melding the intention trees in sequence, which causes each transaction to either commit (producing an incremental new version of the data structure) or abort (identifying a conflict which prevents the intention tree from being melded). The architecture is computationally efficient and completes without needing to access much of each tree.

Abstract: In an embodiment of the present invention, event handlers are used to trigger actions based on events occurring on a data stream. A process of the present invention involves creating the event handler, which may be embodied in, for example, software. The creation of the event handler involves parsing all of the rules in a manner that allows events themselves to trigger actions that will ultimately involve evaluation of rule and, if necessary, firing of those rules.

Abstract: At least one unique collection of storage artifacts can be specified to indicate that the storage artifact is a member of the unique collection. Each storage artifact can be a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium. The collection can be referenced by a set of different storage artifacts to form a collection of related storage artifacts. Each storage artifact can correspond to different collections, wherein membership within a collection is independent of a storage path within the tree structure. A file management action relating to the storage artifact can be performed. The file management action can be dependent upon the storage artifact being a member of the unique collection.

Abstract: An integrated search engine device evaluates span prefix masks for keys residing at leaf parent levels of a search tree to identify a longest prefix match to an applied search key. This longest prefix match resides at a leaf node of the search tree that is outside a search path of the search tree for the applied search key. The search engine device is also configured to read a bitmap associated with the leaf node to identify a pointer to associated data for the longest prefix match. The pointer has a value that is based on a position of a set bit within the bitmap that corresponds to a set bit within the span prefix mask that signifies the longest prefix match.

Abstract: Methods, program products and systems for determining, for a database query that does not represent a snowflake schema, a graph comprising vertices each representing a table joined in the query, a directed edge between each pair of vertices of which a first vertex represents a first table and a second vertex represents a second table that is joined in the query with the first table, each of the edges representing one of an outer join and an inner join. Further determining, for the graph, a directed spanning tree that represents an ordering of joins in the query and includes all outer join edges in the graph.

Abstract: An apparatus, system, and method is disclosed for receiving a hierarchical data structure, analyzing the hierarchical data structure to determine what actions are needed to correctly process the hierarchical data structure in a data repository, generating a hierarchical command structure comprising a series of repository-specific commands needed to interface with the data repository, and executing the repository-specific commands to process the hierarchical data structure with respect to the data repository. In selected embodiments, the hierarchical command structure is represented as a series of nodes including a parent node and at least one child node.

Abstract: Event prediction using hierarchical event features is described. In an embodiment a search engine monitors search results presented to users and whether users click on those search results. For example, features describing the search result events are universal resource locator prefix levels which are inherently hierarchically related. In an embodiment a graphical data structure is created and stored and used to represent the hierarchical relationships between features. An online training process is used in examples which enables knowledge to be propagated through the graphical data structure according to the hierarchical relations between features. In an example, the graphical data structure is used to predict whether a user will click on a search result and those predictions are used by the search engine to rank search results for future searches. In another example the events are advertisement impressions and the predictions are used by an online advertisement system.

Abstract: In one embodiment, a tree traversal sequentially processes every level of two or more binary trees until reaching a leaf node for each the binary trees. Processing each level of the binary trees comprises: determining whether each traversed node of the remaining binary trees at the level is a non-leaf node or a leaf node; for the traversed leaf nodes at the level, remove the binary trees to which the leaf nodes belong from the remaining binary trees; and iteratively evaluating the traversed non-leaf nodes at the level of every n remaining binary trees until the non-leaf nodes at the level of all of the remaining binary trees are evaluated, where n?2 and evaluating the non-leaf nodes of each n binary trees comprises concurrently evaluating the n non-leaf nodes of the n binary trees to determine to which one of the two child nodes of each of the n non-leaf nodes to traverse.

Abstract: A storage system includes: a data storing means configured to store storage target data and also store address data so as to be tree-structured, the address data being based on a content and storing position of data to be referred to, and the address data referring to the storage target data or other address data; an operation log generating means configured to generate an operation log that represents a content of an operation of storing the storage target data into the data storing means and a content of an operation of storing the tree-structured address data referring to the storage target data into the data storing means; and a file system committing means configured to store the storage target data and the tree-structured address data into the data storing means based on the operation log.

Abstract: A bit string searching apparatus has a coupled node tree, having a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes in adjacent storage areas, the branch node including a search key discrimination bit position and information indicating a position of one node of a node pair of a link target, and the leaf node including an index key that is a bit string that is the target of a search, wherein a search for an index key from the root node to a branch node using a search key is executed by repeatedly and successively linking to one node of a node pair of a link target, according to a bit value of a search key at the discrimination bit position in the branch node, until reaching the leaf node.

Abstract: Methods and systems of the present invention allow for displaying suggested concept-based results. An exemplary method may comprise the steps of receiving a combination domain name and top level domain (TLD), determining from ontological calculations suggested TLDs related to the concept of the combination and displaying the suggested combination of the domain name with suggested TLDs.

Abstract: A method and apparatus for accessing data using an N-leg search tree. The method comprises determining a tree identifier using a computer, traversing an N-leg search tree associated with the tree identifier, and accessing a data structure. The N-leg search tree is stored on a computer and traversed to a given node within the tree. The accessed data structure is associated with a deepest valid traversed node. The given node corresponds to a given element of a structured identifier. The apparatus comprises means for determining a tree identifier, one or more N-leg search trees for storing a given set of data and means for traversing the N-leg search tree.

Abstract: Browsing content stored in a content source. A content source identifier corresponding to the content source, a content type, and a hierarchical structure are received. The hierarchical structure defines a hierarchy of content stored in the content source that is independent of the file structure of the content stored in the content source. A guided browse function is generated based on the content source identifier. The content stored in the content source is searched by using the guided browse function, wherein in response to receiving a request from a presentation module to browse content corresponding to a selected node in the hierarchical structure, the guided browse function searches the content stored in the content source by using a search query corresponding to the selected node, and returns results of the search to the presentation module. The results are presented to a user by using the presentation module.

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: A system and method for classifying and defining relationships between product information data is provided. The method classifies the product information data to two different data types. Each data type includes a plurality of items. The items of each of the two types are arranged in a product information tree. The items of all the product information trees are associated to construct a new tree for showing the relationships of the product information data.

Abstract: Data having express or implied relationships may be displayed by selecting a starting entity in a data structure, building a relationship tree, and building and optimizing a relationship matrix based on the relationship tree. The optimized relationship matrix may be used to layout and render a graphical image that positions various elements with respect to the starting entity based on the relationships. The distance matrix may be optimized by creating a first distance matrix based on the relationship tree, developing a dissimilarity matrix based on expressed or implied relationships, and multiplying the dissimilarity matrix by a weighting factor to determine a distance matrix that may be optimized by multi-dimensional scaling. An optimized weighting factor may be determined and used to select an optimized distance matrix.

Abstract: A first dependency graph representing one or more dependencies in a first computing domain in a computer system can be generated. The first dependency graph can include a reference to an object in a second computing domain that is different from the first computing domain. A second dependency graph can be generated using the reference to the object. The second dependency graph can represent one or more dependencies in the second computing domain in the computer system, and the one or more dependencies represented in the second dependency graph can include one or more dependencies of the object.

Abstract: A computer implemented method is disclosed for obtaining file-level information from block level information of files stored on a storage medium. The method includes accessing the storage medium to obtain metadata available in block level on the storage medium and building an inverse block-to-file map of the files stored on the storage medium. The method also includes listening online to incoming block-level commands communicated from a host to the storage medium, parsing the incoming block-level commands, inferring file-level information from the parsed block level commands; and updating the inverse file-level map. Also disclosed are corresponding computer program product and processing system.

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: 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 method and apparatus for generating a non-linear narrative article. After generation of a non-linear narrative article from a set of narrative rules and accompanying media elements, the narrative is optimised and the media elements are also optimised into a dictionary. A narrative tree generator determines all possible paths through the narrative to generate a narrative tree and redundant parts are removed.