| Entries |
| Document | Title | Date |
|---|
| 20100070534 | GENERATION OF A BUSINESS ONTOLOGY FROM GLOBAL DATA TYPES - Described herein is a method for Global Data Type (GDT) ontology generation that involves parsing GDTs in order to define their basic components and building hierarchical structures for each GDT basic component. Each hierarchical structure is created by breaking down the corresponding GDT basic component into semantic elements and defining a relation between the elements, allowing easier navigation through the structure. New semantically compliant GDTs can be composed by combining already existing elements from the defined hierarchical structures. The GDT ontology eases GDT searching and simplifies the process of creating new GDTs. | 03-18-2010 |
| 20100077008 | Dynamic Online Presentation of Solutions Based on Customer Symptoms - A knowledge management system is disclosed providing the ability to use an issue's symptoms as search criteria for potential solutions within a solution network. User, system, and diagnostics information is received by the solution network. Symptoms of the issue are provided, which are then used with the user, system, diagnostics, and additional information to search the solution network for potential solutions. | 03-25-2010 |
| 20100082692 | METHOD AND APPARATUS FOR CLASSIFICATION OF CORONARY ARTERY IMAGE DATA - A polyline tree representation of a coronary artery tree imaged in a volume data set is obtained, and its topology is extracted to give a topological representation indicating the relative positions of vessels in the tree. The topological representation is compared with a set of topological rules to find possible anatomical classifications for each vessel, and a set of candidate labeled polyline trees is generated by labeling the polyline tree with labels showing each combination of possible anatomical classifications. Each candidate labeled tree is filtered according to a set of geometric rules pertaining to spatial characteristics of vessels in arterial trees, and any labeled tree not satisfying the geometric rules is rejected A figure of merit is calculated for each remaining candidate by comparing features of the vessels measured from the polyline tree and from the volume data set with features of correctly classified vessels in other data sets to determine the probable correctness of the labeling of each candidate, and the candidate with the best figure of merit is selected as showing the proper classification of the vessels. | 04-01-2010 |
| 20100088345 | Information processing apparatus, information processing method, information processing system, and information processing program - An information processing apparatus includes: a storage unit storing content data and first group identification information for identifying first groups in which the content data are arranged in a predetermined unit; a parameter output unit outputting a parameter representing an amount of displacement of an operating object in response to an operation on the operating object which can be displaced in a predetermined range by a user's operation; a selection unit sequentially selecting the content data while the parameter is in a first range and sequentially selecting the first groups by sequentially selecting the first group identification information stored in the storage unit while the parameter is a value in a second range; and a notification unit notifying what content data is selected when the content data are selected by the selection unit and notifying what group is selected when the first groups are selected by the selection unit. | 04-08-2010 |
| 20100094906 | MODULAR FOREST AUTOMATA - Modular forest automata (MFA) provide a unified description of partially-ordered regular tree patterns. MFAs provide simple methods for determinization, sub-typing, intersection, and complementation of these patterns. MFAs support high-performance pattern analysis and matching. Modular forest transducers, in conjunction with modular forest automata, enable compilers to place semantic actions on any state transition while supporting efficient transformation of labeled, directed graphs. | 04-15-2010 |
| 20100094907 | Preservation Aware Fixity in Digital Preservation - A computer based method for the preservation of a digital information in a data set includes receiving a data set to be preserved, the data set including a plurality of preservation objects; creating a fixity table, the fixity table including one or more data types corresponding to preservation data types contained in the preservation objects, each data type being assigned an importance rank and one or more fixity function; for each preservation object, creating a Merkle tree corresponding to the preservation object and based on the fixity table. | 04-15-2010 |
| 20100094908 | METHOD AND/OR SYSTEM FOR MANIPULATING TREE EXPRESSIONS - Embodiments of methods and/or systems of manipulating tree expressions are disclosed. | 04-15-2010 |
| 20100094909 | METHODS, PROGRAMS, STORAGE MEDIA AND SYSTEMS FOR RECORDING AND COMPILING A MUSIC SECTION - This disclosure relates to a method for recording and compiling a music section, wherein multiple takes of the music section are recorded; and wherein the method uses a take folder to store the multiple takes. The take folder may belong to a single track. Sections of one or more takes can be selected to be part of a resulting compilation which is composed of the selected sections. In one embodiment, a method automatically ensures that selected sections do not overlap in time and that there are no breaks between adjacent selections. In addition, the present invention relates to programs, a storage media and data processing systems having the above features as well as to a storage medium containing the music produced thereby. | 04-15-2010 |
| 20100114969 | METHOD AND/OR SYSTEM FOR TRANSMITTING AND/OR RECEIVING DATA - Embodiments of a method and/or system of transmitting and/or receiving data is disclosed. | 05-06-2010 |
| 20100146003 | Method and system for building a B-tree - Various approaches for adding data items to a database are described. In one approach, a method includes receiving a plurality of data items; each data item is to be stored under a unique primary key in the database. In response to each received data item, one of a plurality of fragment builders is selected and the data item is provided as input to the selected fragment builder. The fragment builders operate in parallel to create respective pluralities of B-tree fragments from the input data items. The B-tree fragments are merged into a single B-tree of the database, which is then stored. | 06-10-2010 |
| 20100146004 | Method Of Creating Hierarchical Indices For A Distributed Object System - A data management system or “DMS” provides data services to data sources associated with a set of application host servers. The data management system typically comprises one or more regions, with each region having one or more clusters. A given cluster has one or more nodes that share storage. When providing continuous data protection and data distribution, the DMS nodes create distributed object storage to provide the necessary real-time data management services. The objects created by the DMS nodes are so-called active objects. The distributed object store can be built above raw storage devices, a traditional file system, a special purpose file system, a clustered file system, a database, and so on. According to the present invention, the DMS active object store provides an indexing service to the active objects. In an illustrative embodiment, any object property that has a given attribute is indexed and, as a result, the attribute becomes searchable. The DMS provides hierarchical distributed indexing using index trees to facilitate searching in a highly efficient manner. | 06-10-2010 |
| 20100146005 | Method and apparatus for storing document data in docbase management system - The present invention discloses method and apparatus for storing document data in a docbase management system. The method includes: describing document data by using a tree structure; splitting the document data into multiple data fragments based on the tree structure when storing the document data; and storing the data fragments, and recording the relation of the data fragments, wherein, each data fragment correspond to a subtree or a node in the tree structure. | 06-10-2010 |
| 20100153459 | CONTACT ENTRY POPULATION FROM CALL ENTITY INFORMATION - Populating a contact entry with selected entity information based on an identifier associated with a call (e.g., a telephone call, VoIP call, text message, electronic mail message, or any other communication). As the call is detected, entity information for the identifier (e.g., a telephone number, VoIP address, MAC address, etc.) is generated. The entity information is filtered based on a category of the entity information, user preferences, location of a computing device (e.g., mobile telephone) of the user, or other filtering criteria. The filtered entity information is associated with the contact entry for the identifier, thereby enhancing the contact entry while reducing typing on the computing device. In some embodiments, additional information such as advertisements for a competitor of the entity are provided to the user. | 06-17-2010 |
| 20100161670 | Method of Visual Addressing Commands in a Tree Structure - The invention is related to the field of computer science and can be used while entering and editing data. The technical result of the invention is speeding up the way the user works with data presented in the tree form. This result is obtained thanks to the possibility to move the caret within the tree structure display area and to treat commands entered by the user depending on the position of the caret. | 06-24-2010 |
| 20100161671 | System and method for generating hierarchical categories from collection of related terms - An apparatus, system, and method are disclosed for generating hierarchical categories from collection of related terms. The collection of terms and their interrelationships is accumulated and stored in a database module together with a communication history. An input/output (I/O) module communicates the interrelationships to a plurality of users. The users select and possibly rank hierarchical (parent-child) interrelationships. The I/O module receives selected interrelationships from the users. An integration module creates weighted directed graphs of terms and selected interrelationships according to an integration policy. A cycle-breaking module breaks any cycles in the graphs. A selection module creates a hierarchical structure by selecting one primary parent node (parent category) for each node (term) in the graphs. | 06-24-2010 |
| 20100169381 | EXPRESSION TREE DATA STRUCTURE FOR REPRESENTING A DATABASE QUERY - A method, apparatus and program product are provided for representing a database query expression including a plurality of predicates related to one another by at least one logical relation. A list of operands is generated from the database query expression, where each operand is representative of a predicate. Each operand is mapped into an operand map. A data structure is generated based upon the generated list of operands, where the data structure includes a plurality of nodes. Each node includes an operand identifier that identifies at least one operand based upon the operand map. Each node defines a first logical relation between those predicates in the database query expression that are represented by operands identified by the operand identifier for such node. The nodes are arranged relative to one another in the data structure to define at least a second logical relation among predicates in the database query expression. | 07-01-2010 |
| 20100191773 | System And Method For Providing Default Hierarchical Training For Social Indexing - A system and method for providing default hierarchical training for social indexing is provided. Articles of digital information for social indexing are maintained. A hierarchically-structured tree of topics is specified. Each topic includes a label that includes one or more words. Constraints inherent in the literal structure of the topic tree are identified. For each topic in the topic tree, a topic model that includes at least one term derived from the words in at least one of the labels is created. The topic models for the topic tree are evaluated against the constraints. Those of the topic models, which best satisfy the constraints are identified. | 07-29-2010 |
| 20100191774 | Method and system for versioned file system using structured data representations - A versioned file system comprises a set of structured data representations, such as XML. In a representative embodiment, at a first time, the interface creates and exports to the data store a first structured data representation corresponding to a first version of the local file system. The first structured data representation is an XML tree having a root element, one or more directory elements associated with the root element, and one or more file elements associated with a given directory element. Upon a change within the file system (e.g., file creation, file deletion, file modification, directory creation, directory deletion and directory modification), the interface creates and exports a second structured data representation corresponding to a second version of the file system. The second structured data representation differs from the first structured data representation up to and including the root element of the second structured data representation. The interface continues to generate and export the structured data representations to the data store, preferably at given “snapshot” times when changes within the file system have occurred. The data store preferably comprises one or more cloud storage service providers. As necessary, a given structured data representation is then used to retrieve an associated version of the file system. In this manner, the versioned file system only requires write-once behavior from the data store to preserve its complete state at any point-in-time. | 07-29-2010 |
| 20100191775 | ENUMERATION OF TREES FROM FINITE NUMBER OF NODES - Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. | 07-29-2010 |
| 20100198877 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR IMPORTANCE SAMPLING OF PARTITIONED DOMAINS - A system, method, and computer program product are provided for importance sampling of partitioned domains. In operation, a domain is partitioned into a plurality of sets. Additionally, a probability is assigned to each of the plurality of sets. Furthermore, samples are generated from the plurality of sets, the samples being generated according to the probability of a corresponding set. | 08-05-2010 |
| 20100198878 | Storage device and recording medium - There are provided a storage device and a computer-readable medium capable of efficiently storing keywords contained in description information and efficiently retrieving the keyword. A list producing portion ( | 08-05-2010 |
| 20100205218 | NAVIGATION DEVICE - A navigation device for a vehicle, in particular for a motor vehicle, has a hierarchical database containing a data tree with hierarchically arranged data and at least one geographic database containing data that are arranged in geographic subregions. A reference to at least one geographic database is provided in the hierarchical database. | 08-12-2010 |
| 20100205219 | METHOD AND SYSTEM FOR LOCATING A STEM OF A TARGET TREE - A method for locating a stem of a target tree is disclosed. The target tree is identified from a sensing dataset. At least one slice is created from the sensing dataset. The at least one slice includes at least a portion of the target tree. A tree stem location of the target tree is determined from the at least one slice. A system for locating a stem of a target tree is also disclosed. The system has a processor configured to implement the described method. The system also has a data input coupled to the processor and configured to provide the processor with the sensing dataset. The system further has a user interface coupled to either the processor or the data input. | 08-12-2010 |
| 20100205220 | METHOD OF DETERMINING INFLUENCE OF A MEMBER WITHIN A DATASET - A method of determining influence of a member within an overall dataset may include functions which capture, aggregate, analyze and visually present the relationships and influence that members of a dataset or collection, such as individual persons, websites, applications and/or machines, exercise over one another based on interaction, behavioral and demographic factors, etc. The calculated results of influence may be employed for the tracking of content and/or marketing, for example. | 08-12-2010 |
| 20100228783 | Desensitizing Character Strings - A method for desensitizing character strings comprises ordering an original set of character strings and generating a tree structure that has nodes corresponding to the ordered set of sensitive strings. The sensitive characters on the nodes of the tree are then desensitized in depth-first order such that a set of desensitized strings is generated that preserves the ordering of the original sensitive set. | 09-09-2010 |
| 20100250611 | Storing Hierarchical Data to Enable Paging - A method and apparatus for performing a paging operation on a tree having a plurality of nodes is provided. A preorder number and a subtree size are maintained in a machine-readable medium for each of the plurality of nodes of the tree. The preorder number associated with a particular node of the tree identifies a position for the particular node in a depth-first search ordering of the plurality of nodes of the tree. The subtree size associated with a particular node of the tree identifies a count of all the nodes in a subtree rooted at the particular node. In response to receiving a request to perform a paging operation on the plurality of nodes of the tree, a set of nodes that satisfy the paging operation may be determined using the preorder number and the subtree size associated with each node of the tree. | 09-30-2010 |
| 20100268743 | APPARATUS AND METHODS FOR TREE MANAGEMENT ASSIST CIRCUIT IN A STORAGE SYSTEM - Apparatus and methods for improved tree data structure management in a storage controller. A tree assist circuit coupled with a tree memory is provided for integration in a storage controller. I/O processors of the storage controller transmit requests to the tree assist circuit to create, modify, and access tree data structures stored in the tree memory. In one exemplary embodiment, the tree assist circuit is adapted to manage AVL trees. The tree data structures may be used by the I/O processors of the storage controller to manage region lock requests, cache-line lookup request, and other storage management functions of the controller. The I/O processors of the controller may comprise suitable programmed general-purpose processors and/or fast-path I/O request processor circuits. | 10-21-2010 |
| 20100281062 | Management apparatus, recording medium recording an information generation program , and information generating method - A management apparatus generates leaf page information including one or more records. The management apparatus generates root page information including falsification check information for checking falsification of child page information in position of a child of root page information or a record in position of a child of the root page information, and a serial number of the child page information in the position of the child of the root page information. The management apparatus also generates node page information including falsification check information for checking falsification of child page information in position of a child of node page information or a record in position of a child of the node page information positioned between the root page information and the leaf page information, and a serial number of the child page information in the position of the child of the node page information. The management apparatus stores the root page information, the node page information, and the leaf page information in the tree structure. | 11-04-2010 |
| 20100281063 | Distributed storage system, management apparatus, node apparatus, recording medium on which node program is recorded, page information acquisition method, recording medium on which page information sending program is recorded, and page information sending method - A node apparatus acquires root link information including a serial number of root page information, information for checking the root page information for tampering, and a digital signature for checking the root link information for tampering from a management apparatus or another node apparatus that stores the root link information through a network and determines a range of page information assigned to each node apparatus according to predetermined rules. The node apparatus determines whether page information that is a child of the root page information indicated by the acquired root link information is within the assigned range. If so, the node apparatus acquires the child page information and pieces of page information linked together from the child to leaf page information from the management apparatus or another node apparatus as page information assigned to the node apparatus and stores the acquired page information in a storage area. | 11-04-2010 |
| 20100281064 | HIERARCHY STRUCTURE DISPLAY DEVICE, HIERARCHY STRUCTURE DISPLAY METHOD AND HIERARCHY STRUCTURE DISPLAY CONTROL PROGRAM - This object aims to provide a technology for solving a problem so that the following link relations can be made clear even when a part of a region of a hierarchy structure is limited to display and nodes are arranged in the form in which unknown upper and lower relations of the hierarchy are entered in the displayed region. A tree display unit ( | 11-04-2010 |
| 20100299364 | WEB APPLICATION FOR DEBATE MAPS - A fully web-enabled software system for building, editing, evaluating, rendering, navigating and storing an integrate repository of debate in which schematic representations of individual debates are bound together to form an overarching repository of debate by a multiplicity of user-specified semantic cross-relationships that allow the emergence of clusters of related debates. The system is comprised of: A Application software that allows system users to build and edit debate maps made up of discrete elements representing entities such as issues or questions, claims, positions, and simple and compound arguments, scenarios and debate protagonists in accordance with a set of constraints herein termed a map grammar that ensure that such maps are constructed in accordance with sound argumentation principles, an in which the set of all such maps are stored in a single, unified data structure. B Application software that enables users of the system to create an additional layer of semantic cross-relationships between individual debate elements, or nodes, where such elements may be in the same debate map, or in different debate maps, thereby making possible the representation of relationships between debates as well as relationships within elements of single debate maps. | 11-25-2010 |
| 20100299365 | DATA CLASSIFICATION METHODS AND APPARATUS FOR USE WITH DATA FUSION - Methods and apparatus for classifying data for use in data fusion processes are disclosed. An example method of classifying data selectively groups nodes of a classification tree so that each node is assigned to only one of a plurality of groups and so that at least one of the groups includes at least two of the nodes. Data is classified based on the classification tree and the selective grouping of the nodes, and the results displayed. | 11-25-2010 |
| 20100325163 | MORPHED MUSICAL PIECE GENERATION SYSTEM AND MORPHED MUSICAL PIECE GENERATION PROGRAM - A morphed musical piece generation system that enables even a user with little knowledge of music to easily generate a morphed musical piece between two different musical pieces is provided. A first intermediate time-span tree data generation section | 12-23-2010 |
| 20100325164 | METHOD AND APPARATUS FOR CONCURRENT FILTERING OF MULTIPLE COMPONENTS OF STREAMING DATA - Content filtering of data containers of multiple content types is performed using multiple filtering modules operating concurrently. An apparatus for content filtering has a set of content-specific filtering modules and a network interface for parsing a received data container into components and directing each component to a respective filtering module. A filtering module edits a component of a specific content type according to respective rules. A multiplexer combines edited components produced by the set of filtering modules to form an edited data container. A root module applies a set of basic rules to a data container and any attachments. In an alternative configuration, the apparatus employs multiple filtering modules each applying rules for all content types. Received data containers are distributed among the filtering modules and an output module arranges edited data containers of a data stream in proper sequential order. | 12-23-2010 |
| 20100332546 | Structure Based Storage, Query, Update and Transfer of Tree-Based Documents - 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. | 12-30-2010 |
| 20110016152 | BLOCK-LEVEL DATA DE-DUPLICATION USING THINLY PROVISIONED DATA STORAGE VOLUMES - Data segments are logically organized in groups in a data repository. Each segment is stored at an index in the data repository. In association with a write request, a hash algorithm is applied to the data segment to generate a group identifier. Each group is identifiable by a corresponding group identifier. The group identifier is applied to a hash tree to determine whether a corresponding group in the data repository exists. Each existing group in the data repository corresponds to a leaf of the hash tree. If no corresponding group exists in the data repository, the data segment is stored in a new group in the data repository. However, if a corresponding group exists, the group is further searched to determine if a data segment matching the data segment to be stored is already stored. The data segment can be stored in accordance with the results of the search. | 01-20-2011 |
| 20110016153 | System and Method for Parallel Processing - A method for parallel processing of data organized in the form of a tree including: converting the tree into a linear array structure including a data array for storing the data of said tree and three reference arrays; determining partial workloads from the linear array structure obtained at step a; and performing parallel processing of said partial workloads. Each entry in the data array corresponding to a given node in the tree and includes three pointers. The pointers each point to a respective one of the reference arrays: a first pointer identifies the parent node of the given node, a second pointer identifies the first child node of the given node, and a third pointer identifies the sibling node of the given node. | 01-20-2011 |
| 20110022638 | Incremental Construction of Search Tree with Signature Pointers for Identification of Multimedia Content - Search tree structures with nodes that represent signatures derived from segments of video and audio content are used by systems to identify content and re-establish the correct alignment between video and audio content that have become disassociated with one another. The amount of storage needed to record data representing the tree structure can be reduced by replacing stored signature sets with signature pointers. The efficiency of searches in the tree structure can be improved by constructing and using partial tree structures. | 01-27-2011 |
| 20110022639 | Hierarchy Nodes Derived Based On Parent/Child Foreign Key And/Or Range Values On Parent Node - Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria. | 01-27-2011 |
| 20110029570 | SYSTEMS AND METHODS FOR CONTEXTUALIZED CACHING STRATEGIES - Systems, methods and devices for managing objects stored in memory are described. Information about the cached objects are stored in a tree structure that can be searched when a request for an object is made, in order to locate the object in memory. During or shortly after the search process, information about the search path through the tree is stored in a cache, and used to speed later searches for objects in memory. | 02-03-2011 |
| 20110035412 | SYSTEMS AND METHODS FOR MAINTAINING DISTRIBUTED DATA - Systems and methods are disclosed that provide an indexing data structure. In one embodiment, the indexing data structure is mirrored index tree where the copies of the nodes of the tree are stored across devices in a distributed system. In one embodiment, nodes that are stored on an offline device are restored, and an offline device that comes back online is merged into the distributed system and given access to the current indexing data structure. In one embodiment, the indexing data structure is traversed to locate and restore nodes that are stored on offline devices of the distributed system. | 02-10-2011 |
| 20110040797 | GEOGRAPHY BRICKS FOR DE-IDENTIFICATION OF HEALTHCARE DATA - Techniques of the described subject matter employ a break down algorithm in which a population of individuals is broken down into segments that have a greater number of individuals than a threshold minimum. Information on aggregated individuals may then be used to accomplish a variety of tasks, such as consumer purchasing preferences, market data analysis, sales force allocation, etc., without revealing the specific identity of any individuals or permitting others to determine, from the data, the identity of any individuals. | 02-17-2011 |
| 20110047185 | META-DATA INDEXING FOR XPATH LOCATION STEPS - In accordance with a method of encoding meta-data associated with tree-structured data, a first set of elements of a plurality of elements in the tree-structured is associated explicitly with explicit meta-data levels, and a second set of elements of the plurality of elements is associated by inheritance with explicit meta-data levels of closest ancestor elements of the first set of elements. The plurality of elements is packed into a plurality of leaf nodes of an index structure. The plurality of leaf nodes is merged into a plurality of non-leaf nodes until a root non-leaf node is generated. The plurality of non-leaf nodes of the index structure is associated with indicators representing ranges of the explicit meta-data levels in the packed first set of elements, such that explicit meta-data level ranges of descendant non-leaf nodes are subsets of explicit meta-data level ranges of ancestor non-leaf nodes. | 02-24-2011 |
| 20110060765 | ACCELERATED DRILL-THROUGH ON ASSOCIATION RULES - A method, system and computer program product for processing data relating to transactions that enables, for example, performing a Drill-Through on a given association rule for a large number of transactions in a short period of time. A Drill-Through (DT) Preparation, which generates the prefix tree and the transaction group information, and the DT Execution, which determines the transactions supporting an association rule, may be carried out in order to extract hidden information from input data. | 03-10-2011 |
| 20110078206 | TAGGING METHOD AND APPARATUS BASED ON STRUCTURED DATA SET - A tagging method and apparatus, including computer program products, based on a structured data set are provided, the tagging method comprising: creating classification models for respective nodes in the structured data set of an event; acquiring public opinions on the event; and tagging the opinions to corresponding nodes of the structured data set using the created classification models. The tagging method and apparatus of the present disclosure are able to provide well-ordered, focused public opinions for each event to users, and to exhibit the evolution of the public opinions along with time. | 03-31-2011 |
| 20110087704 | CUSTOMIZABLE LIBRARY FOR INFORMATION TECHNOLOGY DESIGN AND MANAGEMENT USING EXPERT KNOWLEDGE BASE - A system for providing a customized library platform of informational elements, each pertaining to one or more of information technology disciplines, includes a database of informational elements, and first computer-implemented user interfaces usable to provide the customization and a second user interface usable to view the customized library platform. The IT disciplines span design, analysis, modeling and management across a wide spectrum of IT functions and includes levels of detail and viewpoints that accommodate multiple roles across IT, from very senior executives to low level engineers and programmers. The knowledge base allows organizations to model their knowledge relationships to fit their structures, processes and guidelines, by using a provided framework as a starting point. The intelligent knowledge base emphasizes specific practices that enhance the linkage of business to IT, which is a widely recognized gap across IT creating massive waste and inefficiency. | 04-14-2011 |
| 20110099204 | FILE INPUT/OUTPUT SCHEDULER USING IMMEDIATE DATA CHUNKING - An input/output (I/O) method, system, and computer program product are disclosed. An incoming I/O request is received from an application running on a processor. A tree structure including processor-executable instructions defines one or more layers of processing associated with the I/O request. The instructions divide the data in the I/O request into one or more chunks at each of the one or more layers of processing. Each instruction has an associated data dependency to one or more corresponding instructions in a previous layer. The instructions are sorted into an order of processing by determining a location of each chunk and data dependencies between chunks of different layers of processing. One or more instructions are inserted into a schedule that depends at least partly on the order of processing. The I/O request is serviced by executing the instructions according to the schedule with the processor according to the order of processing. | 04-28-2011 |
| 20110099205 | INCREMENTAL CLUSTERING OF INDEXED XML DATA - In a data storage and retrieval system wherein data is stored and retrieved in pages, said data comprising connected nodes arranged such that each page stores only complete nodes, said connected nodes being connected via a plurality of overlapping tree structures, a method of minimizing page retrieval in the face of changing relationships between nodes comprising: selecting at least two of said overlapping tree structures; incrementally adjusting a page node structure dynamically based on real time workload, separately according to each selected tree structure, to form modified partitions for each tree structure, each modified partition being so as to minimize page faults; for each modified partition calculating a modification gain to indicate which partition has provided a greater minimization of page faults; and selecting the tree structure and modified partition corresponding to the best modification gain. | 04-28-2011 |
| 20110119311 | MAP DATA CREATING DEVICE AND MAP DRAWING DEVICE - A node thinning-out means | 05-19-2011 |
| 20110125803 | USABILITY EVALUATION APPARATUS, USABILITY EVALUATION METHOD, AND PROGRAM - A usability evaluation apparatus evaluates usability of evaluation objects by evaluation items ( | 05-26-2011 |
| 20110145295 | REPRESENTATION OF A SET OF NUMERIC VALUES IN A COMPUTERIZED ENVIRONMENT - A set of numeric values may be represented using a data structure. The data structure is a graph having a root and leaves. A route in the data structure may represent a mask that represents a set of values. A mask may represent a term in a DNF representation of numeric values. A mask may represent numeric values that correspond to limitations set by the mask, such as having a predetermined value in a predetermined digit. The data structure comprises edges and nodes, each may be associated with a label. The label may represent a portion of a mask. | 06-16-2011 |
| 20110153674 | DATA STORAGE INCLUDING STORING OF PAGE IDENTITY AND LOGICAL RELATIONSHIPS BETWEEN PAGES - Methods, systems, and computer-readable media of data storage that include storing page identities of individual pages and logical relationships between pages are disclosed. A particular system includes a plurality of data storage devices. A storage manager is configured to store data as pages at the data storage devices. Each page includes a page payload and a page identity. The storage manager is also configured to store one or more relationships indicating logical order between pages. | 06-23-2011 |
| 20110179085 | Using Node Identifiers In Materialized XML Views And Indexes To Directly Navigate To And Within XML Fragments - A method and apparatus is provided for efficiently searching and navigating XML data stored in a relational database. When storing a collection of XML documents, certain scalar elements may be shredded and stored in a relational table, whereas unstructured data may be stored as a CLOB or BLOB column. The approach includes identifying a reference address to within an XML tree index entry and storing the address in an xmltable index. The tree index entry allows for navigation in all axes. A path-based expression may be evaluated in the context of the reference address of the LOB. The result of the evaluation identifies another XML tree index entry containing a LOB locator used to retrieve the content from the document. The tree index, node index, and secondary function indexes are used together to enhance the performance of querying the XML data. | 07-21-2011 |
| 20110179086 | Systems And Methods For Rule Inheritance - Systems and methods for automating and increasing the efficiency of access to data using inheritance of access rules within an organization based upon the relationship of positions within the organization and the roles associated with the positions. In one embodiment, a role structure is used in conjunction with a hierarchical organization structure to allow access rules to be inherited by some of the positions from other positions based upon the relationship of positions within the organization and the roles associated with the positions. Access rules can be applied across equivalent or similar positions, yet differentiated between distinct portions of the organization and the distinct roles associated with the positions. Consequently, particular access rules are not necessarily inherited by all of the positions subordinate to a particular position with which the rule originates, and are not necessarily inherited by all of the positions that are associated with a particular role. | 07-21-2011 |
| 20110184992 | POSITIONING OF NON-CONSTRAINED AMOUNT OF DATA IN SEMBLANCE OF A TREE - 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. | 07-28-2011 |
| 20110191382 | SERIAL AND PARALLEL METHODS FOR I/O EFFICIENT SUFFIX TREE CONSTRUCTION - System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations. | 08-04-2011 |
| 20110191383 | ORCHESTRATION OF BUSINESS PROCESSES USING TEMPLATES - A distributed order orchestration system for orchestrating a business process of an order fulfillment system receives from an interface a definition of the business process and generates metadata from the definition. The system then generates an abstract syntax tree from the metadata. The tree includes a plurality of nodes and one or more of the nodes correspond to a predefined template. The system then generates executable orchestration code based on the abstract syntax tree and the predefined template. | 08-04-2011 |
| 20110202570 | Method for structuring hierarchical data in relational databases - In a method for structuring, in an ordered tree of predetermined depth P′, of data complying with predetermined criteria Fs and organized in a directed acyclic graph of depth P which comprises nodes and links between the nodes, the nodes and links stored by type in tables of a relational database which is queried by a query language from an application server connected to a user interface, the criteria Fs being determined on the nodes and/or the links, the method includes: creation of a “CACHE” table in the database; determination by the database of a set E; running of an iteration having an identifier id and/or properties; and transmission by the database to the application server of an end-of-process item of information with the number of nodes loaded into the “CACHE” table and of an identifier for access to the “CACHE” table. The iteration includes: determination by the database of the set S of children of the nodes of E complying with the criteria Fs; insertion by the database of the nodes of the set S and of their respective indices in the “CACHE” table; determination by the application server of criteria Fe as a function of the depth P′, of the identifier id and/or of properties of the iteration; determination by the database of the set E by applying the criteria Fe to all of the nodes in the “CACHE” table; and P′=P′−1. The iteration steps are repeated while P′>0 and S≠Ø. | 08-18-2011 |
| 20110202571 | METHOD AND DEVICE FOR STORAGE - A method and device for storage are provided in embodiments of the present invention. The method includes: acquiring a storage position of a table entry in a hierarchical binary tree that includes a first-part binary tree and second-part binary trees, wherein nodes of the first-part binary tree point to the second-part binary trees through pointers; and inserting the table entry to the hierarchical binary tree according to the storage position. In the embodiments of the present invention, the hierarchical binary tree structure with pointers is adopted to store table entry content, reducing the times of moving table entries and greatly improving the algorithm refresh rate. | 08-18-2011 |
| 20110219040 | DATA PACKAGING SYSTEM AND METHOD - A method for communicating data includes selecting a portion of data for communication to a remote computer with the data portion in device-dependent format and comprising at least an integer, a real number, or a binary value. A portable buffer is generated based on the selected data portion, the portable buffer comprising at least one device-independent data representation. The portable buffer is communicated to the remote computer for processing the data portion in a second device-dependent format. | 09-08-2011 |
| 20110246531 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROCESSING A PREFIX TREE FILE UTILIZING A SELECTED AGENT - A system, method, and computer program product are provided for processing a prefix tree file utilizing a selected agent. In use, a file including a prefix tree is identified. Additionally, an agent is selected from a plurality of agents to process the file. Further, the file is processed utilizing the agent. | 10-06-2011 |
| 20110252067 | INSERT OPTIMIZATION FOR B+ TREE DATA STRUCTURE SCALABILITY - A method, in one embodiment, can include receiving a key and associated data via a computing device. Furthermore, the method can include searching a B+ tree data structure using the key to find a leaf node. The B+ tree data structure is stored by a persistent storage coupled to the computing device. The B+ tree data structure can include a first plurality of nodes that each contains a key-value entry that is not maintained in a sorted order based on its key. In addition, the key and associated data are appended to the leaf node. A sector that includes the leaf node and the key and associated data can be flushed to the persistent storage. | 10-13-2011 |
| 20110252068 | CREATING EDIT SCRIPTS FOR CONVERSION OF DATA TABLES - Embodiments of the invention assist conversion of an old data table to a new data table in a communication terminal. An edit script is created by creating an old and new data trees from the old and new tables respectively. A first partial script which converts the old tree to an intermediate tree having the same length as the new tree is then determined. A second partial script which converts the intermediate tree to the new tree is also determined. The first and second partial scripts are then combined to provide a script which can be sent the terminal. The first partial script is preferably a minimum cost series of edits causing only insertions and deletions in the old data tree. The second partial script is preferably a minimum cost series of edits causing only substitutions in the intermediate tree. | 10-13-2011 |
| 20110264703 | Importing Tree Structure - A set of structured data may be stored using a format file and a data file. The format file may contain a hierarchical structure in the form of classes and relationships, while the data file may store the instances of the data in a serialized form. The format file may include projection types as well as repeating or nested types. The data file may contain instances of the structured data in the form of rows, with commas or other delimiters separating the data items. The structure of the data file may be created by traversing the format file to create a fully populated list of data items representing the structured data. An application may read the format file and data file to import complex data types and populate instances of those data types. | 10-27-2011 |
| 20110270889 | MULTIMEDIA GENERATOR - 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. | 11-03-2011 |
| 20110276603 | DEPENDENCY GRAPHS FOR MULTIPLE DOMAINS - 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. | 11-10-2011 |
| 20110302213 | STORAGE SYSTEM - 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. | 12-08-2011 |
| 20110320496 | CONCURRENCY CONTROL FOR CONFLUENT TREES - 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. | 12-29-2011 |
| 20110320497 | METHOD, PROGRAM, AND SYSTEM FOR DIVIDING TREE STRUCTURE OF STRUCTURED DOCUMENT - 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. | 12-29-2011 |
| 20110320498 | Systems and Methods for Optimizing Very Large N-Gram Collections for Speed and Memory - 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. | 12-29-2011 |
| 20110320499 | MANIPULATING SETS OF HEIRARCHICAL DATA - Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. | 12-29-2011 |
| 20120005233 | COMPUTER SYSTEM AND RECORDING MEDIUM - 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. | 01-05-2012 |
| 20120005234 | Storage medium, trie tree generation method, and trie tree generation device - 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. | 01-05-2012 |
| 20120005235 | METHOD FOR MANAGING A DIRECTORY, CONTROLLER, SYSTEM INCLUDING SERVERS, AND COMPUTER PROGRAM - In a method for managing a directory ( | 01-05-2012 |
| 20120030244 | SYSTEM AND METHOD FOR VISUALIZATION OF TAG METADATA ASSOCIATED WITH A MEDIA EVENT - 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. | 02-02-2012 |
| 20120036163 | DISTRIBUTED MULTIDIMENSIONAL RANGE SEARCH SYSTEM AND METHOD - 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. | 02-09-2012 |
| 20120047179 | SYSTEMS AND METHODS FOR STANDARDIZATION AND DE-DUPLICATION OF ADDRESSES USING TAXONOMY - Systems and associated methods for address standardization and applications related thereto are described. Embodiments exploit a common context in a taxonomy and a given address to detect and correct deviations in the address. Embodiments establish a possible path from a root of the taxonomy to a leaf in the taxonomy that can possibly generate a given address. Given a new address, embodiments use complete addresses, and/or segments or elements thereof, to compute the representations of the elements and find a closest matching leaf in the taxonomy. Embodiments then traverse the path to a root node to detect the agreement and disagreement between the path and the address entry. Taxonomical structured is thus used to detect, segregate and standardize the expected fields. | 02-23-2012 |
| 20120047180 | METHOD AND SYSTEM FOR PROCESSING A GROUP OF RESOURCE IDENTIFIERS - The present disclosure provides a computer-implemented method of processing a group of resource identifiers. The method includes generating a node candidate based on a resource identifier, wherein the node candidate includes a component corresponding to a portion of the resource identifier according to a dimension of specificity. The method also includes adding the lattice node candidate to a corpus lattice based on whether a matching corpus node corresponding to the node candidate is already included in the corpus lattice. The corpus lattice includes corpus nodes corresponding to a plurality of resource identifiers. The method also includes generating a pruned corpus lattice by a process that includes determining that a child node in the corpus lattice is compatible with a parent node of the child node and removing the child node from the corpus lattice. The method also includes generating an output file corresponding to the pruned URL lattice. | 02-23-2012 |
| 20120047181 | MULTIWAY TRIE DATA STRUCTURE THAT DYNAMICALLY ADJUSTS NODE SIZES IN A MANNER THAT REDUCES MEMORY FOOTPRINT AND IMPROVES ACCESS SPEED - A method, system and computer program product for dynamically adjusting node sizes in a multiway trie data structure. Upon inserting a key/value pair in a node in a multiway trie data structure that causes the number of entries in the multiway trie data structure to exceed a threshold, a splitting method is implemented. The splitting method involves doubling the width of the node in the multiway trie data structure thereby resizing the node in a resized multiway trie data structure. Furthermore, a sub-node of the original node may be split into two sections and stored in two child level nodes of the resized node under certain circumstances. Hence, only the original node and its direct successors are resized. Such a data structure outperforms hash tables by taking advantage of patterns found in the key distribution to optimize both storage requirements and access speed. | 02-23-2012 |
| 20120047182 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND STORAGE MEDIUM - An information processing apparatus comprises: a creation unit adapted to create a query string, which is composed of a plurality of queries; a reading unit adapted to read, from the query string, a query corresponding to a hierarchy of a current node in accordance with the hierarchy; a generation unit adapted to generate a plurality of nodes having a tree structure by dividing a learning pattern set in the current node in accordance with the read query corresponding to the hierarchy; and a modifying unit adapted to modify the tree structure by putting nodes in each hierarchy together into a common node with respect to nodes up to a hierarchy corresponding to a length of the query string among the nodes having the tree structure, which have been generated by the generation unit. | 02-23-2012 |
| 20120059857 | PRESENTATION OF DATA OBJECT HIERARCHIES - Systems and methods for use in presenting a hierarchy of data objects. Data objects in a hierarchy are each associated with a node type of a plurality of node types. A graphical representation of the hierarchy is created. The graphical representation includes including a plurality of strata corresponding to the plurality of node types. A plurality of tree nodes representing the data objects is created. Each tree node is associated with the node type that corresponds to the associated data object. The tree nodes associated with the node type that corresponds to the stratum are included in each stratum of the plurality of strata. The graphical representation may include hierarchical connectors extending between the tree nodes and representing hierarchical relationships between the data objects represented by the tree nodes. | 03-08-2012 |
| 20120059858 | MINIMAL REPRESENTATION OF CONNECTING WALKS - 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. | 03-08-2012 |
| 20120059859 | Data Extraction Method, Computer Program Product and System - Disclosed is a method of automatically extracting data from a target web page, comprising selecting ( | 03-08-2012 |
| 20120072462 | Processing of categorized product information - 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. | 03-22-2012 |
| 20120110025 | CODING ORDER-INDEPENDENT COLLECTIONS OF WORDS - In general, techniques are described for order-independent coding of a collection of words. An apparatus comprising a compression unit and an interface may implement the techniques. The compression unit constructs a digital search tree to store two or more words. A prefix of each of the words identifies a path from a root node to the node storing the corresponding word. A suffix of each of the words is stored in the node identified by the corresponding prefix. The compression unit traverses the digital search tree data structure, retrieving each of the suffixes in accordance with a defined order and encodes the suffixes. The compression unit encodes the digital search tree data structure in a manner that encodes an arrangement but not the placement of the nodes. The interface transmits the encoded digital search structure and the encoded suffixes in the defined order. | 05-03-2012 |
| 20120117122 | Optimized KD-Tree for Scalable Search - Techniques for constructing an optimized kd-tree are described. In an implementation, an optimized kd-tree process receives input of a set of data points applicable for large-scale computer vision applications. The process divides the set of the data points into subsets of data points with nodes while generating hyperplanes (e.g., coordinate axes). The process identifies a partition axis for each node based on the coordinate axes combined in a binary way. The optimized kd-tree process creates an optimized kd-tree that organizes the data points based on the identified partition axis. The organization of the data points in the optimized kd-tree provides efficient indexing and searching for a nearest neighbor. | 05-10-2012 |
| 20120117123 | ASSIGNING RESOURCES TO A BINARY TREE STRUCTURE - Embodiments of this disclosure relate to binary tree structures, and more specifically to assigning resources to a binary tree structure, such as for content protection. In embodiments, a total number of resources in a first category of resources is identified. The resources may be devices that play encryption protected content such as a CD, a DVD, an HD DVD, a BD, and a Secure Digital card, for example. In embodiments, a minimum number of dummy resources are assigned to a corresponding number of leaf nodes of the binary tree structure before resources in the first category of resources are assigned to leaf nodes in the binary tree structure. Generally, the minimum number of dummy resources is greater than or equal to 1+floor(2̂floor(log2(N)−1)), wherein N is greater than or equal to the total number of resources in the first category of resources. | 05-10-2012 |
| 20120117124 | INTERACTIVE RENDERING OF PHYSICAL ENTITIES - A method for generating a model of a physical entity, in particular the earth, using one or more hierarchically organized multi-resolutional data trees T, each data tree comprising a plurality of nodes N | 05-10-2012 |
| 20120131061 | PROVIDING ALTERNATIVES WITHIN A FAMILY TREE SYSTEMS AND METHODS - 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. | 05-24-2012 |
| 20120136901 | GENERATING A CHECKPOINT IMAGE FOR USE WITH AN IN-MEMORY DATABASE - Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system. | 05-31-2012 |
| 20120143920 | DYNAMICALLY WEIGHTED SEMANTIC TREES - Various embodiments of systems and methods for dynamically weighted semantic trees are described herein. One or more software elements of a hierarchy are identified in response to user actions in a report. The user actions are related to at least one software element of the one or more software elements of the hierarchy. A local tree is constructed for each user by assigning local weights for the one or more software elements based on user visits to the one or more software elements. A group tree is constructed for each group to which the users belong by assigning group weights for the one or more software elements based on the user visits to the one or more software elements. The local tree and the global tree are stored for use in various applications. | 06-07-2012 |
| 20120158789 | COMPUTER READABLE MEDIUM RECORDING PROGRAM, INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING SYSTEM, AND INFORMATION PROCESSING METHOD - An example computer | 06-21-2012 |
| 20120158790 | STRUCTURE BASED STORAGE, QUERY, UPDATE AND TRANSFER OF TREE-BASED DOCUMENTS - Data is represented as a tree structure. A structure identifier (ID) that mathematically defines a structure of the tree structure is calculated. The structure ID is a representation of the structure of the tree structure and is independent of node names and node values of the tree structure. A mapping of the structure ID to the tree structure is stored. | 06-21-2012 |
| 20120166489 | Presenting a Multidimensional Decision Table - A computer-implemented method for presenting a multidimensional decision table includes: receiving a decision table that defines columns as respective dimensions, each row having a value in only one of the columns, the decision table specifying results for respective value combinations in the dimensions; identifying each value in an innermost dimension of the decision table; and generating a table representation for the decision table that has a corresponding column for each of the dimensions except the innermost dimension, and a separate column for each of the identified values, wherein the separate columns include corresponding ones of the results. | 06-28-2012 |
| 20120166490 | GENERATING A CHECKPOINT IMAGE FOR USE WITH AN IN-MEMORY DATABASE - Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system. | 06-28-2012 |
| 20120173585 | OBTAINING HIERARCHICAL INFORMATION OF PLANAR DATA - The invention provides a method and apparatus for obtaining hierarchical information of planar data. The method comprises mapping at least one data item from a same data set in the planar data to at least one node in a tree structure formed by a structured terminology system. The method also comprises obtaining at least one sub tree structure in the tree structure, each of the at least one sub tree structure taking the at least one node as all of its leaf node. The method also comprises selecting a target tree structure from the at least one sub tree structure and obtaining hierarchical information in the target tree structure. An apparatus corresponding to the above method is also provided. With the above method and apparatus, hierarchical information of data items may be obtained from planar organized data to facilitate subsequent and further analysis and management. | 07-05-2012 |
| 20120173586 | Using Infeasible Nodes to Select Branching Variables - An optimization engine identifies an infeasible node in a tree data structure that corresponds to a programming model, and computes a fake objective value for the infeasible node. The optimization engine then updates a branching variable pseudocost using the fake objective value. Next, the optimization engine uses multiple branching variable pseudocosts corresponding to multiple branching variable candidates in order to select one of the branching variable candidates. In turn, the optimization engine branches to the corresponding branch of the selected branching variable. | 07-05-2012 |
| 20120179725 | UTILIZING REFERENCE/ID LINKING IN XML WRAPPER CODE GENERATION - Utilizing reference/identification (ID) linking in extensible markup language (XML) wrapper code generation in a data processing system. A code generator receives a type document and reference/ID constraints document and accesses the reference/ID constraints document to translate between XML structures and object structures. | 07-12-2012 |
| 20120191759 | METHOD AND DEVICE FOR CUSTOMIZING A MAIL HISTORY - A method for customizing a mail history including generating a mail tree composed of all received mails belonging to a same topic; receiving a user input indicating a mail to be replied to and a mail to be referred to which are selected by the user, the mail to be replied to and the mail to be referred to being located on different branches of the mail tree; acquiring a first plurality of mails on a first path from a root mail of the mail tree to a child mail of the mail to be replied to, and a second plurality of mails on a second path from the root mail to a child mail of the mail to be referred to; and merging the first plurality of mails and the second plurality of mails to generate a merging result as the mail history. | 07-26-2012 |
| 20120221604 | GENERATING AND NAVIGATING BINARY XML DATA - According to exemplary embodiments, a method and system for generating binary Extensible Markup Language (XML) data is provided. The generating includes acquiring an XML data source and generating a first child distance (FCD) token and a next sibling distance (NSD) token of an element node in the XML data source. The generating also includes generating binary XML data of the XML data source by using the FCD token and the NSD token, where the binary XML data includes the FCD token and the NSD token. | 08-30-2012 |
| 20120226716 | INFORMATION SOURCE ALIGNMENT - An information source alignment system may include a tree generation module executed by a computer system to generate a source category hierarchy tree for a source class in a first information source and a target category hierarchy tree for a target class in a second information source. The source and target category hierarchy trees may be constructed from a class hierarchy of a knowledge source. A class-similarity determination module may compare the source and target category hierarchy trees. An alignment module may determine whether the source and target classes are aligned based on the comparison of the source and target category hierarchy trees. | 09-06-2012 |
| 20120233219 | Multihierarchy Control - A system and a method for switching between a plurality of sets of objects, each mapped by a hierarchical structure, are provided. Relationships of the objects are presented in a tree structure. A transition point may be used to switch between the individual different trees which represent different inter-relationships of the objects. | 09-13-2012 |
| 20120239702 | STRING LOOKUP USING THREE-TRANSITION TREE STRUCTURE - A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index. | 09-20-2012 |
| 20120254251 | SYSTEMS AND METHODS FOR EFFICIENT TOP-k APPROXIMATE SUBTREE MATCHING - Systems and method for searching for approximate matches in a database of documents represented by a tree structure. A fast solution to the Top-k Approximate Subtree Matching Problem involves determining candidate subtrees which will be considered as possible matches to a query also represented by a tree structure. Once these candidate subtrees are found, a tree edit distance between each candidate subtree and the query tree is calculated. The results are then sorted to find those with the lowest tree edit distance. | 10-04-2012 |
| 20120254252 | INPUT/OUTPUT EFFICIENCY FOR ONLINE ANALYSIS PROCESSING IN A RELATIONAL DATABASE - Embodiments of the invention relate to improved input/output efficiency for online analysis processing in a relational database. An aspect of the invention includes selecting a table from a relational database. The table is split by column into sub-tables, with at least one of the sub-tables including at least two columns. Each sub-table is written into a corresponding table of a row-based storage database. | 10-04-2012 |
| 20120254253 | Disk-Resident Streaming Dictionary - A method, apparatus and computer program product for storing data in a disk storage system is presented. A dictionary data structure is defined and stored on the disk storage system. Key-value pairs can be inserted and deleted into the dictionary data structure, with full transactional semantics, at a rate that is faster than one insertion per disk-head movement. Keys can be looked up with only a logarithmic number of transfers, even for keys that have been recently inserted or deleted. Queries can be performed on ranges of key-value pairs, including recently inserted or deleted pairs, at a constant fraction of the bandwidth of the disk. The dictionary employs indirect logging for physical block logging. | 10-04-2012 |
| 20120271858 | Media Aware Distributed Data Layout - A storage system includes a plurality of vdisks, with each vdisk containing a plurality of storage segments, and each segment providing a specific class of service (CoS) for storage. Each vdisk stores files with data and meta data distributed among its storage segments. A storage system includes a memory having multiple classes of service. The system includes an interface for storing a file as blocks of data associated with a class of service in the memory. The interface chooses the class of service for a block on a block by block basis for storage. A file system for storing a file. A file system for storing includes a plurality of vdisks. A method for storing a file. | 10-25-2012 |
| 20120271859 | STORAGE DEVICE PRESENTING TO HOSTS ONLY FILES COMPATIBLE WITH A DEFINED HOST CAPABILITY - A method includes defining a host capability; creating for a storage device a second directory tree from a first directory tree of the storage device that is included in a file system within the storage device; and, for a data file that is stored in the storage device and is selectable for consumption by a host through the first directory tree that is included in the storage device's file system, determining whether the data file requires for consumption a host having the defined host capability. If the data file requires a host having the defined host capability, an entry is created in the second directory tree in which the data file is not selectable for consumption by the host. Otherwise, an entry is created in the second directory tree in which the data file is selectable for consumption by the host. | 10-25-2012 |
| 20120278364 | Automatically Modifying A Tree Structure - A method and system are provided to support automated modification to a multiple node tree structure. Each clause and each logical operator are defined in the tree structure as nodes. In addition, each link emanating from a child node to a parent node is defined as a child link, and each link emanating from a parent node to a child node is defined as a parent link. The selection and location of an operator for placement in the tree structure will be automated in response to the position selected. | 11-01-2012 |
| 20120303669 | Data Context Selection in Business Analytics Reports - A method for changing data context in a business analytics report is described herein. In one embodiment, such a method includes providing a business analytics report, wherein the report contains data and current metadata categories describing the data. The method enables selection of a current metadata category directly on the business analytics report. The method displays a metadata hierarchy associated with the current metadata category. This metadata hierarchy may include the current metadata category as well as related metadata categories arranged in a tree-like structure. The method further enables selection of a related metadata category from the metadata hierarchy to apply to the business analytics report. The method automatically updates the business analytics report with the metadata category and populates the report with the associated data. A corresponding computer program product and apparatus are also disclosed. | 11-29-2012 |
| 20120303670 | CLOUD COMPUTING METHOD FOR DYNAMICALLY SCALING A PROCESS ACROSS PHYSICAL MACHINE BOUNDARIES - 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. | 11-29-2012 |
| 20120303671 | STRUCTURE BASED STORAGE, QUERY, UPDATE AND TRANSFER OF TREE-BASED DOCUMENTS - A numeric structure identifier (ID) that represents a tree structure of a document that includes data is received. The numeric structure ID is calculated as a product of factors, each of a form of P raised to a power of m, where p is a prime number corresponding to a node ID of a node represented by the node ID and m is a number of children of the node represented by the node ID. A first numeric node ID that represents a first node of the tree structure of the document is received. The tree structure of the document corresponding to the numeric structure ID is identified. The data of the document is stored as the tree structure identifiable by the numeric structure ID. The first node within the tree structure corresponding to the first numeric node ID is identified. A value of the identified first node is returned. | 11-29-2012 |
| 20120317148 | SYSTEM AND METHOD TO REPRESENT THE GENEALOGY OF PHYSICAL AND ABSTRACT OBJECTS - The present invention relates to systems and methods for representing interrelated data objects in a database as a hierarchical rooted tree, and also involves a computer program for visualizing, creating, and modifying such trees. | 12-13-2012 |
| 20120331007 | Anchored Patterns - A method and apparatus relate to recognizing anchored patterns from an input stream. Patterns from a plurality of given patterns are marked as anchored patterns. An anchored state tree for the anchored patterns of the plurality of given patterns is built, including nodes representing a state of the anchored state tree. For each node of the anchored state tree, a failure value equivalent to a node representing a state in an unanchored state tree representing unanchored patterns of the plurality of given patterns is determined. | 12-27-2012 |
| 20130018922 | MEMORY EFFICIENT STATE-SET REPRESENTATION FOR PLANNINGAANM Schmidt; Tim C.AACI CampbellAAST CAAACO USAAGP Schmidt; Tim C. Campbell CA USAANM Zhou; RongAACI San JoseAAST CAAACO USAAGP Zhou; Rong San Jose CA US - A method for encoding state sets which encodes a binary prefix tree representation as a level ordered edge sequence (LOES) where the inner tree nodes are ordered from left to right, and top to bottom order and coded as bit pairs which represent the presence of leaf nodes. | 01-17-2013 |
| 20130031137 | DATA MANAGEMENT SYSTEM FOR EFFICIENT STORAGE AND RETRIEVAL OF MULTI-LEVEL/MULTI-DIMENSIONAL DATA - 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. | 01-31-2013 |
| 20130046792 | PRESERVING AND HANDLING NATIVE DATA IN HYBRID OBJECT TREES - A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object. | 02-21-2013 |
| 20130046793 | FAST MATCHING OF IMAGE FEATURES USING MULTI-DIMENSIONAL TREE DATA STRUCTURES - A method for generating a descriptor tree data structure is provided. A plurality of descriptors are obtained for one or more images, each descriptor defined within a multi-dimensional descriptor space. The plurality of descriptors are partitioned into nodes of a tree data structure, where the number of nodes in such partitioning is a function of the number of descriptors in the plurality of descriptors. The nodes having more than two descriptors may be sub-partitioned into sub-nodes of the tree data structure until two or fewer descriptors remain per sub-node, where such sub-partitioning is a function of the number of descriptors remaining in each such node and/or a dimensionality of such descriptors. | 02-21-2013 |
| 20130046794 | PRESERVING AND HANDLING NATIVE DATA IN HYBRID OBJECT TREES - A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object. | 02-21-2013 |
| 20130054652 | METHOD FOR EXPLORING A CATALOG OF DIGITAL INFORMATION CONTENTS - 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. The method includes: selecting a first sub-hierarchy of nodes of a first one of the at least two hierarchical tree structures, the first sub-hierarchy of nodes being built beginning from a selected category of the first hierarchical structure by selecting at least one among a first number of categories at immediately higher hierarchical levels in comparison to the selected category and a second number of categories at immediately lower hierarchical levels in comparison to the selected category; selecting a second sub-hierarchy of nodes of a second one of said at least two hierarchical tree structures, the second sub-hierarchy of nodes being built beginning from a destination category of the second hierarchical structure, the destination category being in relationship with the selected category, by selecting at least one among a first number of categories at immediately higher hierarchical levels in comparison to the destination category and a second number of categories at immediately lower hierarchical levels in comparison to the destination category; displaying on the screen icons representative of the categories of the first and of the second sub-hierarchy and respective relationships between the categories; and exploring the categories of the first and of the second sub-hierarchy reacting to commands imparted by the user through said user apparatus. | 02-28-2013 |
| 20130080473 | DISTRIBUTION OF KEY VALUES - A computer apparatus and related method to reduce database congestion is provided. In one aspect, the computer apparatus and method may generate a new partition within a hierarchical data structure of interlinked nodes, if a distribution of key values stored in the hierarchical data structure is skewed in favor of a range of key values. | 03-28-2013 |
| 20130080474 | ACCELERATING RECURSIVE QUERIES - A computer apparatus and related method to accelerate recursive queries is provided. In one aspect, a node located within a data structure may be accessed. The data structure may emulate a hierarchy of interlinked nodes. In another aspect, a series of bits may be generated that indicate a level of the node within the hierarchy and that outline a unique path of interlinked nodes toward the node. | 03-28-2013 |
| 20130086121 | PATH LOOKUP IN A HIERARCHICAL FILE SYSTEM - Apparatus and methods are provided herein for path lookup in a hierarchical file system. An inode associated with a requested object is identified. The inode may be organized in an inode table and identified in the table using an inode number. Ancestry information and size constraint information may also be available for the inode. An inode chain associated with the pathway is identified based, at least in part, on ancestry information associated with the inode for the requested object. A size constraint analysis is performed for the requested object. The size altering operation is selectively performed based on the size constraint analysis. | 04-04-2013 |
| 20130086122 | REMOTE HEALTH MONITORING SYSTEM - Health monitoring system comprising a patient side subsystem, a health care provider side subsystem, and a server station. The patient side subsystem is able to periodically receive and apply a monitoring profile comprising profile elements being connected to each other in a predetermined manner, the monitoring profile elements comprising patient related data, monitoring related data, evaluating process elements, wherein the monitoring profile elements are connected to each other to provide a multi-level tree structure consisting of at least two monitoring profile levels comprising a higher or top level and a lower or bottom level, wherein the monitoring profile elements are divided according to the tree structure of the multi level monitoring profile and a part of the monitoring profile elements is assigned to the top monitoring profile level and a part of the monitoring profile elements is assigned to the bottom monitoring profile level. | 04-04-2013 |
| 20130091174 | DATA DETECTION - An apparatus for processing a sequence of tokens to detect predetermined data, wherein each said token has a token type, and the predetermined data has a structure that comprises a predetermined sequence of token types, including at least one optional token type. The apparatus comprises a processor arranged to: provide a tree for detecting the predetermined data, the tree comprising a plurality of states, each said state being linked with at least one other state by a respective condition, the arrangement of linked states forming a plurality of paths; and compare the token types of the sequence of tokens to respective conditions in the tree to match the sequence of tokens to one or more paths in the tree, wherein the predetermined data can be detected without using an epsilon reduction to take account of said at least one optional token type. | 04-11-2013 |
| 20130097205 | Data Classification - The present disclosure provides a method and an apparatus for storing data classification structure. Based on an initial classification structure tree, a reorganized classification structure tree that stores data classifications structure differently from that of the initial classification structure is generated. As the reorganized classification structure tree is flexible, when maintaining data and searching data by using the search engine, the present techniques may quickly find the desired data, thereby reducing the heavy burden of the search engine under the conventional techniques to conduct data search and high pressure of conducting data maintenance and data search. Further, the present techniques may not only reduce the burden of the search engine, but also relieve the pressure for maintaining data and searching data. | 04-18-2013 |
| 20130124571 | KEYWORD ACQUIRING DEVICE, CONTENT PROVIDING SYSTEM, KEYWORD ACQUIRING METHOD, A COMPUTER-READABLE RECORDING MEDIUM AND CONTENT PROVIDING METHOD - A keyword related to a user's interest is acquired. A keyword acquiring device including a tree storage unit that stores a keyword tree obtained by performing hierarchization according to the number of appearances and relevance in advance using a keyword associated with content as a node records a keyword associated with content previously selected by a user as a log, extracts a plurality of keywords based on a predetermined condition from a log corresponding to a certain user recorded in the log, extracts a partial tree including the extracted keywords from the keyword tree, and acquires a keyword in a node having no other lower node as a keyword related to the user's interest. | 05-16-2013 |
| 20130138698 | IDENTITY INFORMATION DE-IDENTIFICATION DEVICE - De-identification device for automatically configuring a general hierarchy tree of attribute values of identity information. The provided de-identification device quantitatively evaluates the amount of information which is lost when generalizing an attribute value, and can thereby automatically assess priorities between de-identified data and between data that is being de-identified. Information of each person includes attribute values of the person for a plurality of attributes. De-identification is achieved by obfuscating the attribute values, and a structure in which attribute values to be obfuscated are expressed in a tree structure according to the level of obfuscation is called a general hierarchy tree. The disclosed identity information de-identification device achieves automatic configuration by configuring a tree using frequency information of attribute values. By defining a lost information amount metric means, using the general hierarchy tree, in formation amount loss between two de-identified data or between data being de-identified is quantitively assessed. | 05-30-2013 |
| 20130151564 | NAVIGATION OF HIERARCHICAL DATA USING CLIMB/DIVE AND SPIN INPUTS - A navigation mechanism for hierarchical data uses a climb/dive and rotate inputs to traverse a hierarchical dataset. The hierarchical dataset may be arranged in a filial-heir arrangement for easy traversal. The navigation mechanism may be used with several different ways of displaying the data, some of which may display both overall context and detailed view of the data. One such example may have a context section and a detail section, where the context section may present the overall context of a focus node in relation to the overall dataset and the detail section may display other nodes that are at the same or lower level than the focus node. | 06-13-2013 |
| 20130151565 | ARITHMETIC NODE ENCODING FOR TREE STRUCTURES - A computer-implemented method and system for encoding (and decoding) nodes of a tree structure are provided. The method includes receiving nodes of a tree structure into memory and, with a processor, for each node of at least one node in the tree structure, creating a numeric encoding by assigning an encoding value to the node, a root node N | 06-13-2013 |
| 20130151566 | ENUMERATION OF ROOTED PARTIAL SUBTREES - Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for enumerating rooted partial subtrees are disclosed. | 06-13-2013 |
| 20130166600 | Segment Matching Search System and Method - A planning and search system are described wherein a graph search and segment matching are used to handle very large searches at a higher speed. | 06-27-2013 |
| 20130173665 | SYSTEM AND METHOD FOR EFFICIENT REPRESENTATION OF DYNAMIC RANGES OF NUMERIC VALUES - Embodiments of the present invention describe using a data structure to represent variable domains in solving a constraint problem. The data structure includes nodes that are configured to represent ranges of values in order to save memory space and processor power. Ranges of values and single values may be both added to and removed from the data structure such that the data structure does not include duplicate values. Operations may include detecting multiple nodes with adjacent or overlapping ranges that may be combined into a single node, and adding or removing all the values in the structure that are beyond a threshold value. In one embodiment the data structure may be a balanced binary tree. Constraint solvers may either add values to the data structure as the values are eliminated from the solution, or they may remove those values. | 07-04-2013 |
| 20130179473 | HIGH-PERFORMANCE DATABASE ENGINE IMPLEMENTING A POSITIONAL DELTA TREE UPDATE SYSTEM - A computer system hosting a column-store database engine is responsive to database requests for the update and retrieval of data from within a stable data table and providing for the storage of database tuples within a column-store organized database structure. A positional delta tree data structure is implemented in the memory space of the database engine and is operatively coupled in an update data transfer path between a database engine interface and the stable data table. The positional delta tree data structure includes a differential data storage layer operative to store differential update data values in positionally defined relative reference to database tuples stored by the stable data table. | 07-11-2013 |
| 20130198239 | METHOD AND/OR SYSTEM FOR TRANSFORMING BETWEEN TREES AND ARRAYS - Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. | 08-01-2013 |
| 20130204902 | Enhanced B-Trees with Record Merging - In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time. | 08-08-2013 |
| 20130232173 | DATA DISPLAY DEVICE, DATA DISPLAY METHOD, AND PROGRAM PRODUCT - Displaying pieces of data includes displaying a tree structure on a display device, identifying, in response to a first node being selected from among nodes constituting the displayed tree structure, all nodes connected to the first node in a high-order direction and a low-order direction as a first node group, and identifying, in response to a second node being selected, the second node not being included in the first node group, all nodes connected to the second node in the high-order direction and the low-order direction as a second node group. The second node moves toward the first node according to an operation. A node not to be displayed is determined according to a rule and movement of the second node group. A display device is instructed to display the first node group and the second node group close to each other omitting display of the determined node. | 09-05-2013 |
| 20130238664 | LARGE-SCALE DATA PROCESSING SYSTEM, METHOD, AND NON-TRANSITORY TANGIBLE MACHINE-READABLE MEDIUM THEREOF - A large-scale data processing system, a large-scale data processing method, and a non-transitory tangible machine-readable medium are provided. The large-scale data processing system comprises an interface and a processor. The interface accesses a multi-dimensional data model, wherein the multi-dimensional data model comprises a plurality of dimensions, the dimensions form a multi-dimensional space of measures, each dimension is a single space comprising a plurality of members with a common set of attributes, and each measure is a data element organized and accessible through the multi-dimensional space of the cross-product of all dimensions. The processor builds at least one Tree Object (TO), wherein the TO is derived by converting the multi-dimensional data model into an N-level tree data structure according to a level order of N attributes, each tree node in the TO meets all conditions of attributes for all ancestor nodes, and N is a positive integer. | 09-12-2013 |
| 20130238665 | MANAGING RECORDS DISPLAYED IN A TREE LIST - A method is provided for managing the number of records displayed in a tree list | 09-12-2013 |
| 20130246480 | Computing Canonical Hierarchical Schemas - Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory. | 09-19-2013 |
| 20130254239 | Storage of a Document Using Multiple Representations - Some embodiments provide a method for storing a document. The method stores a content stream representation of the document that includes an ordered stream of code representations for primitive elements of the document. Each code representation of a primitive element has an index that indicates the order in the content stream of the primitive element representation. The method stores an object representation of the document that includes a set of object nodes arranged in a tree structure. Each object node references a range of indices in the content stream. | 09-26-2013 |
| 20130262517 | METHODS, APPARATUSES, AND COMPUTER PROGRAM PRODUCTS FOR IDENTIFYING FIELDS IN A DATA TREE - Methods, apparatuses, and computer program products are provided for an address system to identify a field and/or a row in a data structure. A method may include receiving a request to modify a field of data, wherein the field of data is identified by a received field key. A method may also include determining whether the field of data was rendered for display. A method may also include modifying the field in a tree structure in an instance in which the field of data was rendered for display, wherein the received field key is configured locate an address object that is related to the field. A method may also include modifying the field of data in a tree structure in an instance in which the field of data was not rendered for display by locating the received field key in a field key lookup map, wherein the field key lookup map is configured to locate the address object. | 10-03-2013 |
| 20130268563 | Fast and Robust Classification Algorithm for Vein Recognition Using Infrared Images - A specific item within an item class is identified by defining sets of descriptor data from a training library. The collected descriptor data is grouped and organized into a hierarchical tree, where each leaf node is defined by relations between corresponding parts of the descriptor data. Registrable sets of descriptor data are then identified from a collection of registrable samples. The registrable sets of descriptors are sorted into the hierarchical tree. When an input sample to be identified is received, a test set of descriptor data is generated from the input sample. The test set is then sorted into the hierarchical tree. Each leaf node that receives a part of the test set provides a vote for the registered samples it contains. The registered sample with the most votes is deemed a match for the input sample. | 10-10-2013 |
| 20130268564 | GENEALOGY INVESTIGATION AND DOCUMENTATION SYSTEMS AND METHODS - A method of creating a family tree includes receiving genealogy data from at least one primary source and creating one or more node records and one or more link records using the genealogy data. Individual node records may be compared to identity pairs of records having similar data. For each identified pair of individual node records, the method includes comparing related individual node records and deciding based on predetermined criteria whether the identified pair of individual node records represent the same person. The method also includes consolidating the information from a plurality of records determined to represent the same person into a single person record. | 10-10-2013 |
| 20130290375 | Dynamic Partitioning of a Data Structure - A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during, migration. | 10-31-2013 |
| 20130297657 | Apparatus and Method for Forming and Using a Tree Structured Database with Top-Down Trees and Bottom-Up Indices - A method for loading information into a tree structured database includes receiving a document and forming a top-down tree characterizing the document. Leaf nodes in the top-down tree are identified. Bottom-up indices are formed for the leaf nodes, where the bottom-up indices characterizes paths from selected leaf nodes to a root node of the top-down tree. The top-down tree and bottom-up indices are stored as separately searchable entities in the tree structured database. | 11-07-2013 |
| 20130297658 | METHOD AND SYSTEM FOR SYNCHRONIZING A VIRTUAL FILE SYSTEM AT A COMPUTING DEVICE WITH A STORAGE DEVICE - A method of resolving conflicts between revisions to a distributed virtual file system is implemented at a computing device that is communicatively connected to a plurality of storage devices. The virtual file system at the computing device has a first revision of the virtual file system. Upon receipt of a request to synchronize the first revision of the virtual file system with the storage devices, the computing device retrieves one or more blocks from the storage devices, which are associated with a second revision of the virtual file system. The computing device then merges a first component of the first revision with a corresponding component of the second revision if a first predefined condition is met or identifies a second component of the first revision as being conflicted with a corresponding component of the second revision if a second predefined set of conditions is met. | 11-07-2013 |
| 20130304766 | Categorical Filtering of Data - A computer readable storage medium includes executable instructions to retrieve a dataset from a data source, where the dataset includes a first set of categories. A data structure that represents the dataset is built. A first set of merit values for the first set of categories is calculated. The first set of categories is ordered based on a criterion. The first set of categories is returned. | 11-14-2013 |
| 20130318126 | TREE DATA STRUCTURE - A method of implementing a tree data structure comprises creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, and maintaining only one incoming pointer for each of the nodes in the tree data structure at all times. A tree data structure in which each node in the tree data structure has a single incoming pointer, and in which the tree data structure comprises a pointer directed to a local overflow node from a node at the same hierarchical level as the local overflow node. | 11-28-2013 |
| 20130325902 | PERSISTENT ITERATION OVER A DATABASE TREE STRUCTURE - Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node. | 12-05-2013 |
| 20130325903 | System and Method for Storing and Retrieving Geospatial Data - Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions. | 12-05-2013 |
| 20130339395 | PARALLEL OPERATION ON B+ TREES - Embodiments of techniques and systems for parallel processing of B+ trees are described. A parallel B+ tree processing module with partitioning and redistribution may include a set of threads executing a batch of B+ tree operations on a B+ tree in parallel. The batch of operations may be partitioned amongst the threads. Next, a search may be performed to determine which leaf nodes in the B+ tree are to be affected by which operations. Then, the threads may redistribute operations between each other such that multiple threads will not operate on the same leaf node. The threads may then perform B+ tree operations on the leaf nodes of the B+ tree in parallel. Subsequent modifications to nodes in the B+ may similarly be redistributed and performed in parallel as the threads work up the tree. | 12-19-2013 |
| 20130346451 | SYSTEM AND METHOD FOR COMPRESSED LEVEL-ORDERED EDGE SEQUENCE ENCODING - Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation. | 12-26-2013 |
| 20140006455 | ATTRIBUTE-BASED LINKED TRIES FOR RULE EVALUATION | 01-02-2014 |
| 20140006456 | ATTRIBUTE-BASED LINKED TRIES FOR RULE EVALUATION | 01-02-2014 |
| 20140006457 | CODE PROCESSING TECHNIQUE | 01-02-2014 |
| 20140019489 | Constructing Incremental Tree Model for Vein Image Recognition and Authentication - An indexed hierarchical tree search structure implements incremental tree modification to add new registrants to the tree without requiring reconstruction of the tree. Only data within a leaf node that receives new data is used in the incremental tree modification. Consequently, the original data set used in the creation of the hierarchical tree may be deleted after construction of the tree. | 01-16-2014 |
| 20140025708 | INDEXING HIERARCHICAL DATA - A system includes generation of an encoding for each of a hierarchy of nodes, each of the nodes associated with one or more attributes, and the encoding for each node including a first pointer and a second pointer, and generation of an order tree comprising a hierarchy of entries, where each pointer of the encoding points to a respective one of the entries, wherein the encoding and the order tree indicate a position of each node in the hierarchy of nodes. | 01-23-2014 |
| 20140032604 | PROPERTY OVERRIDES ON INCLUDED MATERIAL - In one example embodiment, a system and method is shown that includes identifying a host setting related to a property of a document data structure and a property of a fragment data structure, the document data structure reflecting an organization of a document, and the fragment data structure reflecting an organization of a portion of the document. Additionally, the system and method may include overriding the property of the fragment data structure using the property of the document data structure, if the host setting includes a command that the property of the fragment data structure is to be overridden by the property of the document data structure. | 01-30-2014 |
| 20140032605 | SELECTION OF DATA PATHS - Systems, methods, and computer-readable and executable instructions are provided for selecting data paths. Selecting data paths can include creating a support data tree structure from a number of data trees within a data set. In addition, selecting data paths can include removing a number of paths from the support data tree based on a number of evaluations of each of a number of nodes within the support data tree. Furthermore, selecting data paths can include selecting a desired set of paths based on a desired number of removed paths and an associated number of evaluations of the support data tree. | 01-30-2014 |
| 20140040317 | METHODS AND APPARATUSES FOR IMPROVING DATABASE SEARCH PERFORMANCE - Methods and apparatuses for improving performance of database searches are disclosed herein. For example, in some implementations, the methods and apparatuses use a data node structure that prevents the need to duplicate data nodes shared by a plurality of data trees. Additionally, the methods and apparatus facilitate improved database lookup times by implementing an adaptive presence detection system based on the Bloom Filter, performance characteristics of the computing device evaluated at run time and status of the database. | 02-06-2014 |
| 20140059082 | REPLACEMENT POLICY FOR RESOURCE CONTAINER - A system includes creation of a first resource queue indicating an order of resources stored in a memory, the order based on respective timestamps associated with the stored resources, association of the first resource queue with a first queue timestamp, reception of a first command to deallocate a first amount of stored resources from the memory, determination that a first stored resource indicated by the first resource queue is associated with a timestamp earlier than the first queue timestamp, deallocation of the first stored resource from the memory, reception of a second command to deallocate a second amount of stored resources from the memory, determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, and, in response to the determination that the first resource queue indicates no stored resources which are associated with a timestamp earlier than the first queue timestamp, creation of a second resource queue indicating a second order of second resources stored in the memory, the second order based on respective second timestamps associated with the stored second resources. | 02-27-2014 |
| 20140067870 | Prospective Search of Objects Using K-D Forest - In one embodiment, an object is stored in a k-dimensional forest that has a plurality of k-dimensional trees and each k-dimensional tree has a different size. If the smallest k-dimensional tree in the k-dimensional forest is not full, then the object is stored as a specific node in the smallest k-dimensional tree. Otherwise, a first k-dimensional tree in the k-dimensional forest is located, which is the smallest k-dimensional tree in the k-dimensional forest that is capable of storing the first object, objects in one or more second k-dimensional trees from the k-dimensional forest that are smaller than the first k-dimensional tree, and objects currently in the first k-dimensional tree. The object is stored as a specific node in the first k-dimensional tree. In addition, the objects in the second k-dimensional trees are moved and stored as specific nodes in the first k-dimensional tree. | 03-06-2014 |
| 20140067871 | DELEGATION OF EXPRESSION TREE EVALUATION - Evaluating an expression tree. A method includes, at a first domain, accessing an expression tree. The expression tree comprises a plurality of nested expressions. The plurality of nested expressions spans a plurality of domains. The expressions in the expression tree are expressed in a common format in spite of the different expressions of the expression tree being intended to be evaluated by different domains. At the first domain, the method includes evaluating one or more references to local variables included in the plurality of nested expressions. The method further includes determining that one or more expressions in the plurality of expressions are to be evaluated by a different domain. The method further includes expanding the one or more expressions in the plurality of expressions to be evaluated by different domains to allow the one or more expressions to be evaluated by the different domain. | 03-06-2014 |
| 20140067872 | TREE COMPARISON TO MANAGE PROGRESSIVE DATA STORE SWITCHOVER WITH ASSURED PERFORMANCE - Technologies are generally provided for progressive key value store switchover by evaluating a maturity of a migrated data store and allowing piecewise switching of substructure area query servicing from an origin data store to a destination data store. In some examples, abstractions of origin and destination tree structures may be compared to each other in order to generate an evaluation metric at substantially reduced performance evaluation load. The evaluation metric may target performance sampling while assuring a desired performance level with localized query servicing switchover. Piecewise data transfer may also be optionally enabled such that overall storage can be similar to the storage of a single data store copy while reducing an impact on existing data store services. | 03-06-2014 |
| 20140089350 | SYSTEMS AND METHODS FOR TABLES OF CONTENTS - To address problems related to use and formation of tables of contents, the present inventors, devised among other things, an exemplary table-of-contents (TOC) data structure and related systems and methods. One exemplary method entails associating a node from one TOC with a node of another TOC and then assigning a unique identifier to the associated pair of nodes. The unique identifier can then be used to logically define another TOC that includes portions of the two original TOCs. Another exemplary method entails tagging or associating nodes of a TOC with one or more view labels. (Identifiers for node relationships rather than the nodes themselves are tagged with the labels in some embodiments.) | 03-27-2014 |
| 20140095548 | INTERACTIVE VISUAL DATA MINING FOR INCREASING CLASSIFICATION ACCURACY - Visual data mining techniques for increasing data classification accuracy are disclosed. For example, a method comprises the following steps. At least two decision tree data structures from a high-dimensional data set are generated. A composite data structure comprising the at least two decision tree data structures is generated. The composite data structure is generated based on a correlation computed between the at least two decision tree data structures. The composite data structure is visualized on a display. Modification of the composite data structure is enabled via interaction with the visualization of the composite data structure on the display. | 04-03-2014 |
| 20140108463 | DATA STRUCTURE FOR EFFICIENTLY IDENTIFYING TRANSACTIONS - A technique for monitoring software which efficiently communicates transaction trace data, including static and dynamic data, from an agent to a manager is disclosed. A tree data structure describes transactions as a sequence of transaction elements. Each branch may correspond to one type of transaction. The nodes along a branch may be associated with components of monitored software that are invoked to perform the transaction. A provisional branch may be constructed when an agent is unable to initially identify the transaction. Transaction data may be stored in association with the nodes in the provisional branch during the monitoring. After information needed to identify the transaction becomes available to the agent, the provisional branch is updated. The transaction data is reported in response to determining the branch in the tree data structure that matches the provisional branch. | 04-17-2014 |
| 20140108464 | System and Method for Storing and Retrieving Geospatial Data - Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions. | 04-17-2014 |
| 20140115009 | Gathering Index Statistics Using Sampling - An approach is provided in which a sample point system allocates sample point identifiers to a root node included an index tree that includes multiple leaf nodes. The sample point system distributes the sample point identifiers to the root node's child nodes, and recursively traverses through the index tree's hierarchical index levels and distributes the sample point identifiers from the child nodes to a subset of the index tree's leaf nodes. In turn, the sample point system collects sample data from the subset of the plurality of leaf nodes corresponding to the distributed sample point identifiers. | 04-24-2014 |
| 20140122534 | TARGET TREE GENERATION - Target tree generation can include constructing a mapping file comprising a definition of a target tree and generating the target tree using source data and the mapping file. | 05-01-2014 |
| 20140129594 | BOUNDS FOR GRAPH BISECTION - Techniques are described for graph partitioning, and in particular, graph bisection. A combinatorial lower bound is provided that is computed in near-linear time. These bounds may be used to determine optimum solutions to real-world graphs with many vertices (e.g., more than a million for road networks, or tens of thousands for VLSI and mesh instances). Combinatorial techniques that reduce the size of the branch-and-bound search tree may use tree packing, assign vertices to trees, and use fractional assignment of vertices to trees. For graph bisection, each node of the branch-and-bound tree corresponds to a partial assignment of vertices to both cells or sets of vertices. | 05-08-2014 |
| 20140129595 | 2-DIMENSIONAL MULTI-HIERARCHY DISPLAY - Described herein is a technology for facilitating visualization of multiple hierarchies. In some implementations, a primary hierarchy having primary components arranged in different primary hierarchical levels is provided. A second hierarchy for the primary components of the primary hierarchy is provided. The primary components are configured as geometric objects with concentric zones corresponding to different secondary hierarchical levels with secondary components. | 05-08-2014 |
| 20140149464 | TREE TRAVERSAL IN A MEMORY DEVICE - Embodiments relate to tree traversal in a memory device. An aspect includes a method for tree traversal in a memory device. The method includes receiving a pointer to a tree structure within memory of the memory device. An evaluation condition is received to identify a desired node of the tree structure. The tree structure is traversed to identify the desired node. Data is returned from the desired node meeting the evaluation condition. | 05-29-2014 |
| 20140172919 | AUTOMATIC CORRELATION OF DYNAMIC SYSTEM EVENTS WITHIN COMPUTING DEVICES - Systems and methods are described herein for logging system events within an electronic machine using an event log structured as a collection of tree-like cause and effect graphs. An event to be logged may be received. A new event node may be created within the event log for the received event. One or more existing event nodes within the event log may be identified as having possibly caused the received event. One or more causal links may be created within the event log between the new event node and the one or more identified existing event nodes. The new event node may be stored as an unattached root node in response to not identifying an existing event node that may have caused the received event. | 06-19-2014 |
| 20140201243 | INTERACTIVE RENDERING OF PHYSICAL ENTITIES - A method for generating a model of a physical entity, in particular the earth, using one or more hierarchically organized multi-resolutional data trees T, each data tree comprising a plurality of nodes N | 07-17-2014 |
| 20140207825 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR EFFICIENT CACHING OF HIERARCHICAL ITEMS - Embodiments disclosed herein provide a “lazy” approach in caching a hierarchical navigation tree with one or more associated permission trees. In one embodiment, only a portion of a cached permission tree is updated. One embodiment of a method may comprise determining whether a dirty node exists by comparing tree timestamps of the permission tree and the master tree. If the tree timestamp of the master tree is temporally more recent than the tree timestamp of the permission tree, the permission tree has a dirty node and the method may operate to check node timestamps of the master and permission trees. This process may be repeated until the dirty node is found, at which time a portion of the permission tree associated with the dirty node may be reconstructed, rather than the entire permission tree itself, thereby eliminating or significantly reducing access time to the cached permission tree. | 07-24-2014 |
| 20140214899 | LEAF NAMES AND RELATIVE LEVEL INDICATIONS FOR FILE SYSTEM OBJECTS - In some implementations, a first data structure includes leaf names identifying file system objects, the first data structure not including information relating to file system paths of the respective file system objects. Indications of relative levels of the file system data objects are provided, where a given one of the indications specifies a level of the corresponding file system object relative to a previous file system object identified in the first data structure. | 07-31-2014 |
| 20140222870 | System, Method, Software, and Data Structure for Key-Value Mapping and Keys Sorting - A method of processing information in a database comprises providing a search expression comprising at least one character, the search expression represented by a key comprising a string of binary bit values and providing a Z-Tree comprising a plurality of key nodes each comprising a plurality of continuous bits and a key node pointer for pointing to a child node, and a plurality of branch nodes each comprising a first pointer representing zero in binary and a second pointer representing one in binary, the first pointer pointing to a left child node and the second pointer pointing to a right child node. The method includes passing the key through the Z-Tree and comparing the bit values of the key and bit values of the Z-Tree until reaching at least one of an end of the Z-Tree and an end of the key, according to an algorithm. | 08-07-2014 |
| 20140244693 | METHOD AND APPARATUS FOR STACK MANAGEMENT - 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. | 08-28-2014 |
| 20140244694 | NAVIGATION DEVICE HAVING NEXT VALID CHARACTER SEARCH TREE - 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. | 08-28-2014 |
| 20140258340 | SYSTEMS, METHODS, AND APPARATUS FOR PREFETCHING NODE DATA FOR LINKED DATA STRUCTURE TRAVERSAL - 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. | 09-11-2014 |
| 20140280357 | NSP Manager - 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. | 09-18-2014 |
| 20140289278 | ENUMERATION OF TREES FROM FINITE NUMBER OF NODES - Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. | 09-25-2014 |
| 20140289279 | METHOD AND/OR SYSTEM FOR MANIPULATING TREE EXPRESSIONS - Embodiments of methods and/or systems of manipulating tree expressions are disclosed. | 09-25-2014 |
| 20140289280 | System and Method for Bi-directional Conversion of Directed Acyclic Graphs and Inter-File Branching - 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. | 09-25-2014 |
| 20140304303 | SYNTAX-AWARE MANIPULATION OF MEDIA FILES IN A CONTAINER FORMAT - 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. | 10-09-2014 |
| 20140324914 | POSITION CODING BASED ON SPATIAL TREE WITH DUPLICATE POINTS - 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. | 10-30-2014 |
| 20140365529 | AGGLOMERATIVE TREELET RESTRUCTURING FOR BOUNDING VOLUME HIERARCHIES - A system, method, and computer program product are provided for modifying a hierarchical tree data structure. An initial hierarchical tree data structure is received, and treelets of node neighborhoods are formed. A processor restructures the treelets using agglomerative clustering to produce an optimized hierarchical tree data structure that includes at least one restructured treelet, where each restructured treelet includes at least one internal node. | 12-11-2014 |
| 20140365530 | SYSTEMS AND METHODS TO EDIT A HIERARCHICAL TREE STRUCTURE - Media items in a media library are organized into a hierarchical tree so that a particular media item can be found by referencing similar media items. The hierarchical tree has nodes that are the media items and each node further includes a prominence level that indicates a relative popularity of the media item. Systems and methods described herein allow a user to edit or modify the hierarchical tree by changing a position of a media item in the hierarchical tree or by changing a prominence level of the media item. If the edit or modification affects the integrity of the hierarchical tree, the hierarchical tree is automatically further modified to preserve the integrity while reflecting the edit or modification made by the user. | 12-11-2014 |
| 20150026216 | METHODS AND SYSTEMS FOR ENCODING THE MAXIMUM RESOLUTION DATA LEVEL FOR A QUADTREE - 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. | 01-22-2015 |
| 20150052174 | ADAPTIVE BINNING OF VERIFICATION DATA - Exemplary embodiments for adaptive binning of verification data comprise defining in a memory by at least one processor a data organization tree having a self-modifying bin structure that automatically modifies in response to input raw verification data; responsive to receiving a stream of verification data, identifying patterns in the verification data based on business knowledge of subcategories of the data; and using the data organization tree to automatically bin together the verification data that match the identified patterns to provide an aggregate view of the verification data. | 02-19-2015 |
| 20150066988 | SCALABLE PARALLEL SORTING ON MANYCORE-BASED COMPUTING SYSTEMS - Systems and methods for sorting data, including chunking unsorted data such that each chunk is of a size that fits within a last level cache of the system. One or more threads are instantiated in each physical core of the system, chunks assigned physical cores are distributed evenly across the threads on the physical cores. Subchunks in the physical cores are sorted using vector intrinsics, the subchunks being data assigned to the threads in the physical cores, and the subchunks are merged to generate sorted large chunks. A binary tree, which includes leaf nodes that correspond to the sorted large chunks, is built, leaf nodes are assigned to threads, and tree nodes are assigned to a circular buffer, wherein the circular buffer is lock and synchronization free. The large chunks are sorted to generate sorted data as output. | 03-05-2015 |
| 20150113023 | WEB APPLICATION FOR DEBATE MAPS - A fully web-enabled software system for building, editing, evaluating, rendering, navigating and storing an integrated repository of debate in which schematic representations of individual debates are bound together to form an over-arching repository of debate by a multiplicity of user-specified semantic cross-relationships that allow the emergence of clusters of related debates. The system is comprised of:
| 04-23-2015 |
| 20150293958 | SCALABLE DATA STRUCTURES - The technology is directed to providing sequential access to data using scalable data structures. In some embodiments, the scalable data structures include a first data structure, e.g., hash map, and a second data structure, e.g., tree data structure (“tree”). The technology receives multiple key-value pairs representing data associated with an application. A key includes a prefix and a suffix. While the suffixes of the keys are distinct, some of the keys can have the same prefix. The technology stores the keys having the same prefix in a tree, and stores the root node of the tree in the first data structure. To retrieve values of a set of input keys with a given prefix, the technology retrieves a root node of a tree corresponding to the given prefix from the first data structure using the given prefix, and traverses the tree to obtain the values in a sequence. | 10-15-2015 |
| 20150310046 | SCALABLE VISUALIZATION OF A PRODUCT AND ITS VARIANTS - A method for generating a scalable visualization of a hierarchical data structure is provided. The method may include mapping at least one component within a plurality of components to the hierarchical data structure. The method may also include mapping at least one sub-component within a plurality of sub-components to the at least one mapped component. The method may further include mapping at least one variant within a plurality of variants to the hierarchical data structure as an accordion user interface widget. Additionally, the method may include mapping at least one variant component within a plurality of variant components to the at least one mapped variant as an accordion user interface widget. The method may also include mapping at least one variant sub-component within a plurality of variant sub-components to the at least one mapped variant component as an accordion user interface widget. | 10-29-2015 |
| 20150317344 | METHOD AND APPARATUS FOR PREDICTING OBJECT PROPERTIES USING SIMILARITY BASED INFORMATION RETRIEVAL AND MODELING - Method and apparatus for predicting properties of a target object comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic and thermal spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods. By way of example, an evidence tree display showing a target object linked by a pathway to a predicted property comprises a similarity value, a speculation value and a model-based rank. | 11-05-2015 |
| 20160012110 | GENERAL AND AUTOMATIC APPROACH TO INCREMENTALLY COMPUTING SLIDING WINDOW AGGREGATES IN STREAMING APPLICATIONS | 01-14-2016 |
| 20160034509 | 3D ANALYTICS - Herein is disclosed an ontology solution that may incorporate four main stages, including training, ontology administration, ontology tagging, and ontology analytics. The training step involves internal machine learning in which the system learns the customer's specific domain. An initial ontology is passed to the ontology administration step where a user reviews the initial ontology and refines it to create a refined ontology. The refined ontology is then stored and passed to the tagging module. Tagging is a continuous online process that uses the ontology to tag tracked items in incoming interactions, and stores the tagged interactions in a persistent repository. Finally the tagged interactions are then used by the analytics module to analyze and extract business data based on an enhanced formulization of a company's internal knowledge and terminology. | 02-04-2016 |
| 20160034599 | Automatically Modifying A Tree Structure - A method and system are provided to support automated modification to a multiple node tree structure. Each clause and each logical operator are defined in the tree structure as nodes. In addition, each link emanating from a child node to a parent node is defined as a child link, and each link emanating from a parent node to a child node is defined as a parent link. The selection and location of an operator for placement in the tree structure will be automated in response to the position selected. | 02-04-2016 |
| 20160042003 | ENHANCED INTERNALLY LINKED ELECTRONIC PAPER FORMAT REPORT GENERATION SYSTEM AND PROCESS - The present invention is directed to a system and process for electronic paper file generation from a report format and metafile such that a user may readily navigate the report objects within an enhanced electronic paper file. An electronic paper file is created based on a selected data source and report format. The initial electronic paper file is parsed and a metafile including identifier and position information for report objects contained therein is created. The metafile is parsed to generate the relationships between the report objects and a data tree representing the relationships is created. The relationship information is parsed and internal links to related report objects are created, facilitating navigation among the report objects. | 02-11-2016 |
| 20160063043 | Versatile Data Model - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for processing a data model, a data file and user input to provide a populated data model, the populated data model including: a data content table having one or more navigation columns and one or more content columns, at least one navigation column including one or more key values of a key node, and at least one content column including data values of a plurality of data values, and a foreign key table having one or more navigation columns and one or more relationship columns, at least one navigation column including one or more key values of a foreign key node, and the one or more relationship columns associating at least one key node of the data content table to a respective foreign key node. | 03-03-2016 |
| 20160070820 | SHORT STACK TRAVERSAL OF TREE DATA STRUCTURES - A system, computer readable medium, and method are disclosed for performing a tree traversal operation utilizing a short stack data structure. The method includes the steps of executing, via a processor, a tree traversal operation for a tree data structure utilizing a short stack data structure, determining that the short stack data structure is empty after testing a current node in the tree traversal operation, and executing, via the processor, a back-tracking operation for the current node to identify a new node in the tree data structure to continue the tree traversal operation. The processor may be a parallel processing unit that includes one or more tree traversal units, which implement the tree traversal operation in hardware, software, or a combination of hardware and software. | 03-10-2016 |
| 20160098419 | AUTOMATIC CORRELATION OF DYNAMIC SYSTEM EVENTS WITHIN COMPUTING DEVICES - Systems and methods are described herein for logging system events within an electronic machine using an event log structured as a collection of tree-like cause and effect graphs. An event to be logged may be received. A new event node may be created within the event log for the received event. One or more existing event nodes within the event log may be identified as having possibly caused the received event. One or more causal links may be created within the event log between the new event node and the one or more identified existing event nodes. The new event node may be stored as an unattached root node in response to not identifying an existing event node that may have caused the received event. | 04-07-2016 |
| 20160098434 | HARDWARE ACCELERATOR FOR HANDLING RED-BLACK TREES - A hardware accelerator for handling red-black trees, each node of a tree including a binary color indicator, a key and the addresses of a parent node and two children nodes, the accelerator including at least two registers termed node registers, capable of storing the set of data fields of two nodes of a tree; and logic units configured for receiving from a processor at least one input data item selected from an address of a tree node and a reference key, as well as at least one instruction to be executed; for executing the instruction by combining elementary instructions on the data stored in the node registers and for supplying to the processor at least one output data item including an address of a node. A processor and computer system including such a hardware accelerator is provided. | 04-07-2016 |
| 20160103858 | DATA MANAGEMENT SYSTEM COMPRISING A TRIE DATA STRUCTURE, INTEGRATED CIRCUITS AND METHODS THEREFOR - A data management system comprises a trie data structure. The trie data structure comprises a plurality of interconnected nodes wherein at least a portion of said plurality of interconnected nodes is configured as parent nodes and child nodes, wherein at least one child node comprises an identifier of its parent node. | 04-14-2016 |
| 20160110392 | DENSE TREE VOLUME METADATA ORGANIZATION - The embodiments described herein are directed to an organization of metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata managed by the volume layer, i.e., the volume metadata, is illustratively embodied as mappings from addresses, i.e., logical block addresses (LBAs), of a logical unit (LUN) accessible by a host to durable extent keys maintained by an extent store layer of the storage I/O stack. In an embodiment, the volume layer organizes the volume metadata as a mapping data structure, i.e., a dense tree metadata structure, which represents successive points in time to enable efficient access to the metadata. | 04-21-2016 |
| 20160117317 | SYSTEMS AND METHODS FOR PROVIDING CAX DATA - A computer-implemented method for providing CAx data may include (1) storing a model of an engineering object as a group of nodes including one or more feature nodes, (2) associating a corresponding transaction history with each feature node, the transaction history indicating one or more states for a feature over time, and (3) determining a state of a selected feature node at a selected point in time by accessing the corresponding transaction history of the selected feature node. Various other methods and systems are also disclosed. | 04-28-2016 |
| 20160117352 | APPARATUS AND METHOD FOR SUPPORTING VISUALIZATION OF CONNECTION RELATIONSHIP - In a search server, a page collection unit collects Internet pages. An index generation unit generates an index of the pages. An index-tree generation unit generates an index tree representing the connection relationship among the pages in a tree structure, and in which a page linked from multiple pages is represented by different nodes in a duplicated manner. When a search word input unit inputs a search word in a client, a search-result generation unit of the search server generates a search result on the basis of the index. For the index tree, a search-result-tree generation unit, for example, highlights nodes containing the search word, and deletes nodes, each of which does not contain the search word and is not a branch point into multiple branches which contain the search word. The search-result-tree generation unit outputs the resulting search result to a search result display unit of the client. | 04-28-2016 |
| 20160117353 | MANIPULATION AND/OR ANALYSIS OF HIERARCHICAL DATA - Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed. | 04-28-2016 |
| 20160162527 | AUTOMATIC DISCOVERY OF CODE AND DATA STORES THAT POPULATE A USER INTERFACE ELEMENT - Automatically discovering application components that populate a user interface element may be provided. A directed graph may be built from an application code implementing a backend layer of an application. A code element in the application code may be identified that matches an input element of a user interface of the application. A data store element of a data store implementing data layer of the application may be identified that matches the input element. For the input element, a map of trees may be built tracing through the directed graph based on the code element and the data store element that are identified. The map of trees may be grouped based on at least matching of annotations of the trees in the map, a similarity of begin and end points of the trees in the map and matching of the end points of the trees in the map. | 06-09-2016 |
| 20160162528 | MANIPULATING SETS OF HIERARCHICAL DATA - Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. | 06-09-2016 |
| 20160171081 | DATA CLASSIFICATION | 06-16-2016 |
| 20160203214 | IMAGE SEARCH RESULT NAVIGATION WITH ONTOLOGY TREE | 07-14-2016 |
| 20160253366 | ANALYZING A PARALLEL DATA STREAM USING A SLIDING FREQUENT PATTERN TREE | 09-01-2016 |
| 20160378798 | AGGREGATING AND SUMMARIZING SEQUENCES OF HIERARCHICAL RECORDS - Sequences of hierarchical records are aggregated and summarized. A capture log that includes a plurality of operations of a workload is received. A first data structure that models transaction types as sequences of nodes is created. The nodes identify operations in the workload. A present operation and a transaction identifier are read from the capture log. The transaction identifier is dissociated from a first node that identifies a prior operation. The transaction identifier is associated with a second node that identifies the present operation. In a second data structure that associates nodes with transaction identifiers, the first node is dissociated from the transaction identifier and the second node is associated with the transaction identifier. A summary of the workload is generated based, at least in part, on the first and second data structures. The summary includes signatures of transaction types and counts of instances of the transaction types. | 12-29-2016 |
