System and method for dynamically configuring content-driven relationships among data elements

• US 8,229,971 B2
• Filed: 09/29/2008
• Issued: 07/24/2012
• Est. Priority Date: 09/29/2008
• Status: Active Grant

• Current Assignee: Mcap Research LLC
• Original Assignee: Efrem Meretab
• Inventors: Meretab, Efrem
• Primary Examiner(s): Alam, Shahid
• Application Number:
  US12/240,377
• Publication Number:
  US 20100082631A1
• Time in Patent Office: 1,394 Days
• Field of Search: 707/729, 707/736, 707/711, 707/741, 707/743, 707/802
• US Class Current: 707/802
• CPC Class Codes: G06F 16/31 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/34 Browsing; Visualisation therefor
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 40/279 Recognition of textual entities

Abstract

A computer system configures data elements based on textual sources by identifying subunits of a textual source, indexing the subunits into a sequence comprised of terms, identifies based on a target a base subsequence of the sequence, and stores the terms in such a way that they can be expanded or contracted and a user can rapidly and efficiently derive relevant information and context even from a vast amount of information including by navigable display to the user. Other methods and systems of configuring and displaying data elements from textual sources are provided.

Claims

1. A computer-implemented method for configuring relationships among data elements of a textual source, the data elements stored in a computer-readable medium, the method comprising:

identifying one or more subunits of said textual source, wherein said one or more subunits correspond to, respectively, one or more sentences, and storing said subunits in a computer memory;

indexing said subunits to form a sequence, said sequence comprised of one or more terms, and storing said sequence in said computer memory wherein said sequence preserves said one or more terms in an order determined by said corresponding subunits in said textual source;

identifying, based on a search query, a base subsequence of said sequence, said base subsequence comprised of one or more terms of said sequence, said base subsequence preserving the order of said subsequence, wherein each of said one or more terms of said base subsequence contains said search query; and

storing said base subsequence in said computer memory in such a manner that said base subsequence is structured for expansion by adding one or more terms from said sequence wherein each of said one or more added terms from said sequence does not contain said search query.

2. The computer-implemented method of claim 1, wherein said base subsequence is transmitted to a user computer in such a manner that a user is able to navigate, by interacting with a display, through the terms of said base subsequence or said sequence.

3. A computer-implemented method for configuring relationships among data elements of a textual source, the data elements stored in a computer-readable medium, the method comprising:

identifying one or more subunits of said textual source, wherein said one or more subunits correspond to, respectively, one or more sentences, and storing said subunits in a computer memory;

indexing said subunits to form a sequence, said sequence comprised of one or more terms, and storing said sequence in said computer memory such that said sequence preserves said one or more terms in an order determined by said corresponding subunits in said textual source;

identifying, based on a search query, a base subsequence of said sequence, said base subsequence comprised of one or more terms of said sequence, said base subsequence preserving the order of said subsequence, wherein each of said one or more terms of said base subsequence contains said search query; and

storing said base subsequence in said computer memory in such a manner that said base subsequence is structured for contraction by omitting one or more terms from said subsequence.