811results about "Semi-structured data indexing" patented technology

Provided is a technique for evaluating risk associated with underwriting an insurance policy (FIG. 1). At least one location to be covered under the insurance policy is received (FIG. 3, block 320). Risk associated with the location is automatically assessed (FIG. 3, block 338). It is determined whether to underwrite the location based on the assessed risk (FIG. 3, block 340). Also provided is a technique for proximity analysis (FIG. 54). Selection of a proximity center is received (FIG. 55). A function is executed with the proximity center to determine target data items that fall within a proximity area around the proximity center. The target data items are spatially represented.

A method and a system for information extraction from Web pages formatted with markup languages such as HTML [8]. A method and system for interactively and visually describing information patterns of interest based on visualized sample Web pages [5,6,16-29]. A method and data structure for representing and storing these patterns [1]. A method and system for extracting information corresponding to a set of previously defined patterns from Web pages [2], and a method for transforming the extracted data into XML is described. Each pattern is defined via the (interactive) specification of one or more filters. Two or more filters for the same pattern contribute disjunctively to the pattern definition [3], that is, an actual pattern describes the set of all targets specified by any of its filters. A method and for extracting relevant elements from Web pages by interpreting and executing a previously defined wrapper program of the above form on an input Web page [9-14] and producing as output the extracted elements represented in a suitable data structure. A method and system for automatically translating said output into XML format by exploiting the hierarchical structure of the patterns and by using pattern names as XML tags is described.

There is provided in one embodiment a data collection system including a data collection terminal having an encoded information reader device and a computer spaced apart from the data collection terminal. The data collection terminal in one embodiment can be configured to be responsive to configuration data expressed in an extensible markup language. The computer in one embodiment can use an existing extensible markup language document to create a data entry screen to received desired parameter settings for the data collection terminal within data entry fields of the data entry screen. The computer can further combine the extensible markup language document with the desired parameter settings to create configuration data and can initiate a transfer of the configuration data to the data collection terminal. The computer in one embodiment can be used to create for transfer to the data collection terminal a data package including file data corresponding to one or more selected files, together with additional data. The system provided can be used to transfer data, including but not limited to configuration data, between computers that are not data collection terminals and which are devoid of encoded information reader devices.

Stubbing systems and methods are provided for intelligent data management in a replication environment, such as by reducing the space occupied by replication data on a destination system. In certain examples, stub files or like objects replace migrated, de-duplicated or otherwise copied data that has been moved from the destination system to secondary storage. Access is further provided to the replication data in a manner that is transparent to the user and/or without substantially impacting the base replication process. In order to distinguish stub files representing migrated replication data from replicated stub files, priority tags or like identifiers can be used. Thus, when accessing a stub file on the destination system, such as to modify replication dath or perform a restore process, the tagged stub files can be used to recall archived data prior to performing the requested operation so that an accurate copy of the source data is generated.

Disclosed is a method of transferring data from a hierarchical file (having a hierarchical structure, e.g., a markup language file) to a relational database structure (made up of columns and rows. Before processing the actual data, the invention first partitions the hierarchical structure into sections, where each section is dedicated to at least one node of the hierarchical structure. The partitioning process is based on the document type definition file, which is separate from, and different than the hierarchical file. After completing the partitioning, the invention then parses the actual data contained in the hierarchical data file to produce a stream of data pairs and end of section indicators. During the data parsing process, the invention loads the data pairs into corresponding “sections” (created prior to the parsing process) as the data pairs are output from the parsing process. The invention also transfers the node data from these sections to the columns and rows of the relational database structure.

Type annotation record information storage for annotated automaton encoding for high-performance XML schema validation is optimized in a space efficient aspect. Subsequent to type annotation record information organization, type annotation records are used for type annotation of validated XML documents, either by implementing annotation records and type annotation part of an algorithm only, or by skipping one or more validation steps in a full validation implementation. Given a schema context, a type annotation may be performed for a validated XML fragment as opposed to an entire document. In addition, default features such as attribute and type are supported.

Methods and systems in a data-processing system for matching data contained in a hierarchical data tree structure. One or more sets of data contained within a first data tree structure can be associated with one or more sets of data contained within a second data tree structure, such that the data associated with the first data tree structure is generally utilized to process the data associated with the second data tree structure. The first data tree structure can then be compared in parallel to the second data tree structure beginning with a first root thereof to thereby identify data similarities between the first and second data tree structures based on a predefined search criteria. Finally, one or more matching set of data between the first data tree structure and the second data tree structure can be identified, in response to comparing the first data structure to the second data structure.

A computer-implemented method for generating a longitudinal data profile from multiple disparate data sources is provided. The method includes storing, at a central data hub, first de-identified data received from a first data source, the first de-identified data including a plurality of data records having encrypted identifying data and an anonymous ID assigned to each record, wherein the anonymous ID is assigned based on a master list that includes a list of identifiers and corresponding anonymous IDs for each identifier. The method further includes storing second de-identified data received from a second data source, and storing third de-identified data received from a third data source. The method further includes processing the first, second, and third de-identified data to link the first, second, and third de-identified data using the anonymous ID, and generating the longitudinal data profile from the linked first, second, and third de-identified data.

Mechanisms for searching XML repositories for semantically related schemas from a variety of structured metadata sources, including web services, XSD documents and relational tables, in databases and Internet applications. A search is formulated as a problem of computing a maximum matching in pairwise bipartite graphs formed from query and repository schemas. The edges of such a bipartite graph capture the semantic similarity between corresponding attributes of the schema based on their name and type semantics. Tight upper and lower bounds are also derived on the maximum matching that can be used for fast ranking of matchings whilst still maintaining specified levels of precision and recall. Schema indexing is performed by ‘attribute hashing’, in which matching schemas of a database are found by indexing using query attributes, performing lower bound computations for maximum matching and recording peaks in the resulting histogram of hits.

A method, apparatus, and computer-readable media for retrieving records in a hierarchical set of the records having a plurality of hierarchical levels and a plurality of hierarchical depths, each of the records having a tag that is unique within the hierarchical set of the records, comprises identifying one of the records in the hierarchical set of the records; modifying the tag, thereby producing a key; indexing the hierarchical set of the records only once, thereby selecting one or more of the records within the hierarchical set of the records, wherein indexing the hierarchical set of the records only once comprises applying the key to the hierarchical set of the records; and retrieving the selected records.

This invention relates generally to a method and system for storing, retrieving, and managing data for tags that are associated in some manner to any type of object. More particularly, the present invention writes data to these tags, reads data from these tags, and manages data that is written to and/or read from these tags. In addition, the invention accesses and/or stores data associated with tags from or into repositories, constructs and maintains data structures from these repositories and responds to queries using the data structures.

A partial tree is efficiently removed from a tree, or another tree is inserted into a tree. A flag is set for the node identifier of a node constituting a partial tree to be removed in an erasure flag array. Referencing the value of the erasure flag array, node identifiers which are consecutive integers given to the nodes while giving precedence to the nodes in the same generation over the child nodes are given to the nodes in the tree from which the partial tree has been removed. The given node identifiers are associated with those of the nodes in the tree before the partial tree is removed and stored in a new node identifier array, which is stored in a storage device. According to a parent-child relation definition array and the node identifier array, the parent-child definition array of the tree from which the partial tree is removed where the node identifiers of the parent node of the nodes having the node identifiers are stored in association with the new node identifiers is stored in the storage device.

Generating an inverted index is disclosed. Semi-structured data from a plurality of sources is parsed to extract structure from at least a portion of the semi-structured data. The inverted index is generated using the extracted structure. The inverted index includes a location identifier and a data type identifier for one or more entries of the inverted index.

The invention discloses a keyword based evaluation expert intelligent search and recommendation method. The keyword based evaluation expert intelligent search and recommendation method specifically comprises step 1, segmenting an expert information main text into substring sequences, performing ICTCLAS word segmentation of Chinese academy of sciences and performing stop word filtering on the result of the word segmentation to obtain the word collection; step 2, extracting feature words of the expert information according to fields; step 3, building an expert knowledge representation model based on the fields and the weight of the feature words and establishing an expert information index database; step 4, performing automatic prompting according to a search term thesaurus when a user inputs keywords and meanwhile performing real-time update on the search term thesaurus through a search term counter; step 5, calculating the search relevance between the keywords and the expert information based on the semantic information and the like; step 6, listing relevant experts from high to low according to the matching degree. According to the keyword based evaluation expert intelligent search and recommendation method, the intelligent full-text search and recommendation of the expert information can be achieved through the keyword input and accordingly the experts which are matched with a pended science and technology project can be searched out accurately.

The present invention provides a ViST (or “virtual suffix tree”), which is a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, it is shown that querying XML data is equivalent to finding (non-contiguous) subsequence matches. A variety of XML queries, including those with branches, or wild-cards (‘*’ and ‘//’), can be expressed by structure-encoded sequences. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B⁺Trees without using any specialized data structures that are not well supported by common database management systems (hereinafter referred to as “DBMSs”).

Embodiments of the present invention provide automatic systems and methods for associating objects in databases of a web site by rate-based tagging. The frequencies of users entering specific tag terms for objects stored in the databases of the web site are used to determine hard associations between objects and tag terms and between objects. When the frequencies of user tags exceed established thresholds, hard associations between objects and tag terms are established. When objects are identified or determined to have hard association with tag terms, the objects are determined to be more clearly associated with the corresponding tag terms. Therefore, they should be highlighted or featured in more prominent locations on web pages of the web site to increase users' confidence in content of the web site. To identify hard-associated objects, more weights can be assigned to the hard-associated objects, which allows them to be more likely to be selected for display in prominent locations. In addition, objects that are determined to have hard associations with tag terms can also have hard associations with one another due to the common tag terms they share. The hard association relationship between objects can be displayed through links to associated objects when an object is selected for display.