Abstract: A hardware trie structure includes a tree of internal node circuits and leaf node circuits. Each internal node is configured by a corresponding multi-bit node control value (NCV). Each leaf node can output a corresponding result value (RV). An input value (IV) supplied onto input leads of the trie causes signals to propagate through the trie such that one of the leaf nodes outputs one of the RVs onto output leads of the trie. In a transactional memory, a memory stores a set of NCVs and RVs. In response to a lookup command, the NCVs and RVs are read out of memory and are used to configure the trie. The IV of the lookup is supplied to the input leads, and the trie looks up an RV. A non-final RV initiates another lookup in a recursive fashion, whereas a final RV is returned as the result of the lookup command.

Abstract: Data processing includes accessing a product category tree, the product category tree comprising a plurality of hierarchical levels. A leaf category level of the plurality of hierarchical levels comprises a leaf category node. The leaf category node includes product information. The product information comprises a plurality of product attribute parameters. The plurality of product attribute parameters comprises standard product information. Data processing further includes selecting, among the plurality of product attribute parameters that correspond to the leaf category node, a representative product attribute parameter that is representative of the product information; and partitioning standard product information of the leaf category node to obtain a plurality of sets using the representative product attribute parameter, wherein each of the plurality of sets includes at least some of the standard product information.

Abstract: A method for exploring a catalog of digital information contents through a user apparatus is provided with a display screen, in which the catalog of digital information contents is structured according to at least two hierarchical tree structures, each including a respective hierarchy of nodes, each node corresponding to a respective category of digital information contents.

Abstract: A method and apparatus for generating a data structure. A plurality of entity reference relationship structures is accessed. Each entity reference relationship structure establishes a relationship between a different pair of entity structures of a plurality of entity structures. Each path from a first vertex to a second vertex that corresponds to a second entity structure is determined. For each path, all coupled sets of pairs of entity instance identifiers, wherein each coupled set comprises a pair of entity instance identifiers from each entity reference relationship structure corresponding to the path are identified. For each coupled set, a first entity instance identifier in the each coupled set that refers to the first entity structure and a second entity instance identifier in the each coupled set that refers to the second entity structure are stored in association with one another in a new entity reference relationship structure.

Abstract: Provided is a graphical user interface (GUI) to associate information with an object. Different views are maintained providing different hierarchical arrangements of a set of objects. Selection is received of one view and one object in the selected view. Information is associated with the selected object, wherein the associated information is accessible in all views in which the object with which the information is associated is accessible.

Abstract: The techniques introduced herein provide an efficient mechanism for reducing remote procedure requests to storage server nodes in a cluster of the storage servers to construct a directory path for a data container. According to one aspect of the invention, a new caching technique and an efficient organization of the cache memory are provided so that a cache memory on a storage server node is populated with individual path components of a directory structure. A novel cache invalidation mechanism is provided to maintain cache consistency at the cache so that when a path component changes, such as an identifier of a data container in the directory structure, and a path component is invalidated in the cache memory, the remaining path components can be retained and later reused.

Abstract: Systems and methods for performing latency-free contact searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual contact data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.

Abstract: A method of assisting with the construction of a tree of clusters of electronic documents, the documents being defined by predetermined attributes. The method includes, for a given cluster of documents and a given level of the tree, the following steps: a) obtaining (E300) constraints defined between at least two documents of said cluster and storing those constraints; b) constructing (E310) subclusters as a function of the constraints obtained and the attributes of the documents of said cluster; c) creating (E320) a tree level corresponding to the subclusters created; and d) selecting (E340) a created subcluster and iterating the steps a), b), c) and d) for the selected subcluster until said tree is obtained. A device for implementing the method is also disclosed.

Abstract: A pipelined search engine supports a tree of search keys therein that utilizes span prefix masks to assist in longest prefix match (LPM) detection when the tree is searched. Each of a plurality of the span prefix masks encodes a prefix length of a search key to which the span prefix mask is associated and a value of another search key in the tree that is a prefix match to the search key to which the span prefix mask is associated.

Abstract: Systems and methods of mining Web applications are disclosed. An example method may include selecting a distance measure between subtrees of the Web applications. The method may also include computing an edit distance for the subtrees. The method may also include finding sets of similar subtrees using the edit distance with a Similar Sibling-Trees-aware RTDM (SiSTeR) approach.

Abstract: A method and system for managing data clusters is provided. A first data cluster is generated having a first data object and a second data object. The first data cluster has a strict hierarchy between the first data object and the second data object. A first object reference from the first data object to the second data object is extracted. The first object reference is stored in a first reference container. A second object reference from the first data object to a third data object is extracted. The third data object is stored in a second data cluster. The second object reference is stored in a second reference container. The second object reference is stored in a second reference container. A memory access is provided to the first data cluster based on the first object reference and the second object reference.

Abstract: A network device may include a heterogeneously organized TCAM in which entries for different applications implemented by the network device are stored at arbitrary locations in the TCAM. The TCAM may be programmed to include entries, each corresponding to a node of a prefix tree (“trie”) data structure, used in processing network traffic received by the network device. The entries in the TCAM may represent multiple different data structures that are heterogeneously stored in the TCAM and each data structure may be used by the network device to implement an application related to processing of network traffic.

Abstract: Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

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 method and an apparatus for constructing a spatial tree data structure corresponding to a region. According to the present principles, a cell may include therein a point or a set of points that are determined to be duplicate points. In an embodiment the duplicate points are determined based on the size of the points included within the cell The inclusion of duplicate points within a particular cell, rather than further subdividing the cell, provides coding efficiency. The present principles are particularly advantageous in the context of quadtree or octree type partitioning, and may be used in 3D mesh coding.

Abstract: A method and apparatus for implementing a learning model for facilitating answering a query on a database. Example embodiments include processing logic to: receive access to a database having a plurality of rows; determine for each row in the plurality of rows which of a plurality of child nodes to associate with a row based on the row and current parameters, where the current parameters correspond to parameters of a probability distribution for the plurality of child nodes; determine new parameters for the plurality of child nodes based on associated rows of the plurality of rows; determine whether or not to return a result which indicates the new parameters based on the current parameters, the new parameters, and the plurality of rows; and return a result which indicates the new parameters.

Abstract: Methods, systems and program product are disclosed for determining matching level of a text lookup segment with a plurality of source texts in a translation memory in terms of context. The invention determines exact matches for the lookup segment in the plurality of source texts, and determines, in the case that at least one exact match is determined, that a respective exact match is an in-context exact match for the lookup segment in the case that a context of the lookup segment matches that of the respective exact match. Degree of context matching required can be predetermined, and results prioritized. The invention also includes methods, systems and program products for storing a translation pair of source text and target text in a translation memory including context, and the translation memory so formed. The invention ensures that content is translated the same as previously translated content and reduces translator intervention.

Abstract: A document recognition system and method, where images are represented as a collection of primitive features whose spatial relations are represented as a graph. Useful subsets of all the possible subgraphs representing different portions of images are represented over a corpus of many images. The data structure is a lattice of subgraphs, and algorithms are provided means to build and use the graph lattice efficiently and effectively.

Abstract: In one embodiment, non-transitory computer-readable medium stores instructions for implementing a file system, which include operations for acquiring an exclusive lock on a first node in an ordered tree data-structure, and adding an identifier and index of the first node to a path data structure. If the value of the index in the first node is non-zero, then each exclusive lock acquired between the first node and the root of the tree data structure is released. In any case, the operation proceeds to a second node, which is addressed at the index on the first node. In one embodiment, operations further include acquiring an exclusive lock on the second node, and, if the second node is a leaf node, performing updates to the second node, and then releasing each exclusive lock in the data-structure.

Abstract: The present application is directed to a data management system. The data management system is implemented within a computer system that includes one or more processors, one or more electronic memories, and a memory-mapped file facility that electronically stores data. The data management system, implemented by data management system control routines that are executed by the one or more processors, retrieves a particular projection of a multi-level, multi-dimension data set stored within the ONP-tree data structure that contains the multi-level, multi-dimension data set.

Abstract: Performing a user initiated search query is disclosed and comprises receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, constructing a tree data structure based on the description details of the plurality of objects, the tree data structure comprising one or more attributes related to each of the plurality of objects retrieved, displaying visual images associated with the retrieved plurality of objects, the visual images matching at least one of the attributes related to the plurality of objects, and receiving a user selection of one or more of the visual images.

Abstract: Embodiments of the invention provide techniques for composing data queries. In one embodiment, a mapping template is provided to represent data in terms that are easy to understand. The mapping template is used to provide a tree structure made up of nodes that are queried. A query may be composed by navigating the tree structure to select nodes of interest and specifying predicates for the selected nodes. Once the query is composed, it may be executed against the data.

Abstract: A container format processing tool performs syntax-aware manipulation of hierarchically organized syntax elements defined according to a container format in a media file. For example, a container format verifier checks conformance of a media file to a container format, which can help ensure interoperability between diverse sources of media content and playback equipment. Conformance verification can include verification of individual syntax elements, cross-verification, verification that any mandatory syntax elements are present and/or verification of synchronization. Or, a container format “fuzzer” simulates corruption of a media file, which can help test the resilience of playback equipment to errors in the media files. The container format fuzzer can simulate random bit flipping errors, an audio recording failure or incorrect termination of recording. Or, a container format editor can otherwise edit the media file in the container format.

Abstract: A system configured to associate information with a file. The system including memory, one or more processors, and one or more modules stored in memory and configured for execution by the one or more processors. The modules including a reader module configured to perform a lockless read of a B-tree stored in an operating system file and a writer module configured to perform a write process to the B-tree.

Abstract: To provide an information processing apparatus, a database system, an information processing method, and a program which ensure efficient database accesses by partitioning.

Abstract: A method and system for searching for data covered by nodes in a quadtree are disclosed. Nodes at a selected level of the quadtree are encoded with an index. The index nodes store data related to the level of descendants and ancestors of each index node. To search for data covered by a particular desired node, the index node ancestor or descendant of the desired node is determined. Based on the data in the index node, the desired node can be located without a full traversal of the quadtree. The quadtree nodes store elevation data for points on the Earth.

Abstract: In one embodiment, the present invention provides a data stream reference module 250 that can enable a user to perform forward tracing, backward tracing, and tracing indirect dependencies in a data model and/or metadata model. The tracing is not necessarily along a common hierarchical level but can be from one level to another.

Abstract: A computer-based method and system for managing attributes of objects in a namespace and for allowing multiple views into the namespace. The namespace system allows the objects identified by the names of the namespace to be hierarchically organized. The namespace system allows for attributes of various objects, including directory objects and data objects, to be dynamically defined after creation of an object. The namespace system also allows for the querying of objects based on their dynamically defined attributes. When the namespace system receives a query specification that includes a newly defined attribute, it identifies the objects that match that query specification.

Abstract: Method and system for building a support vector machine binary tree for fast object search. An appearance model can be generated for objects in a database and computed on regions detected in an image frame. A covariance matrix can be utilized for representing the appearance model of the detected regions. The covariance matrix appearance model can be preprocessed and/or transferred into a vector-based format. The data in the vector-based format can be added with a class label to form labeled data. A support vector machine (SVM) can be utilized on the labeled data to generate a classifier with an optimal hyperplane and a margin area in order to hierarchically build a balanced SVM binary tree. A query appearance model can be searched rapidly utilizing the SVM binary tree during a search phase.

Abstract: Systems, methods and computer program products identify a plurality of webpage attributes, where each of the plurality of webpage attributes is associated with a value. A date tree is built, the data including a plurality of nodes identifying the values associated with the plurality of webpage attributes, and is optimized by deleting one or more of the plurality of nodes. The number of web pages associated with at least one of the plurality of nodes in the optimized data tree is then determined.

Abstract: A system and methods for bi-directional conversion of directed acyclic graphs (DAG) and inter-file branching are described. The system for bi-directional conversion of directed acyclic graphs and inter-file branching includes memory, one or more processors, and one or more modules stored in memory. The one or more modules are configured for execution by the one or more processors. The modules include a conversion module configured to convert between a directed acyclic graph branch and an inter-file branch.

Abstract: Embodiments of methods and/or systems of manipulating tree expressions are disclosed.

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

Abstract: A mechanism is provided for efficiently searching a database for data associated with a key value that is unidentifiable in a set of nodes of the database. A request is received to retrieve data from the database, where the request specifies a searched-for key value that is unidentifiable in the set of nodes of the database. The data associated with the searched-for key value is identified in a lowest level node of the database between a current leftmost node and a current rightmost node. A key index is updated in at least one node of the database with the key index value associated with the data and identified from the lowest level node thereby making the searched-for key value identifiable within the at least one node. The data associated with the searched-for key value is then returned to a user.

Abstract: An apparatus and method for calculating the selectivity of a range query for multidimensional data using a multidimensional histogram are provided. A data space may be partitioned into one or more sub-spaces based on a sum of skew values of the one or more sub-spaces, a space-partitioning tree may be generated for the data space, and a multidimensional histogram may be generated for the data space based on the space-partitioning tree. A range query for multidimensional data may be processed based on the multidimensional histogram.

Abstract: Techniques are described for creating geospatial elements based on geographical data. In one example, a method for creating geospatial elements based on geographical data includes collecting one or more geographical indicators comprised in a set of operational data, the geographical indicators indicating one or more geographical areas. The method further includes collecting, from a set of geographical data, geospatial data associated with the one or more geographical areas indicated by the one or more geographical indicators. The method further includes generating one or more aggregated geospatial elements based on the one or more geographical indicators and the geospatial data.

Abstract: In an embodiment, a method of updating a memory with a plurality of memory lines, the memory storing a tree, a plurality of buckets, and a plurality of rules, can include maintaining a copy of the memory with a plurality of memory lines. The method can further include writing a plurality of changes to at least one of the tree, the plurality of buckets, and the plurality of rules to the copy. The method can additionally include determining whether each of the plurality of changes is an independent write or a dependent write. The method can further include merging independent writes to the same line of the copy. The method further includes transferring updates from the plurality of lines of the copy to the plurality of lines of the memory.

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: A method and apparatus for preprocessing a plurality of documents for search and presenting search result and a system for searching documents that comprises these apparatuses. The search result, for example, includes at least one candidate document. The candidate document is assigned a tree structure representing its content. The tree structure includes at least one node. The method may include presenting at least a portion of the tree structure corresponded to the candidate document in the search result.

Abstract: A method and system for discovering keys in a database. A minimal set of non-keys of the database are found. The database includes at least two entities and at least two attributes. The minimal set of non-keys includes at least two non-keys. Each entity independently includes a value of each attribute. A set of keys of the database is generated from the minimal set of non-keys. Each key of the generated set of keys independently is a unitary key consisting of one attribute or a composite key consisting of at least two attributes.

Abstract: Systems, methods, and apparatus are herein disclosed for prefetching node data of a linked data structure into a processor's cache so as to decrease linked data structure traversal latency. In particular, as the linked data structure is created or modified, forward and reverse prefetch nodes are identified and links identifying locations of these nodes are written to nodes that will be traversed N nodes prior to the prefetch nodes. Once the linked data structure has been created, traversals of the structure use the prefetch links to prefetch node data into the processor cache, so that when traversal reaches a node, that node's data is read from processor cache rather than from memory.

Abstract: Described is automatically processing an initial database repro (text representing a bug when corresponding script is executed in a database engine) into a min-repro (a subset of the text) that is simplified version of the initial repro yet still contains the bug. A parse tree representative of the initial database repro is processed into simplified parse trees based on language grammar rules, e.g., by replacing higher level nodes with descendant nodes. Repros of the simplified parse trees are executed to determine which simplified repros still fail execution because of the bug (that is, the simplified repros were not oversimplified). A minimum simplified parse tree with respect to a desired level of minimality is found from among those failing repros, with the simplified repro that corresponds to the minimum simplified parse tree output as the min-repro.

Abstract: Methods, apparatus, and computer-accessible storage media for restoring data from a snapshot to a data volume. The blocks in the volume may be treated as an implicit tree structure, for example a binary tree; each local block corresponds to a block on the snapshot. A local block on the volume may be marked, for example fingerprinted with metadata, to indicate that the local block has not been restored. Initially, the local block at the root node is marked. To restore a local block, the restore process may generate a list indicating all local blocks on a path from the root node of the tree to the target node that have not been restored. The marks in the local blocks are used in generating the list. For each block indicated in the list, children of the block are fingerprinted, and the block is restored from the snapshot.

Abstract: According to the invention, a system for storing and displaying genealogical information is disclosed. The system may include a processor and a storage medium having processor instructions. The instructions may be for receiving information which identifies a first and second parent, receiving information which identifies a first and second child, and receiving an indication that the first child is a biological child of both parents, and that the second child is a biological child of only one parent. The instructions may further be for receiving a first instruction to display a first listing of children, and in response, causing the first child to be displayed in the first listing, but not the second child. The instructions may additionally be for receiving a second instruction to display a second listing of children, and in response, causing both the first child and the second child to be displayed in the second listing.

Abstract: A cloud computing platform includes first device having a graph or tree structure with a node which receives data. The data is processed by the node or communicated to a child node for processing. A first node in the graph or tree structure determines the reconfiguration of a portion of the graph or tree structure on a second device. The reconfiguration may include moving a second node and some or all of its descendant nodes. The second and descendant nodes may be copied to the second device.

Abstract: A navigation device comprises a search tree which indicates next valid characters. The search tree has a plurality of nodes. The nodes are respectively associated with a character. At least some of the nodes respectively include a predetermined indicator to indicate that there is an alternate spelling for a character with which the respective node is associated. A processor is configured to receive a character input and to identify at least one next valid character using the search tree. The processor is configured to identify the at least one next valid character in dependence on whether the predetermined indicator in the search tree indicates that another character has an alternate spelling, the alternate spelling of the other character being the character input.

Abstract: A method and apparatus for managing a stack used for a tree traversal (TRV) may include a processing unit that may manage a short stack for a tree TRV, and a storage unit that may store data of the short stack. The processing unit may perform a restart of the tree TRV from an intermediate node of a tree to fill the short stack when the short stack is empty.

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: An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types.

Abstract: The present invention provides techniques for use in audience-related measurements, including hybrid techniques which include use of panel-based audience-related measurement information and census-based audience-related measurement information. Techniques are provided in which panel-based audience-related measurement information is obtained from multiple providing entities, and census-based audience-related measurement information is obtained one or more providing entities. The obtained information is stored in a database. The stored information may be provided to the information-providing entities, and may be used in calibrating or improving the accuracy of audience-related measurements.