Abstract: Related keywords having certain relations to a target keyword are extracted from a unit storing keywords according to relations among each other. Expressions corresponding to the target keyword and related keywords are read from a unit storing expressions correspondingly with each stored keyword, each expression having been extracted from a content containing the corresponding keyword. A commonness between the expressions corresponding to each related keyword and the target keyword is calculated. An association between each related keyword and the target keyword is calculated using a distance for each related keyword from the target keyword and the commonness. A related keyword having a certain association is extracted as a same-region keyword in a same region as the target keyword. A drawing including the target keyword and related keywords arranged according to the associations is output with the same-region keyword displayed distinguishably from other related keywords not included in the same region.

Abstract: An apparatus includes: a storage unit storing page information located at a root, a node, and a leaf in a tree structure, and storing the plurality of page information including an expiration date of a record that is included in any page information; a search unit searching a record that has passed its expiration date; a determination unit determining whether or not the expiration date included in the page information has come; a first control unit configured to make the determination unit determine whether the expiration date included in predetermined page information stored as the tree structure has come; and a second control unit configured to make the search unit end the search of the record that has passed its expiration date, and configured to make the determination unit determine whether the expiration date included in page information located at a child of the predetermined page information has come.

Abstract: Embodiments of a method for creating a graph database which is arranged to store data in the form of graph tuples comprising n-parts, are described. In an embodiment, each tuple-part is encoded into a unique part identifier (UPI). A geospatial UPI is defined for two-dimensional data elements that include a plurality of data points defined by respective pairs of an X-ordinate and a Y-ordinate. A two-dimensional data space is divided into a plurality of uniform Y strips of defined widths. The Y-strip width is selected to correspond approximately to an anticipated Y dimension of a typical search region of interest. The geospatial UPI encodes a plurality of coordinate points in a two -dimensional data space into a single datum that includes respective pairs of an X-ordinate and a Y-ordinate. The geospatial UPI comprises a data structure arranged in order of sort priority by the geospatial UPI type code, geospatial subtype, and Y-strip identifier followed by the X-ordinate data and Y-ordinate data.

Abstract: Various technologies and techniques are disclosed that improve data searching on mobile devices. A facet-based search application is provided that has a filter region, a results region, a facet navigation region, and a menu region. A user applies a facet-based filter to a set of data by selecting a number on a keypad or other area that correlates spatially to a filter option in the facet navigation region. A set of data in the results region is updated based on the applied facet-based filter. The user can also apply a freeform text filter to the data by selecting one or more characters for which to search. The data displayed in the results region is updated based on the applied freeform text filter. When input is received from the user to save the applied filter, an attribute label is displayed as a query term in the filter region.

Abstract: In one embodiment, a method for storing a snapshot of data in a database includes creating a root indirection set for the snapshot of data and maintaining a deleted pattern in the database. The deleted pattern is not removed from a pattern set for a node in a table of the database when the pattern is deleted in the database. The method includes providing access to the snapshot of data using the created root indirection set, the created root indirection set accessing the deleted pattern.

Abstract: An SCA generator is configured to use data in a Metadata repository to generate files that can be used by an SCA server. The SCA generator includes an instruction analyzing module configured to analyze input instructions and to determine the Metadata repository from the input instructions. The SCA generator also includes a matching module configured to match a service identifier received with the input instructions to service metadata stored in the Metadata repository and a retrieving module configured to retrieve service parameters for the matched service. The SCA generator further includes a tree generating module configured to generate a parser tree based on the retrieved service parameters and an output file generation module configured to recursively walk through the parser tree and to generate target output files.

Abstract: A method, system and computer program product for creating a report on the basis of a plurality of remote datasets. The system for achieving this includes an intelligence server, connected to one or more tree servers. The tree servers are in turn connected to one or more databases. A user specifies a report to be created by the system. A client, acting on behalf of the user, creates a report definition that is sent to the intelligence server and the tree servers. Each tree server creates one or more segments, or slices, of the report, using the information that resides on the tree server. These slices are then sent to the intelligence server, which aggregates the slices into a tree structure. The tree structure is then converted into a report for presentation to the client. Moreover, the intelligence server receives updates from the tree servers as necessary. To do so, the tree servers and the intelligence server remain in communication for the purposes of passing update messages.

Abstract: 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.

Abstract: A genealogy registry system includes a central server database and a central server. The central server database includes surname workspaces for storing genealogical data in lineage-linked form, a submission link space for making and storing links between data in the data spaces, and a third-party link space for making and storing links between the data spaces. The central server includes a surname cooperation manager to manage cooperation between researchers researching genealogy for the same surname, a unique ID generator to generate a unique ID for any individual being researched, a visible data selector to allow access to a subgroup of data on the central server database, and a workstation manager to manage transmission of data to the central server database from workstations where data are assembled relating to a particular surname. The workstations may assemble data by extracting, indexing, sorting and linking information from source documents for the surname.

Abstract: 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.

Abstract: A method of visually representing pedigree data is provided. A root individual in a genealogical dataset is identified. A first parent and a second parent of the identified root individual are identified from the genealogical dataset. A third parent and a fourth parent of the identified first parent are identified from the genealogical dataset. A pedigree visualization relative to the identified root individual is presented which includes a root indicator, a first parent indicator, a second parent indicator, a third parent indicator, and a fourth parent indicator.

Abstract: An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.

Abstract: A system for social bookmarking of a resource provided through a Web application that doesn't follow the representational state transfer architectural style (REST). When processing a request for a social bookmarking operation, the system searches for a URL and potentially other resource information within the document object model of a currently loaded Web page. If such resource information is found, it is used to process the requested social bookmarking operation. Otherwise, if such resource information is not found in the document object model, the system uses the URL stored in the location bar of the Web browser to process the requested social bookmarking operation. The system includes semantic information in the DOM of a Web page that is used to identify subsets of content within the Web page that can be socially bookmarked. The semantic information may be stored in what is generally referred to as “microformatting”.

Abstract: A tree-structured database is collapsed into a two-column table. The two-column table includes a characteristic key value for a given leaf node in the first column and the system identification (SID) relating to the characteristic key value in the second column and also identifying the node that leads to the characteristic key value. Data is presented by coupling the characteristic key value with a transaction table. A query that is formulated in an infocube may be translated to a relational data base query, collapsed, and reformulated into an infocube result set, or vice versa.

Abstract: Tree creation systems and methods are disclosed. An example of a method includes building a system tree in computer-readable medium, the system tree having a plurality of nodes, each node in the system tree representing a desired range of characteristics of a component of a system under consideration. The method also includes identifying probable nodes in other trees that satisfy the desired range of characteristics of the component of the system under consideration. The method also includes creating in computer-readable medium at least one new tree for the system under consideration by replacing at least one of the nodes in the system tree with at least one of the probable nodes from the other trees.

Abstract: The present disclosure relates to a method for generating a context hierarchy and a system for generating a context hierarchy, and more particularly, to a method for generating a context hierarchy from data streams configured of an infinite set of continuously transactions and a system for generating a context hierarchy from the data streams.

Abstract: The present invention provides a file management system and method, and a storage system that can prevent file-multiplexing in a storage apparatus, and efficiently use the storage capacity of the storage apparatus. The storage apparatus stores first management information for managing two or more kinds of classification list, each classification list including one or more keywords, and second management information for managing the kinds of classification list set for each of one or more users with regard to each of one or more tiers of their respective virtual file trees; and sends, in response to a request from a client apparatus to search the classification lists for a classification list set for a directory, the classification list set for the relevant user with regard to the tier matching the request to the client apparatus with reference to the first and second management information.

Abstract: A system and method for a networked viral family tree are disclosed. According to one embodiment, a computer-implemented method, comprises receiving a first profile from a first client. The first profile includes a first e-mail address. A second e-mail address is received from the first client. The second e-mail address is associated with a second profile. The second profile is created dynamically when the client provides the second e-mail address. An invitation is sent to the second e-mail address to provide additional profile information associated with the second profile. One or more relationships are associated to the first profile and the second profile to generate a family tree. One or more user interfaces is provided through which the first client provides a plurality of e-mail addresses corresponding to members of the family tree and are associated with of a plurality of profiles.

Abstract: 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.

Abstract: A data structure comprises a clump header table and an inline tree data structure. The inline tree, representing filterable data fields of hierarchically organized data records, comprises an alternating sequence of first-level binary string segments, each followed by one or more corresponding second-level binary string segments. Each clump header record includes an indicator of a location in the inline tree of corresponding binary string segments. A dedicated, specifically adapted conversion program generates the clump header file and the inline tree for storage on any computer-readable medium, and the inline tree can be read entirely into RAM to be searched or filtered. A dedicated, specifically adapted search and filter program is employed to list or enumerate retrieved data records. Run-time computer code generation can reduce time required for searching and filtering. One example includes spatial searching and filtering of data records that include spatial coordinates as data fields.

Abstract: Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.

Abstract: 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.

Abstract: 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.

Abstract: Performing a backup is disclosed. A changed portion of a file system tree is determined based at least in part on a stored state of the file system tree at a time a prior block based backup of the file system tree was performed. Incremental metadata associated with the changed portion is obtained. The obtained incremental metadata is stored where there is at least some metadata associated with an unchanged portion of the file system tree that is not stored when storing the obtained incremental metadata.

Abstract: A storage system comprises a plurality of vdisks, with each vdisk containing a plurality of storage segments, and each segment providing a specific class of service (CoS). Each vdisk stores files with data and meta data distributed among its storage segments. A storage system comprises a memory having multiple classes of service. The system comprises 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. A file system for storing a file comprises a plurality of vdisks, with each vdisk having a plurality of inodes. Each inode of each vdisk stores data on one or more segments, with each segment having a different class of service. The system comprises a controller which stores data of a file in an inode of a vdisk, in one or more segments of that vdisk. A file system for storing a file comprises a plurality of vdisks, and each vdisk having a plurality of inodes.

Abstract: A coupled node tree comprises a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes located in adjacent storage areas. The branch node includes a discrimination bit position of the search key and a position information of a primary node, which is one node of a node pair of a link target. The leaf node includes an index key that is a bit string that is the target of a search. A coupled node tree is searched using a longest-match/shortest-match search key and the longest-match/shortest-match node is determined through a comparison of the difference bit position between the index key resulting from the search and the longest-match/shortest-match search key and the discrimination bit position of a branch node on the search path memorized when the search is performed.

Abstract: 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.

Abstract: 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.

Abstract: A processor implemented method, system and computer program product presents and retrieves data directories. A facet tree is initialized to present facet-converted stored tabular data and dynamically entered user-input data on multiple facet nodes. The facet nodes represent directories for the facet-converted stored tabular data and user-input data. In response to a single facet node from the multiple facet nodes being selected by a user, the single facet node is expanded by presenting, on the facet tree, all other facet nodes from the multiple facet nodes as children of the single facet node that was selected by the user. In response to a child of the single facet node being selected, value directories for the child are retrieved and presented according to a definition of the single facet node that was expanded.

Abstract: A tree-based node insertion method and a memory device are disclosed in embodiments of the present invention. The tree-based node insertion method includes: according to the key value of a node to be inserted, searching in a primary tree for the nearest node whose key value is smaller than and the most approximate to the key value of the node to be inserted; judging whether the current secondary tree is full, and if so, selecting a node from the current secondary tree as a split node, transferring all the nodes on the right of the split node in the current secondary tree to the new secondary tree, and if not, inserting the node to be inserted into the current secondary tree.

Abstract: A system and method include a database having multiple tables with columns containing information. A database application executes queries against the database. An externalized data structure are stored on the system and provide a user modifiable set of key performance indicators facilitating selection of database tables and queries against the tables to provide multiple levels of viewable key performance indicators to users without having to recompile the database application upon modification of the set of key performance indicators.

Abstract: A method, mechanism, and computer program product for storing, accessing, and managing XML data is disclosed. The approach supports efficient evaluation of XPath queries and also improves the performance of data/fragment extraction. The approach can be applied to schema-less documents. The approach is applicable to all database systems and other servers which support storing and managing XML content. In addition, the approach can be applied to store, manage, and retrieve other types of unstructured or semi-structured data in a database system.

Abstract: 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.

Abstract: 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.

Abstract: An example computer 10 that manages folders containing files by using a tree structure is caused to execute a step S104 of identifying a superior folder from predetermined folders managed by the tree structure by retracing the tree structure by at least one level, and a step S501 of specifying a file belonging to a subordinate folder that is subordinate to the superior folder in the tree structure as a processing object.

Abstract: Systems, methods, and other embodiments associated with insertion rate responsive b-trees are described. One system embodiment includes a capacity logic to detect a divide condition for a leaf node and an insert logic to determine an insertion level for the leaf node. The system embodiment may include an allocation logic to selectively allocate a set of leaf nodes. Characteristics of the set (e.g., number of members) may depend on the divide condition and the insertion level. The system embodiment may include a partition logic to move a partition key from the leaf node to a parent and to associate the partition key with the set of leaf nodes. A fuzzy index logic may provide key-based addressing to the set of leaf nodes.

Abstract: A method and system for compressing a tree with a plurality of nodes that each may be associated with a node identifier and a parent node identifier. The method may comprise for each node in the tree determining whether the current node is to be deleted, if the current node is to be deleted updating a list of deleted nodes such that the node identifier of the current node may be stored; a parameter representing a number of nodes currently having been deleted from the tree may be stored, such that the parameter is associated with the node identifier of the current node, and updating the node identifier and the parent node identifier of the current node as a function of the list of deleted nodes. Each node in the tree is visited only once.

Abstract: A high-density, distance-measuring laser system and an associated computer that processes the data collected by the laser system. The computer determines a data partition structure and stores that structure as a header file for the scan before data is collected. As the scan progresses, the computer collects data points until a predetermined threshold is met, at which point a block of data consisting of the data points up to the threshold is written to disk. The computer indexes each data block using all three coordinates of its constituent data points using, preferably, a flexible index, such as an R-tree. When a data block is completely filled, it is written to disk preferably with its index and, as a result, each data block is ready for access and manipulation virtually immediately after having been collected. Also, each data block can be independently manipulated and read from disk.

Abstract: An embodiment of providing a computer-executed method of subsequence matching is provided. The method comprises receiving a search string. A plurality of subsequences for the search string are stored in a tree structure. The tree structure comprise a plurality of nodes. Each of the plurality of nodes comprises a presence bit map, a sequence bit map, and a list of address pointers. The method further includes traversing the tree structure using the search string, the presence bit map, the sequence bit map, and the list of address pointers. Additionally, the method includes identifying, in linear time, the plurality of subsequences based on the search string, the presence bit map, the sequence bit map, and the list of address pointers.

Abstract: A method to produce a reverse skip list data structure in a computer readable medium, comprising: inputting streamed data to packets created in a temporary memory so as to create a sequence of packets; upon completion of creation of a packet in the stream, transferring the completed packet from the temporary memory to persistent memory; providing each of a plurality of respective packets with a respective pointer that skips over at least one other packet in the packet sequence and that indicates a location in persistent memory of a different respective packet in the packet sequence that was transferred to persistent memory prior to such providing of the respective pointer.

Abstract: 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.

Abstract: 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.

Abstract: A method and apparatus for different embodiments of incremental garbage collection of data in a secondary storage. In one embodiment, a method comprises locating blocks of data in a log that are referenced and within a range at a tail of the log. The method also includes copying the blocks of data that are referenced and within the range to an unallocated segment of the log.

Abstract: Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.

Abstract: A system includes a data structure having a Direct Table (DT), Patricia-Trees, Pointers and high speed storage systems such as Contents Address Memory (CAM). The DT has a plurality of entries with each one coupled to a Patricia Tree having multiple nodes coupled to leaves. The number of Nodes, termed a threshold, that can be traversed to obtain information in the leaves is limited to a predetermined value. Once the threshold is reached a pointer indicates the address of the CAM and the address of the leaves is stored in the CAM. By using the structure and method the latency associated with tree search is significantly reduced.

Abstract: A method of automatically matching schemas begins by extracting schemas from sources and targets. Then, source and target attributes are extracted from the schemas. Each source schema will have multiple source attributes and each target schema will also have multiple target attributes. The source attributes and the target attributes are presented as nodes in a bipartite graph. This bipartite graph has edges between nodes that are related to each other. A plurality of similarity scores are defined between each set of related nodes. Each of the similarity scores is based on a different context-specific cue of the attributes that the nodes represent. These context-specific cues can comprise lexical name, semantic name, type, structure, functional mappings, etc. An overall weight is computed for each edge in the bipartite graph by combining the similarity scores of each set of nodes that form an edge.

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.

Abstract: 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.

Abstract: A method of updating information stored in an index associated with spatially-related objects. The method includes accessing a hierarchical multi-level index having leaf nodes containing information about an object and non-leaf nodes storing information about a number of nodes related to the non-leaf nodes, adding a representation of the object at a leaf node in the index, and traversing parents of the leaf node toward a root node, and incrementing counts of each node in the traversal path.

Abstract: A method of providing provenance management for a pre-existing application is provided. A provenance data selection is received. The provenance data selection indicates provenance data to present to a user. The provenance data is presented to the user as a version tree comprising a plurality of connected nodes. A node selection is received. The node selection indicates a node selected from the version tree. One or more nodes from a root node of the plurality of connected nodes to the node selected from the version tree are identified. One or more action parameters associated with the identified one or more nodes are identified. An action parameter of the one or more action parameters is associated with a previous interaction with a pre-existing application. Presentation of a state of the pre-existing application associated with the node selected from the version tree is triggered.