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

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

Abstract: An index key is a key string formed of three or more keys whose tail-end key is unique, and a search key string for a bit string search has a unique key as its tail-end key. A branch node includes a search key sequence number expressing the position information of a key in the search key string to be used in the bit string comparison during the bit string search and the discrimination bit position for that key. Search for index keys is performed by extracting from the search key string the key with the search key sequence number in the branch node and repeatedly linking to one of the nodes of a node pair of the link target in response to the bit value at the discrimination bit position of that key until the leaf node corresponding to that index key is reached.

Abstract: 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 (203) reads out a tree structure of data from a hierarchy structure information recording unit (201) and displays a part of the tree structure in a tree display region of an output unit (202). A display parent determination unit (206) determines a parent node for a child node with an unknown parent and child relation from the display and displays a text of the parent node in a tree bar adjacent to the tree display region. Further, it is also possible to shift contents of the display contents shift to the tree display region and display the same, so as to render the parent and child relation recognizable.

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

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

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

Abstract: In general, the invention provides a design and apparatus (patient scorecard system-PSS) for dynamic scoring of Patient clinical condition based on patient-attributes, medical rules, patient-information events and medical criteria. One aspect of the invention is to offer better tracking of Patient-care and improving the quality of care to patients. The scorecard model is based on a multi-attribute data structure that captures Patient risk based on attributes such as symptoms, causes, past history, errors in medication, bad quality of care, medication history, current costs, MRI, current state of the disease and family history. The scorecard keeps a time-stamped record of the attributes of the patients, and updates them dynamically as new information is available from multiple sources such as medical records, MRIs, Lab-tests, personal patient monitors and others.

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

Abstract: A search rule generation unit (2502) pregenerates a search rule for searching for a search target part among parts forming a user interface, based on user interface information indicating the parts forming the user interface and the positional relationship between the parts, search target part information indicating the search target part among the parts, and structure definition information defining the structure of the user interface. When new user interface information is input, a part search unit (2503) searches for the search target part among parts indicated by the new user interface information by using the pregenerated search rule. This makes it possible to correctly specify a part in a user interface having an unclear inconstant structure.

Abstract: A method is provided for managing a relational database of the SQL type for information technology and network infrastructure service information, including a method in which the following are created, in a system for managing a database of the MySQL type, a read-only data storage engine, and unmodifiable tables, for example of WORM, defined as “Write Once Read Many” type managed by the storage engine; each table includes a column of digital counting data called a “timestamp”; each table is partitioned by time intervals; partition files are grouped in subdirectories of a file system, these directories forming a tree structure, each node of which is uniquely identified from a timestamp.

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: An apparatus for and a method of transmitting sensing data of a sensor node for proactive data filtering in a wireless sensor network are provided. In the apparatus and method, a request query of sensing data and timer parameters are received, local sensing data sensed in the sensor node in response to the received request query are detected, a driving time of a timer applying the timer parameters based on the request query is set, and the local sensing data are transmitted when the local sensing data do not overlap sensing data of a neighboring sensor node within a wireless reception range of the sensor node by overhearing the sensing data of the neighboring sensor node during the set driving time of the timer. Thus, since a data transferring path is selected considering the remaining energy of the node, the energy exhaustion of the node is distributed, thereby improve the lifespan of the network.

Abstract: Method and apparatus for formatting information within a directory tree structure into an encyclopedia-like entry. The method includes performing a search by utilizing a selective one or more search methodologies including keyword search, hierarchical search, dichotomous key search, and parametric search to correlate a search criteria to a searchable database for generating one or more matching items, wherein the searchable database is formatted in the directory tree structure. The directory tree structure includes nodes comprising a collection of related data and branches comprising links between the nodes. Each matching item represents a node from within the directory tree structure. The method further includes selecting one of the matching items, formatting the collection of related data corresponding to the node of the selected matching item into an encyclopedia-like entry, and displaying the encyclopedia-like entry corresponding to the node of the selected matching item.

Abstract: A column-store database computer system responsive to database requests for the update and retrieval of data from within a stable data table 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 computer system 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.

Abstract: An end user, by way of a submission interface, instructs an engine to select particular collections of documents to process. The engine processes all the text from within all the documents from within the selected collections. The result of the processing of such text is a distilled data set. Such distillate data set is accessed through APIs by a browser. Different views of the accessed distillate data set may be presented to the end user via the browser allowing them to more effectively assess the utility of the presented data and thereby responsively tune the presented data set with regard to their particular research task. One or more of such views may be used to create a new document from sentences, paragraphs, chapters or documents from the distillate data set that correspond to the one or more views for presentation to the end user.

Abstract: An extrusion detection system prevents the release of sensitive data from an enterprise. The system includes administration module for broadcasting taint instructions, each of which include a definition of sensitive data. The system also includes a plurality of extrusion detection nodes. Each node marks sensitive data as tainted responsive to the taint instructions, marks data that depends on sensitive data as tainted. When the potential release of tainted data is detected, an action is executed responsive to the taint instructions.

Abstract: A method and an apparatus are disclosed for detecting and evolving of a structure for storage, analysis and exchange of information data between domains and organizations. In at least one embodiment, the schema of all relevant domains of the organizations is determined on the basis of the meta-schema which includes a set of rules for generating the schema which has at least one dimension. Data of one domain can be easily used for evaluation or decision taken in other domains within the same or different organizations.

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

Abstract: A device and method for providing a fault-tolerant file system. The fault-tolerant file system attempts to minimize the number of writes used when updating file system data structures. In one embodiment, file system data, including file system metadata, is stored in a fault-tolerant tree including a working state and a transacted state. In one embodiment, a change list is used to track blocks that have been updated, instead of cascading updates to leaf nodes up the tree, and a delta block is used to further minimize block updates when adding or removing nodes from the tree. In one embodiment, a Q-Block is used to prevent cycles when adding and removing free blocks from an allocation tree. Metadata values are stored in the tree in a way that allows certain metadata values to be inferred when not present in the tree, thus conserving space and lowering query time.

Abstract: 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 (6) extracts the keywords from the description information and produces a keyword list correlating the keywords with the scene information containing the keywords. A description information converter (8) converts the keywords contained in the keyword list received from the list producing portion (6) among the keywords contained in the externally received description information into reference information for specifying the keywords in the keyword list received from the list producing portion (6). A storage (10) stores the converted description information provided from the description information converter (8) and the keyword list provided from the list producing portion (6).

Abstract: A computer product including a data structure for organizing of a plurality of documents, and capable of being utilized by a processor for manipulating data of the data structure and capable of displaying selected data on a display unit. The data structure includes a plurality of directionally interlinked nodes, each node being associated with one or more documents having a header and body text. All the documents are associated with a given node and have identical normalized body text. All documents that have identical normalized body text are associated with the same node. One or more of the nodes is associated with more than one document. For any node that is a descendent of another node, the normalized body text of each document associated with the node is inclusive of the normalized body text of a document that is associated with the other node.

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

Abstract: Systems, methods, and computer program products are provided for performing an authorization check for a user. In one implementation, a data processing system is provided that includes means for storing first data descriptive of at least one directed acyclic graph and for storing second data descriptive of an assignment of a user to a first node of the graph. The data processing system also includes means for receiving an access request of the user, the access request specifying a second node of the graph. Furthermore, the data processing system includes means for determining a least common ancestor of the first and second nodes of the graph and means for performing an authorization check adapted to grant authorization for the access request if the least common ancestor of the first and second nodes is the first node.

Abstract: The invention relates to a method of determining if a block was modified in a file system by comparing the versions of the base snapshot, the delta snapshot, and the space map block entry (b, e). In another aspect, the invention relates to a method of searching for blocks modified in a tree structured file system. The invention relates to methods and systems of snapshot management of a file system in a data storage system. To represent the snapshots, the invention maintains pointers to the root block pointer of each snapshot. When the active file system is modified, this invention avoids overwriting any blocks used by previous snapshots by allocating new blocks for the modified blocks. When the invention needs to put an established block in a new location, it must update a parent block to point to the new location. The update to the parent block may then require allocating a new block for the new parent block and so forth. Parts of the file system not modified since a snapshot remain in place.

Abstract: The present invention relates to a method computer program product for datamining with constant search time, the method and computer program product comprises the steps of: traversing a search tree to a leave, retrieving a one or more data store identifier from said leave, read data pointed to by said data store identifier, locating one or more value in said data, referencing one or more data descriptor, retrieve the n-nearest data descriptor neighbors, terminate said search.

Abstract: A template or wrapper tree for a document such as a web page is generalized from the bottom up (from leaf toward root of a logical tree structure of the template). At a given level in the tree, sub-trees are clustered and the clustered sub-trees are generalized, and the process is repeated at a next higher level in the tree, resulting in a generalized template or wrapper tree. This can be done by generating a nested pattern regular expression based on the sub-tree clusters, merging sub-trees based on the nested pattern regular expression, and then replacing sub-trees in a tree-based regular expression of the template or wrapper at the given level with the merged sub-trees. This process is repeated at a next higher level of the tree (progressing from leaf towards root) until the wrapper or tree-based regular expression that represents the template is fully generalized.

Abstract: To provide a method that lessens the reduction in efficiency of processing using a coupled node tree even if the scale of the coupled node tree grows large. Is stored a termination node, whose discrimination bit position has a value smaller than 0, in a search path stack that holds the search history while successively storing therein branch nodes that have been traversed in the search path. The coupled node indicator of the stored branch node is converted to a value wherein a 1 is added if the link target is node [1].

Abstract: A search query may be run against a plurality of container registers encapsulated and logically defined in a plurality of containers to identify one or more container registers responsive to the search query. Thereafter, a list characterizing the identified containers may be provided. Related methods, apparatus, computer program products, and computer systems are also described.

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

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

Abstract: A method for accessing a KStore including at least one K path having at least one subcomponent node and at least one root node includes providing a utility routine and accessing the KStore using the utility routine. The accessing may include traversing the at least one K path. The at least one K path includes a further node and bidirectional links between the at least one subcomponent node and the further node. The method includes traversing between the at least one subcomponent node and the further node by way of the bidirectional links. The further node can be a beginning of thought node, an end of thought node, root node, or a subcomponent node. A location may be determined within the KStore. The K Store may be queried. Searches for information within the KStore may be performed. The KStore may be traversed to constrain and focus the KStore. The KStore may be updated.

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

Abstract: A method performs a lookup on a search key word, employing a trie database including multiple trie blocks that include pointers to other trie blocks. Each trie is accessible by means of a segment of the search key. A selected section of the search key word is applied to a content addressable memory. In the event of an absence of a match of the selected section with an entry in the content addressable memory, a trie search is performed on the whole search key word. In the event of a match of the selected section with an entry in the content addressable memory, a partial trie search is performed, commencing with a first segment of the search key word after the selected section that has been matched in the content addressable memory.

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

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

Abstract: Embodiments of methods, apparatuses, devices and/or systems for performing tree matching are disclosed.

Abstract: A method and system for reporting quantitative measurement information includes forming a message with quantitative measurement information; converting the data format of the message to a data format which allows the message to be sent over a communication network; converting the data format of the message received over the communication network to a data format corresponding to that of a data recording system; and generating a report with the recording system using the quantitative measurement information contained in the message.

Abstract: In registering a new document file in an index, the accumulated percentage of the number of registered keys A from registered keys associated with one posting data, including registered data, is computed. The posting data of a registered key associated with the number of posting data items, which is at most a threshold N, is stored in a leaf page of a balanced-plus tree constituted of the registered keys, and the posting data of a registered key associated with the number of posting data items, which is greater than the threshold N, is stored in a page of a posting-storing unit. When the accumulated number i of registered documents is a predetermined document number, the threshold N of the number of posting data items is changed to the maximum number of the posting data items that are associated with a registered key where the accumulated percentage is less than 60 percent.

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 programming technique is disclosed for linking (or “mapping”) a query on the tree structure of an extensible markup language (XML) based computer-coded file to the “start” and “end” positions of the corresponding XML-coded data contained within the file, when the coded data has variable length in order to enhance the efficiency of querying an XML document (or other type of file).

Abstract: Techniques to enhance database performance are described. An apparatus may comprise an enhanced DBMS arranged to manage storage operations for tree data structures in a storage component. The enhanced DBMS may comprise a defragment detector module operative to identify a tree data structure as having a sequential data retrieval pattern. The enhanced DBMS may also comprise a defragment decision module communicatively coupled to the defragment detector module, the defragment decision module operative to determine whether to defragment the tree data structure, and output a defragment signal. The enhanced DBMS may further comprise a defragment manager module communicatively coupled to the defragment decision module, the defragment manager module operative to defragment the tree data structure in accordance with the defragment signal to reduce input/output operations for the storage component. Other embodiments are described and claimed.

Abstract: Provided are a method, system and article of manufacture for generating a value associated with one of a plurality of leaf nodes by implicitly randomly climbing an implicit tree having the leaf nodes. A determination is made of an ancestor node of a current node, wherein each ancestor node at a level of the ancestor node is associated with a different set of ordered leaf nodes, wherein there is a unique value associated with each leaf node. A determination is made of a first leaf node of the ordered leaf nodes associated with the determined ancestor node. A determination is made as to whether the determined ancestor node is a rightmost ancestor node at the level of the ancestor node. A first formula is used to determine a last leaf node of the ordered leaf nodes associated with the determined ancestor node in response to determining that the ancestor node is the rightmost ancestor node.

Abstract: A system described herein includes a receiver component that receives multiple data elements, wherein each of the data elements has a common attribute, and wherein the several data elements are hierarchically related. The system may further include an assignor component that independently assigns each of the multiple data elements to one of a plurality of layers, wherein a data element is assigned to a layer based at least in part upon a value of the common attribute that corresponds to the data element. The system may also include a renderer component that receives assignments made by the assignor component and graphically renders a tree structure based at least in part upon the assignments. Furthermore, a color bar can be generated that includes one or more rows based at least in part upon content of the tree structure.

Abstract: An organization defined as a collection of contexts having associated roles and objects is disclosed. In one implementation, a common computing system can maintain the contexts and associated roles and objects and provide data to personal systems. In another implementation, personal systems can maintain a subset of the data to assist in indexing.

Abstract: Machine readable media, methods, and computing devices are disclosed that mine a dataset using a frequent pattern array. One method of includes building a frequent pattern tree comprising a plurality of nodes to represent frequent transactions of a dataset that comprises one or more items. The method also includes transforming the frequent pattern tree to a frequent pattern array that comprises an item array and a plurality of node arrays, the item array comprising frequent transactions of the dataset and each node array to associate an item of the dataset with one or more frequent transactions of the item array. The method further includes identifying frequent transactions of the dataset based upon the frequent pattern array.

Abstract: Embodiments of the inventive subject matter use a radix-like counting technique to generate unique object identifiers (OIDs) for managed objects in accordance with a network management protocol. A limit value is utilized to ensure prefix uniqueness for an allocated object identifier. For a level in a managed objects tree with a maximum value of MAX, a suffix MAX-2 will be allocated for a unique object identifier and a suffix MAX-1 will be extended to allow allocation of unique object identifiers with MAX-I in the prefix, while the suffix MAX-2 will not occur in a prefix for a unique object identifier. Embodiments of the inventive subject matter allow for generation of unique object identifiers in constant bound time O(1). Additionally, the number of OIDs generated is not limited by the maximum value of an integer 232?1.

Abstract: A system and method are described for filtering certain rows of a table while at the same time maintaining rows illustrating the ancestry of the filtered rows. For example, a computer-implemented method according to one embodiment of the invention comprises: receiving user-specified filtering criteria from a client comprising a value or range of values for filtering the rows of a table; filtering the table rows as indicated by the user-specified filtering criteria to generate a set of filtered rows; and generating a table containing the filtered rows and other rows which are ancestor rows to the filtered rows, notwithstanding the fact that one or more of the ancestor rows are not part of the set of filtered rows based on the user-specified filtering criteria, and excluding all other rows from the table.