Trees (epo) Patents (Class 707/E17.012)
-
Publication number: 20090132555Abstract: A method is disclosed for facilitating visualisation of status data in an electronic system. The status data comprises metadata including a plurality of information context categories. The status data also comprises data nodes, each data node including specific instances of a respective context category. The method starts with selecting possible data combinations and permutations of the information context categories, each permutation defining a respective hierarchy. For each permutation, information content of data for each node of the respective hierarchy is estimated and an informative tree and total entropy for all informative nodes are found. The permutation and the informative tree that has the lowest total entropy are then presented to the user.Type: ApplicationFiled: November 15, 2007Publication date: May 21, 2009Inventors: Raghavendra Singh, Anindya Neogi, Bharat Krishnamurthy, Ravi Kothari
-
Publication number: 20090094273Abstract: In order to provide a technique that allows to efficiently check validation of a structured document using single schema data corresponding to structured documents of different versions, a document verification apparatus, which includes a storage unit that stores single schema data corresponding to structured documents of different versions, and checks validation of structured document data using the single schema data, includes an input unit which inputs structured document data, a version determination unit which determines a version of the input structured document data, and a generation unit which reads out the single schema data from the storage unit, and generates a DOM tree of a schema corresponding to the determined version, and a verification unit which executes validation checking of the structured document based on the generated DOM tree.Type: ApplicationFiled: October 3, 2008Publication date: April 9, 2009Applicant: CANON KABUSHIKI KAISHAInventor: Hitoshi Uchida
-
Publication number: 20090077123Abstract: A method, data processing system and computer program product for maintaining/updating managing keyboard navigation using a linked list. In particular, a Dynamic Tree Control Linkage (DTCL) utility creates a doubly linked list with list nodes having assigned values based on a tree control structure UI component. Each list node of the doubly linked list corresponds to a visible tree item of the tree structure UI component. Responding to a keyboard event signal, the DTCL utility finds a current list node corresponding to a first current tree item. The DTCL utility finds a next (i.e. previous or subsequent) list node corresponding to a next tree item. The DTCL utility detects a list node exists. The DTCL utility detects whether the next list node is associated with a null value. When the next list node is associated with a non-null value, the next tree item is identified. The DTCL utility returns an identification of the next tree item representing a second current tree item.Type: ApplicationFiled: September 14, 2007Publication date: March 19, 2009Inventors: BECKY J. GIBSON, Daniel A. Gisolfi, Laurent Hasson, Mark A. Pilgrim
-
Publication number: 20090070368Abstract: Methods and apparatus for information modeling, such as product modeling, are described. In one specific embodiment, a system for capturing product information includes a product definition tree representing permitted elements of a generalized product structure, a plurality of template trees and a plurality of configuration trees. Each template tree represents a product design structure variant which represents a subset of said product definition tree. Each configuration tree represents a particular design configuration, which is constrained to implement the structure of its associated template tree.Type: ApplicationFiled: November 7, 2008Publication date: March 12, 2009Inventor: Sean M. Callahan
-
Patent number: 7499915Abstract: Techniques are provided for indexing XML documents. According to one embodiment, a PATH table created for storing one row for each indexed node of the XML documents. The PATH table row for a node includes (1) information for locating the XML document that contains the node, (2) information that identifies the path of the node, and (3) information that identifies the position of the node within the hierarchical structure of the XML document that contains the node. If the node is associated with the value, then the PATH table row for the node may also include the value. Use of the PATH table to answer XPath queries is facilitated by secondary indexes.Type: GrantFiled: July 2, 2004Date of Patent: March 3, 2009Assignee: Oracle International CorporationInventors: Sivasankaran Chandrasekar, Ravi Murthy, Ashish Thusoo, Anh-Tuan Tran, Sreedhar Mukkamalla, Eric Sedlar, Nipun Agarwal
-
Publication number: 20090024619Abstract: A method for processing video data involves receiving data from a series of images and analyzing the data to identify geometric forms. The forms are stored as metadata of a first data level and are linked by time stamps to the images in which the forms were identified. The metadata from an image and the previous image are compared, and delta metadata is generated from the difference. Delta metadata is also marked with time stamps. Metadata and delta metadata are analyzed, and objects are extracted from the geometric forms. The objects are stored as time-stamped metadata and delta metadata of a second data level. The process is repeated for higher data levels. A user inputs a database query to identify from among the stored input images that particular image sequence in which the extracted object is recorded. Queries started at higher data levels are quicker but less accurate.Type: ApplicationFiled: July 18, 2008Publication date: January 22, 2009Inventors: Dieter Dallmeier, Hans-Dieter Schramm, Ben Michael Schmidt
-
Publication number: 20090006460Abstract: According to exemplary embodiments of the present invention, system, computer-accessible medium and method of organizing or analyzing at least two sets of data can be provided. For example, at least two sets of data may be organized or analyzed by generating a data structure for the at least two sets of the data and comparing the data structure for the at least two sets of the data. The data structure may be in the form of a phylogenetic-type tree.Type: ApplicationFiled: May 21, 2008Publication date: January 1, 2009Applicant: New York UniverstiyInventors: Samantha Kleinberg, Bhubaneswar Mishra
-
Publication number: 20080319957Abstract: Systems and methods that provide for a canonical representation in a structured form of a query, against a data model platform. A parser component can parse the SQL query to generate the abstract class that represent the query (command tree). Moreover, a view generation component can supply a mapping between a rich structure (e.g., on the client side) and the relational side. Accordingly, a query can be represented by an abstract class in form of a tree structure with nodes, which has metadata tied therewith.Type: ApplicationFiled: June 19, 2007Publication date: December 25, 2008Applicant: MICROSOFT CORPORATIONInventors: Subramanian Muralidhar, Simon Cavanagh, Steve Starck, Sean B. House, Fabio Meireles Fernandez Valbuena, Katica Iceva, Ramesh Nagarajan
-
Publication number: 20080313211Abstract: Data having express or implied relationships may be displayed by selecting a starting entity in a data structure, building a relationship tree, and building and optimizing a relationship matrix based on the relationship tree. The optimized relationship matrix may be used to layout and render a graphical image that positions various elements with respect to the starting entity based on the relationships. The distance matrix may be optimized by creating a first distance matrix based on the relationship tree, developing a dissimilarity matrix based on expressed or implied relationships, and multiplying the dissimilarity matrix by a weighting factor to determine a distance matrix that may be optimized by multi-dimensional scaling. An optimized weighting factor may be determined and used to select an optimized distance matrix.Type: ApplicationFiled: June 18, 2007Publication date: December 18, 2008Applicant: MICROSOFT CORPORATIONInventors: Yingnong Dang, Xu Yang, Dongmei Zhang, Min Wang, Jian Wang
-
Publication number: 20080306945Abstract: Example-driven creation of record matching queries. The disclosed architecture employs techniques that exploit the availability of positive (or matching) and negative (non-matching) examples to search through this space and suggest an initial record matching query. The record matching task is modeled as that of designing an operator tree obtained by composing a few primitive operators. This ensures that record matching programs be executable efficiently and scalably over large input relations. The architecture joins records across multiple (e.g., two) relations (e.g., R and S). The architecture exploits the monotonicity property of similarity functions for record matching in the relations, in that, any pair of matching records have a higher similarity value than non-matching record pairs on at least one similarity function.Type: ApplicationFiled: June 5, 2007Publication date: December 11, 2008Applicant: MICROSOFT CORPORATIONInventors: Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti, Shriraghav Kaushik
-
Publication number: 20080281860Abstract: Systems and methods are provided for analyzing documents. In one implementation, a computer implemented method is provided for analyzing a patent application and providing a visual representation. According to the method, a selection is received from a user to view claims of the patent application in a claim tree hierarchy and a computer displays the claims in the claim tree hierarchy on a display. The claim tree hierarchy visually depicts relationships between the claims. The method identifies one or more words of at least one of the claims that constitutes an element and displays, in the claim tree hierarchy, the words constituting the element in association with the claim.Type: ApplicationFiled: May 8, 2008Publication date: November 13, 2008Inventors: Brian K. Elias, Matthew C. Morrise, Om Chauhan, Ningjun Wang
-
Publication number: 20080270381Abstract: Described are a system and method of performing an electronic search for information objects stored in a plurality of data stores. A look-up is performed of a metadata model for instances of metadata that satisfy a criterion related to a received text string. A catalog of catalog items is provided. Each catalog item is linked to one or more instances of metadata in the metadata model and is uniquely associated with an information object stored in the data stores. The catalog is searched in real time to find one or more catalog items that are linked to one or more instances of metadata found in the look-up of the metadata model. Each information object associated with a catalog item found in the search of the catalog is listed in real time.Type: ApplicationFiled: November 6, 2007Publication date: October 30, 2008Applicant: INTERSE A/SInventor: Dan Thomsen
-
Publication number: 20080270432Abstract: A method for retrieving a desired postal address from a plurality of postal addresses. The invention can feature receiving input data having input terms for finding the desired postal address from a first database of postal addresses where each postal address is formed of a plurality of postal address elements, searching a dictionary for entries in the dictionary corresponding to the input terms, determining that each entry in the dictionary that corresponds to the input terms corresponds to postal address elements of one or more postal addresses in the first database, and outputting data representing the desired postal address. The desired postal address is found in the first database if an address in that database has postal address elements that correspond with each of the entries of the dictionary that corresponds to one or more of the input terms.Type: ApplicationFiled: April 28, 2008Publication date: October 30, 2008Applicant: QAS LIMITEDInventors: David John Bellamy, David Richard Ranson
-
Publication number: 20080263008Abstract: An apparatus and method for optimizing descendant path evaluation in XPath/XQuery includes generating a list of unique paths in a tree structure of an XML document. Each unique path includes one or more nodes of the tree structure. A query is received specifying a descendant node for retrieval from the tree structure. From the list, unique paths are identified that include the descendant node. A navigation aid is then generated to assist in traversing the unique paths that include the descendant node. Using the navigation aid as a guide, descendant nodes in the tree structure may be retrieved by traversing only unique paths that include the descendant node.Type: ApplicationFiled: April 23, 2007Publication date: October 23, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin S. Beyer, Edison L. Ting, Tuong C. Truong
-
Publication number: 20080243888Abstract: A Bell Tree data structure is provided to model the process of chaining the mentions, from one or more documents, into entities, tracking the entire process; where the data structure is used in an entity tracking process that produces multiple results ranked by a product of probability scores.Type: ApplicationFiled: May 5, 2008Publication date: October 2, 2008Inventors: Abraham Ittycheriah, Hongyan Jing, Nandakishore Kambhatla, Xiaoqiang Luo, Salim E. Roukos
-
Publication number: 20080243881Abstract: A system and method for reducing memory usage is disclosed. The system and method include populating a first container with original data. The first container has a tree-based data structure that includes a plurality of nodes and a plurality of pointers. A block of memory is allocated to a second container that has an array-based data structure. The original data is copied from the first container to the second container. The original data, the plurality of nodes, and the plurality of pointers may be deleted from the first container.Type: ApplicationFiled: March 11, 2008Publication date: October 2, 2008Applicant: Computer Associates Think, Inc.Inventor: Mark A. Russo
-
Publication number: 20080243772Abstract: A method and system for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. A transformation query is generated from the nested mapping specification by generating a first query for transforming source data into flat views of the target and a second query for nesting flat view data according to the target format. Generating the first query includes applying default Skolemization to the specification.Type: ApplicationFiled: May 28, 2008Publication date: October 2, 2008Inventors: Ariel Fuxman, Mauricio Antonio Hernandez-Sherrington, Ching-Tien Ho, Renee J. Miller, Paolo Papotti, Lucian Popa
-
Publication number: 20080228789Abstract: A computer program for editing a structured electronic document that is represented by a tree structure, in which an object to be processed by a computer forms each node, is provided. The program causes the computer to operate as (1) means for selecting a predetermined node from the nodes, (2) means for selecting at least another node that is placed after the predetermined node in the tree structure, (3) means for determining whether semantics of the selected other node are associated with semantics of the predetermined node or not, and (4) means for changing the tree structure so that the other node becomes a child node of the predetermined node if it is determined that the association is available.Type: ApplicationFiled: March 16, 2008Publication date: September 18, 2008Inventors: Chieko Asakawa, Hisashi Miyashita, Shin Saito, Hironobu Takagi
-
Publication number: 20080201328Abstract: A system and method for grouping separate elements, having a common characteristic, to produce at least one of an output document corresponding to a presentation or for producing the presentation.Type: ApplicationFiled: April 28, 2005Publication date: August 21, 2008Inventors: Ana Cristina Benso Da Silva, Ioao Batista Souza De Oliveira, Felipe Rech Meneguzzi, Leonardo Luceiro Meirelles
-
Publication number: 20080147660Abstract: The invention relates to a method for arranging object data in electronic maps. The inventive method is characterized in that a data area (D) having the coordinate data of a spatial area is provided, object data regarding objects (Pi) are associated with the coordinate data, and clustering is carried out in order to reduce the data volume. For the purpose of clustering, various, spatially independent objects (Pi) are combined to give a cluster object (C1, C2, . . . ).Type: ApplicationFiled: March 15, 2006Publication date: June 19, 2008Inventor: Alexander Jarczyk
-
Publication number: 20080133467Abstract: A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.Type: ApplicationFiled: January 16, 2008Publication date: June 5, 2008Applicant: International Business Machines CorporationInventors: Gordon T. Davis, Marco Heddes, Dongming Hwang
-
Publication number: 20080086448Abstract: Provided are a method of generating a node identifier including padding information and location information, in a tree structure, a computer-readable storage medium storing a program for executing a method of generating a node identifier in a tree structure, and a terminal apparatus using the tree structure. The location information is generated by using branch identifiers, each of the branch identifiers being allocated for each branch from a root node to a target node. The padding information is generated by a padding code, which includes information about a group of the target node, and depth information, which includes information about a level of the target node in the tree structure.Type: ApplicationFiled: April 19, 2007Publication date: April 10, 2008Inventors: Mi Suk Huh, Dae Youb Kim, Tae-Chul Jung, Hwan Joon Kim
-
Publication number: 20080077611Abstract: A program structuring device includes a play-list collecting unit that collects a play list for a content in which a time series is defined; a first storage unit that stores cutoff points that appear in the play list and are breakpoints of a program structure of the content, in correspondence with a frequency of appearance of each of the cutoff points; a calculating unit that calculates a level of relevance between scene segments defined by the cutoff points from the frequency of appearance of each of the cutoff points; an extracting unit that extracts multi-level chapter divisions based on the level of relevance; and a second storage unit that stores the extracted multi-level chapter divisions structured into a tree form.Type: ApplicationFiled: September 6, 2007Publication date: March 27, 2008Inventors: Tomohiro Yamasaki, Hideki Tsutsui, Koji Urata
-
Publication number: 20080065661Abstract: A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. The processes act on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. When restoring the full or partial save to a new memory, a translation table is used to convert the addresses of the nodes and their links to appropriately matched locations in the new memory so that the structure of the data store can be reconstructed in the new location and ensuring that there is sufficient protected memory for the structure as the restore is accomplished.Type: ApplicationFiled: October 29, 2007Publication date: March 13, 2008Inventors: Jane Mazzagatti, Jane Claar
-
Publication number: 20080052204Abstract: A binary tree structure for detecting inventory problems. A first embodiment detects on-hand inventory problems. A second embodiment detects inventory requirements problems. Both embodiments use a binary tree whose nodes store time values and delta values. The delta values represent inventory consumers or producers. The time values of trees used for inventory requirements problems are shifted in accordance with build-ahead times.Type: ApplicationFiled: October 19, 2007Publication date: February 28, 2008Inventor: Kevin Cline
-
Publication number: 20080016066Abstract: Present invention builds on the trie concept to construct a system for compact indexing and efficient multi-dimensional searching of objects using a flexible composition of a string search key and other search criteria, to facilitate fast prototyping of compressed object store and search trees, which embody a variety of search methods.Type: ApplicationFiled: June 28, 2007Publication date: January 17, 2008Applicant: Tele Atlas North America, Inc.Inventors: Tsia Kuznetsov, ILYA M. SANDLER
-
Publication number: 20070282870Abstract: Method of and device for querying of protected data structured in the form of a tree. A corresponding tree of node polynomials is constructed such that each node polynomial evaluates to zero for an input equal to an identifier assigned to a node name occurring in a branch of the data tree starting with the node in question. A tree of blinding polynomials and a tree of difference polynomials are constructed such that each polynomial in the tree of node polynomials equals the sum of the corresponding polynomial in the tree of blinding polynomials and the corresponding polynomial in the tree of difference polynomials. The blinding tree is given to a client, the difference tree to a server. By combining the outcomes of the evaluations of the client and the server, it is possible to identify nodes that match a given query.Type: ApplicationFiled: April 29, 2005Publication date: December 6, 2007Applicant: KONINKLIJKE PHILIPS ELECTRONICS, N.V.Inventors: Willem Jonker, Richard Brinkman, Jeroen Doumen, Berry Schoenmakers