Abstract: A method and apparatus for creating custom dimension trees. The method may include receiving a user request to create a custom dimension tree, displaying a list of available dimensions, and receiving user selection of available dimensions from the list. The method may further include allowing the user to create virtual dimensions, mapping elements of the available dimensions to the virtual dimensions, and creating the custom dimension tree using the mapping. The custom dimension tree represents relationships between the virtual dimensions.

Abstract: An electronic system comprises a memory, a parser, and a device driver. A plurality of applications and a document are stored in a user space of the memory, the document storing configuration parameters. The parser module parses the document to retrieve the parameters in response to invocation from at least one application. The device driver creates data structure for the parameters in the kernel space of the memory, thus to facilitate a plurality of programs to execute different functions of the system by commonly utilizing the parameters through the device driver.

Abstract: A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph.

Abstract: An intermediary apparatus, an intermediary method, and a computer program product thereof for storing data in a storage apparatus, and a data storage system comprising the same are provided. The storage apparatus has a storage zone with a signature field, and the signature field stores a first signature value. The data has index information and a data signature value. After searching out the storage zone according to the index information, the intermediary apparatus extracts the first signature value from the storage zone, and then determines if the data has been stored in the storage zone according to the first signature value and the data signature value. If not, the intermediary apparatus writes the data into the storage zone; otherwise, ignores the data.

Abstract: A database management apparatus including an auxiliary storage unit for storing structured data and a database management part for managing the structured data, which extracts all paths showing a storage position of the structured data to be processed from an SQL statement for processing the structured data; when a plurality of the paths are extracted, the database management apparatus compares the extracted paths with each other, and extracts as a common path a common part of both the paths; and processes using the SQL statement the structured data of nodes of the storage position or lower shown by the extracted common path.

Abstract: Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.

Abstract: A method including receiving a plurality of elements of a data stream, storing a multi-dimensional data structure in a memory, said multi-dimensional data structure storing the plurality of elements as a hierarchy of nodes, each node having a frequency count corresponding to the number of elements stored therein, comparing the frequency count of each node to a threshold value based on a total number of the elements stored in the nodes and identifying each node for which the frequency count is at least as great as the threshold value as a hierarchical heavy hitter (HHH) node and propagating the frequency count of each non-HHH nodes to its corresponding parent nodes.

Abstract: An interface tool is provided. The interface includes an aggregator that collects input data from a user and transforms the input data to a form suitable by a business processing system. A format component receives output data from the business processing system and transforms the output data to a form suitable by a user.

Abstract: A namespace is provided in a file system that employs logical volumes. With the namespace, the file system can withstand data storage units going offline without compromising accessibility of the files in the data storage units that remain online. The files in the online data storage units remain accessible through the use of path lookup tables that are stored in the online data storage units.

Abstract: A management device (D) that is part of a communication network (R1) to which can be connected items of communication equipment (T1-T4) constituting peers storing content data and operating in P2P mode.

Abstract: Method and system for analyzing relationship between molecular structure and biological activity in one or more molecules by transforming molecular structure data into a hierarchical representation of chemical concepts and descriptors and detecting common tree-like patterns in the data.

Abstract: A system, method and computer program product for searching at high speed for documents matching a dependency pattern from document data containing a large volume of text documents. The system includes a storage device for storing, index storage means for storing in the storage device occurrence information, receiving means for receiving information, reading means for reading from the index storage means, and searching means for comparing occurrence information. The method and computer program product include the steps of storing in the storage device, receiving information, reading from the storage device, comparing occurrence information, and searching. The computer program product includes instructions to execute the steps of storing each of the plurality of document data in the storage device, storing in the storage device occurrence information.

Abstract: Described is a technology by which uploaded GPS data is indexed according to spatio-temporal relationships to facilitate efficient insertion and retrieval. The indexes may be converted to significantly smaller-sized data structures when new updates to that structure are not likely. GPS data is processed into a track of spatially-partitioned segments such that each segment has a cell. Each cell has an associated temporal index (a compressed start-end tree), into which data for that cell's segments are inserted. The temporal index may include an end time index that relates each segment's end time to a matching start time index. Given query input comprising a spatial predicate and a temporal predicate, tracks may be searched for by determining which spatial candidate cells may contain matching results. For each candidate cell, the search accesses the cell's associated temporal index to find any track or tracks that correspond to the temporal predicate.

Abstract: An automatic software configuring system includes a database storage section for storing therein a plurality of soft components. In the event that soft components are extracted from the database storage section and are combined together to thereby generate a file, a comment indicative of a storage location in the database storage section for storing a respective soft component extracted from the database storage section is added to the respective soft component.

Abstract: To provide a production system creating system that can create a production system of an article by freely combining a plurality of production factors of various types from a superordinate concept toward a subordinate concept thereof. In a production system creating system 10, a plurality of two-term relationships of various types required for creating the production system are extracted from a relational database 18 and a plurality of production factors of various types corresponding to first and second production factors for forming the extracted two-term relationships are also extracted from a factor-type database 17, and while integrating these two-term relationships extracted from the relational database 18, these production factors extracted from the factor-type database 17 are connected in series from the superordinate concept toward the subordinate concept according to the two-term relationships thus integrated to thereby create the production system corresponding to the article.

Abstract: A system for determining an identity of a received work. The system receives audio data for an unknown work. The audio data is divided into segments. The system generates a signature of the unknown work from each of the segments. Reduced dimension signatures are then generated at least a portion of the signatures. The reduced dimension signatures are then compared to reduced dimensions signatures of known works that are stored in a database. A list of candidates of known works is generated from the comparison. The signatures of the unknown works are then compared to the signatures of the known works in the list of candidates. The unknown work is then identified as the known work having signatures matching within a threshold.

Abstract: Various approaches for processing a B+ tree data structure are described. In one approach, in a first transaction a first insert operation to a first data page of a first index page in the B+ tree data structure is detected, and then it is determined whether performing the first insert operation would block a second insert operation in a second transaction concurrent with the first transaction. At least one empty second data page is created in response to determining that the second insert operation would be blocked by the first insert operation. The B+ tree data structure is updated to include the at least one second data page in the B+ tree data structure, and the updated index pages and second data page are committed to retentive storage. Thereafter, the first insert can be completed.

Abstract: A system and method for classifying and defining relationships between product information data is provided. The method classifies the product information data to two different data types. Each data type includes a plurality of items. The items of each of the two types are arranged in a product information tree. The items of all the product information trees are associated to construct a new tree for showing the relationships of the product information data.

Abstract: This method of managing electronic documents that can be implemented by a server in a telecommunications network comprises: a receiving step (E10) of receiving a request (70) from a client device, said request containing at least a user identifier and an electronic document name; an obtaining step (E50) of obtaining from the document name a secret identifier of at least one field of said document; a checking step (E60) of verifying from the user identifier and the secret field identifier whether a content associated with said field may be sent to the client device in response to the request; and where appropriate a sending step (E70) of sending said content to the client device.

Abstract: The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.

Abstract: Embodiments are introduced which provide for creation of an E-matching code tree index which works on E-graphs to make E-matching more efficient. Use of the E-matching code tree allows performing matching of several patterns simultaneously. Embodiments are also described which provide for the generation of inverted path indexes. An inverted path index may be used to filter an E-graph to determine terms which may potentially match patterns when an E-graph is updated.

Abstract: A data structure is described that comprises a balanced binary tree and a binary heap, which may be utilized for combinatorial searching algorithms. For instance, solutions for performing a task, such as a print job or the like, are associated with nodes that are utilized to generate the data structure. Each node is associated with a quality indicator that describes a most optimal solution that may be reached through the node when traversing the binary tree. The binary heap is generated from a subset of the nodes in the tree, wherein each node in the subset has a quality indicator value that is within a predefined range of a best known solution quality. The binary heap is sorted according to a search effort indicator value for each node, where nodes that are more easily reached in the tree are placed higher in the heap to facilitate rapid identification.

Abstract: Sequence alignment techniques are disclosed. In one embodiment, a sparse data structure is constructed that represents respective character positions of matching character sets in input sequences. This sparse data structure may take a variety of forms, including a “tree of trees.” Once constructed, each match is linked to at most one other match using a local application of a predetermined algorithm (e.g., a Smith-Waterman-type scoring algorithm). The links between matches are analyzed and a possible alignment or set of alignments is produced.

Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.

Abstract: A system and method for providing private inference control is presented. A query count and database including records are maintained. Each record includes attributes, wherein the attributes form inference channels. A data structure is constructed including ciphertext keys, which each relate to one attribute and record. A seed for a pseudorandom function and a secret key for non-malleable encryption are chosen. A query is specified by providing indices identifying one record and attribute by homomorphic encryption. A secure function evaluation is executed upon the inference channels, seed, secret key, query count, and the set of ciphertext keys. An output is generated including the pseudorandom function and an updated set of ciphertext keys subject to sum-consistency of the set of ciphertext keys and a non-inference enabling query. A table of entries is formed by combining each attribute for each record with an output from the pseudorandom function. The entry is provided.

Abstract: A performance-optimized web content navigation system and method are disclosed. A read-optimized data structure representing a tree structure of web content is generated. The tree structure includes an ordered set of interconnected nodes, and each node representing a website or web page. The read-optimized data structure is stored in a cache accessible by a portal runtime environment, which provides access to the read-optimized data structure using a single read operation.

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: Systems and methods for extracting data content items from a web page are provided. A template is created by labeling data content items of interest associated with a web page and generating a template Document Object Model (DOM) tree based on the labeled web page. DOM trees are also generated for additional web pages that contain data content items for which extraction may be desired. These DOM trees are compared to the template DOM tree to determine alignment there between. The aligned data content items may then be extracted from the additional web pages and indexed, as desired. Labeling the data content items of interest prior to generating a template DOM tree allows for the desired data content items to be specified and more accurately extracted from related and/or similarly structured web pages.

Abstract: A method and apparatus are disclosed for querying streaming extensible markup language (XML) data comprising: routing elements to query nodes, the elements derived from the streaming extensible markup language data; filtering out elements not conforming to one or more predetermined path query patterns; adding remaining elements to one or more dynamic element lists; accessing a decision table to select and return a query node related to a cursor element from the dynamic element lists; and processing the cursor element related to the returned query node to produce an extracted tuple output.

Abstract: A method, apparatus, and electronic device for hierarchical communications are disclosed. A connection interface may send and receive a data task. A database may store a group of contact nodes. A processor may select a sub-group of contact nodes from the group of contact nodes based upon the data task and create a hierarchical communications tree from the sub-group of contacts based on the data task.

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

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

Abstract: A device, system, and method are directed towards combining a plurality of queries to a database into a combined execution plan. The plurality of queries is received. The queries may be Structured Query Language (SQL) statements. The database may be a relational database. The plurality of queries is transformed into a plurality of parse trees. A determination is made whether the plurality of queries operates on at least the same portion of the same table. If so, then the plurality of query trees is query-optimized. The plurality of query trees are combined into a master query tree based on similar nodes in the plurality of query trees. A split node in the master query tree represents non-similarities between the plurality of query trees. The master query tree is transformed into an execution plan. The execution plan is applied to a database to return at least one result.