US 7,472,114 B1Grant
Method and apparatus to define the scope of a search for information from a tabular data source
Issue Date:2008-12-30
•24 Claims
•16 Drawing Sheets
Abstract
A method and apparatus for defining the scope of a search is described. In one embodiment, user input is received, and the scope is defined, based on the user input, for a search of free-form text for information from any random rows within a tabular structure of source data. In one embodiment, the search is intended for finding, in the free-form text, a sub-set of data fragments that matches information from any single row within the tabular structure of the source data.
Metadata
Assignee
- Symantec Corporation
Inventors
- Kevin T. Rowney
- Michael R. Wolfe
- Chris Jones
- Dirk Kessler
- Hai Chen
- Eric Bothwell
Application Information
Application Number:US 10/833,538
Filing Date:2004-04-27
Priority Date:2002-09-18
Art Unit:2167
Classifications
IPC:
G06F17/30G06F7/00
Patent Drawings (16 sheets)
Description
Related Application
[0001] This application is a continuation-in-part of U.S. patent application Ser. No. 10/607,718 filed on Jun. 27, 2003, which is a continuation-in-part of U.S. patent application Ser. No. 10/431,145 filed on May 6, 2003, which is a continuation-in-part of U.S. patent application Ser. No. 10/247,002 filed on Sep. 18, 2002, and assigned to the assignee of the present application and hereby incorporated by reference.
Field of Invention
[0002] The present invention relates to the field of processing data; more particularly, the present invention relates to defining the scope of a search for information from a tabular data source.
Background of the Invention
[0003] A modern organization typically maintains a data storage system to store and deliver records concerning various significant business aspects of the organization. Stored records may include data on customers (or patients), contracts, deliveries, supplies, employees, manufacturing, etc. A data storage system of an organization usually utilizes a table-based storage mechanism to store the information content. A table-based storage mechanism may include relational databases, client/server applications built on top of relational databases (e.g., Siebel, SAP, etc.), object-oriented databases, object-relational databases, document stores and file systems that store table formatted data (e.g., CSV files, Excel spreadsheet files, etc.), password systems, single-sign-on systems, etc.
[0004] Table-based storage systems typically run on a computer connected to a local area network (LAN). This computer is usually made accessible to the Internet via a firewall, router, or other packet switching device. Although the connectivity of a table-based storage system to the network provides for more efficient utilization of information maintained by the table-based storage system, it also poses security problems due to the highly sensitive nature of this information. In particular, because access to the contents of the table-based storage system is essential to the job function of many employees in the organization, there are many possible points of possible theft or accidental distribution of this information. Theft of information represents a significant business risk both in terms of the value of the intellectual property as well as the legal liabilities related to regulatory compliance.
[0005] Theft of information may occur if access control associated with the table-based storage system has failed either because it has been misconfigured or the trust in the authorized parties is misplaced. Various search mechanisms have been used to detect theft of sensitive information. The description of these search mechanisms is provided below.
Relational Database Search Techniques
[0006] Relational structures hold data in a fashion that presents naturally intuitive ways to query the data, and has the added advantage of hiding the details of the underlying disk storage system from the user. The typical applications for database systems involve the storage and retrieval of a large number of smaller pieces of data that can be naturally formatted into a table structure. Relational databases have high utility because the types of queries that most people care about can be optimized using the well-known index structures outlined below.
[0007] The queries requested of relational database systems use a naturally intuitive predicate logic called Structured Query Language (SQL) that allows the user to succinctly request the tabular data that she/he may be looking for. Database tables almost always come equipped with an index that makes queries based on SQL more efficient. These indices are stored in memory using a data structure called a B-tree. The salient characteristics of B-trees most relevant to the current discussion are as follows:
[0008] B-trees are an abstract data structure based on the binary tree;
[0009] B-trees must contain some copies of the data that they index; and
[0010] B-trees are most efficient using the query examples outlined below.
[0011] Here are a number of query examples:
[0012] Exact match queries of the form A=v, where:
[0013] A refers to the column or “attribute” of a given database table
[0014] v refers to a specific attribute value
[0015] e.g., SELECT * FROM CUSTOMERS WHERE Income=30,000
[0016] Range queries of the form v1<A<v2, where:
[0017] A refers to the column or “attribute” of a given database table
[0018] e.g., SELECT * FROM CUSTOMERS WHERE 30<Income<40
[0019] Prefix queries of the form A MATCHES s*, where:
[0020] “s” refers to a specific string value
[0021] “s*” is a regular expression
[0022] e.g., Last_Name MATCHES “Smith*”
[0023] There are a number of references to original works in the field of database systems. The first is the seminal work on relational databases by E. F. Codd., “A Relational Model of Data for Large Shared Data Banks”, Communications of the ACM, 13(6): 377-387, 1970.
[0024] The second reference is one of the first published works on the “B-Tree” data structure that is the fundamental data structure that enables efficient queries of the type outlined above. See Rudolf Bayer and Edward M. McCreight, “Organization and Maintenance of Large Ordered Indices”, Record of the 1970 ACM SIGFIDET Workshop on Data Description and Access, Nov. 15-16, 1970, Rice University, Houston, Tex., USA (Second Edition with an Appendix), pages 107-141, ACM, 1970.
Information Retrieval Techniques
[0025] Information retrieval is a broad field that deals with the storage and retrieval of textual data found in documents. These systems are different from those of database systems chiefly in their focus on standard documents instead of tabular data. Early examples of this system were developed as part of the SMART system at Cornell. Today, the best-known information retrieval applications are web-based search engines like Google, Inktomi, and AltaVista. The typical way to use these systems is to find a reference to a document that is part of a larger set of digital documents. The user experience for these applications usually consists of a series of queries interleaved with browsing of the results. Results of the queries are presented in order of descending relevance, and the user is able to refine the queries after further browsing. As with relational databases, the huge popularity of these systems is due to the ability of the underlying indices to deliver quick responses to the types of queries that people find most useful.
[0026] Most of these systems are based on indices that are derived from so-called “concordances” that are built up from the collection of documents indexed. These concordances contain a data structure that lists, for each word, the location of each occurrence of that word in each of the documents. Such data structures allow quick lookups of all documents that contain a particular term. For user queries that ask for all documents that contain a collection of terms, the index is structured so that it represents a large number of vectors in Euclidean vector space of high dimension. The user's list of query terms is then also re-interpreted as a vector in this space. The query is run by finding which vectors in the document space are nearest to the query vector. This last approach has a variety of different optimizations applied to it for accuracy and speed, and is called the “cosine metric”.
[0027] As mentioned above, the typical user interaction with these sorts of systems is an iterative cycle of querying, browsing, refining, and back to querying again. Query results are usually large numbers of documents that are ranked in order of relevance, and the false positive rate can be very high. Here are some classic examples of queries.
[0028] Boolean queries like:
-
- [0029] a) all documents that contain the terms “database” and “indices”
- [0030] b) all documents that contain “database” or “indices” but not “Sybase”-based queries like:
- [0031] a) all documents that are linked to by documents that contain the term “dog”
- [0032] b) the most “popular” (i.e. linked to) document that contains the word “dog”
[0033] One of the first significant implementation projects of information retrieval systems is the SMART system at Cornell. This system contains many of the essential components of information retrieval systems still in use today: C. Buckley, “Implementation of the SMART Information Retrieval System”, Technical Report TR85-686, Cornell University, 1985
[0034] The WAIS project was an early application of the massively parallel super-computer produced by Thinking Machines Inc. This is one of the first fielded information retrieval systems made available over the Internet. This primary reference source for this work is by Brewster Kahle and Art Medlar: “An Information System for Corporate Users: Wide Area Information Servers.” Technical Report TMC-199, Thinking Machines, Inc., April 1991, version 3.19.
[0035] Among the many contemporary commercial vendors of Internet search services is Google. Google's real break-through in search accuracy is its ability to harvest data from both the text of the documents that are indexed as well as the hyper-link structure. See Sergey Brin, Lawrence Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine”, <<http://dbpubs.stanford.edu:8090/pub/1998-8>>.
File Shingling Techniques
[0036] The growth of the Internet and affordable means of copying and distributing digital documents spurred research interest in technologies that can help detect illegal or inappropriate copies of documents. The primary application for this work was to detect the violation of copyright law, and to detect plagiarism. There is also significant interest in this problem as it relates to spam-email (AKA unsolicited commercial email) detection and automatic elimination. The technical term applied to describe most of these techniques is “file shingling” in which adjacent sequences of document fragments are reduced to “shingles” by hash codes, and then stored in a lookup table in the same sequence as they are found in the document.
[0037] File shingling provides a very quick way to look for similarity between two documents. In order to provide protection to a specific document (e.g., a text file) the document is shingled by hashing the document sentence-by-sentence and storing these hashed sentences in a table for quick lookup. In order to test a new document to see if it contains fragments of copyrighted content, the same hash function is applied to each fragment of the test message to see if the fragments appear in a similar order as they do in the copyrighted content. The technique is quick because the time required to lookup an individual fragment can be very fast.
[0038] The typical user interaction with a file shingling system is passive instead of active. File shingling systems are usually set up to process documents automatically and deliver the query results to a user asynchronously. A typical file shingling application might be spam prevention where a set of messages is used to create an index of restricted content that an organization does not want delivered to its email systems. In this scenario, the “query” is just the automatic processing of email messages and appropriate automatic routing.
[0039] With respect to document equivalency queries, for each test document t, find all documents d in our collection of indexed documents that have the same contents as t. For the case of spam detection, the set d could be all of the known active spam messages, and the document t could be an incoming email message.
[0040] With respect to cut-and-paste detection queries, for each test document t, find all documents d in our collection of indexed documents in which some fragment of d occurs in t. For the case of plagiarism detection, the set d could be all of the previously submitted essays for a particular class, and the document t could be a new paper written by a student who is suspected of plagiarism.
[0041] The main published research projects in file shingling are called KOALA, COPS, and SCAM. They all use variants on the basic file shingling approach described above with variants that optimize performance and accuracy. For information on KOALA, see N. Heintze, “Scalable Document Fingerprinting”, Proceedings of Second USENIX Workshop on Electronic Commerce, November 1996. <<http://www-2.cs. cmu.edu/afs/cs/user/nch/www/koala/main.html>>. For information on COPS, see S. Brin, J. Davis, and H. Garcia-Molina, “Copy Detection Mechanisms for Digital Documents”, Proceedings of the ACM SIGMOD Annual Conference, May 1995. For information on SCAM, see N. Shivakumar and H. Garcia-Molina, “SCAM: A Copy Detection Mechanism for Digital Documents”, Proceedings of 2nd International Conference in Theory and Practice of Digital Libraries (DL'95), June 1995, <<http://www-db.stanford.edu/˜shiva/SCAM/scamInfo.html>>, and also see (by N. Shivakumar and H. Garcia-Molina), “Building a Scalable and Accurate Copy Detection Mechanism”, Proceedings of 1st ACM Conference on Digital Libraries (DL'96) March 1996, <<http://www-db.stanford.edu/pub/papers/performance.ps>>.
Internet Content Filtering Techniques
[0042] A variety of commercial applications, referred to as content filtering systems, implement protection measures. There are two major types of applications in this category: web site restriction/monitoring software, and email content control. In both cases, the main algorithm currently in use is pattern matching against a set of regular expressions for a set collection of text fragments that would indicate data misuse. An example might be to restrict all browsing at URLs that contain the text fragment “XXX”. An example for the email content control category is stopping and blocking all email that contains the words “proprietary” and “confidential” but not the words “joke” or “kidding”.
Summary of the Invention
[0043] A method and apparatus for defining the scope of a search is described. In one embodiment, user input is received, and the scope is defined, based on the user input, for a search of free-form text for information from any random rows within a tabular structure of source data. In one embodiment, the search is intended for finding, in the free-form text, a sub-set of data fragments that matches information from any single row within the tabular structure of the source data.
Brief Description of the Drawings
[0044] The present invention will be understood more fully from the detailed description given below and from the accompanying drawings of various embodiments of the invention, which, however, should not be taken to limit the invention to the specific embodiments, but are for explanation and understanding only.
[0045] FIG. 1 is a block diagram of one embodiment of a system for protecting sensitive data of an organization.
[0046] FIG. 2 is a flow diagram of one embodiment of a process for protecting data of an organization.
[0047] FIGS. 3A-3D illustrate exemplary user interfaces that facilitate user input of search scope parameters, according to one embodiment of the present invention.
[0048] FIG. 4 is a flow diagram of one embodiment of a process for indexing source data.
[0049] FIG. 5 is a flow diagram of one embodiment of a process for searching information content for source data.
[0050] FIGS. 6A-6C are flow diagrams of various exemplary embodiments of a process for finding a match for a subset of content fragments in an abstract data structure derived from source data.
[0051] FIGS. 7A-7C are flow diagrams of alternate embodiments of a process for searching an incoming message using a hash table index of source data.
[0052] FIG. 8 is a block diagram of an exemplary computer system that may perform one or more of the operations described herein.
Detailed Description of the Present Invention
[0053] A method and system for defining the scope of a search is described. The scope is defined for a search of free-form text for information from any random rows within a tabular structure of source data. In one embodiment, the search is intended for finding, in the free-form text, a sub-set of data fragments that matches information from any single row within the tabular structure of the source data. The matched sub-set of data fragments may include a set of adjacent or non-adjacent tokens within the free-form text. In one embodiment, the scope of the search is defined based on user input that identifies the source data and specific columns within the tabular structure of the source data. The columns are identified to require that the matches returned by the search from a single row of the source data include data from each of the identified columns. In other embodiments, the user input may specify various other parameters for limiting the scope of the search.
[0054] In the following description, numerous details are set forth to provide a more thorough explanation of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.
[0055] Some portions of the detailed descriptions which follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
[0056] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
[0057] The present invention also relates to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
[0058] The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein.
[0059] A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (“ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
Overview
[0060] The present invention relates to defining the scope of a search for information from a data source having a tabular structure. The following description discusses embodiments of the present invention in the context of security applications. However, the embodiments of the present invention may be used with various other applications without loss of generality.
[0061] FIG. 1 is a block diagram of one embodiment of a system 100 for protecting sensitive data of an organization. The system 100 includes a search scope specifier 102, a detection condition identifier 104, an index creator 106, a search engine 108, and an action regulator 110.
[0062] The search scope specifier 102 is responsible for receiving user input pertaining to search scope parameters and defining the scope of the search based on the user input. In one embodiment, the search scope parameters include an identifier of the source data for which the search is to be performed. The source data may be any data whose relationships allow it to be structured in a tabular format. In other words, the source data may be stored in a tabular format (e.g., data in a relational database, data maintained by client/server applications built on top of relational databases, data in document stores and file systems that store table formatted data (e.g., CSV files or Excel spreadsheet files), etc.) or it may be stored in a non-tabular format but have such relationships as to allow it to be stored in a tabular format (e.g., data stored as comma separated values in a flat file, a password database or a single-sign-on system, relational data in an object-oriented database, etc.). In one embodiment, the search scope parameters also include one or more criteria for restricting the scope of the source data search, as will be discussed in more detail below. In one embodiment, the search scope specifier 102 provides a user interface facilitating the user input of search scope parameters. In other embodiments, the search scope specifier 102 receives search scope parameters identified by the user from an Application Programming Interface (API) or via a configuration file formatted in text or a defined data format (e.g., XML or binary format).
[0063] The detection condition identifier 104 is responsible for defining conditions for selecting content to be searched and conditions for taking actions upon detecting violations. The content selection conditions may specify characteristics associated with content that make the content suspicious and as such a candidate for searching. For example, an email message sent to an outside recipient by an employee who has a history of prior violations has a higher likelihood of containing sensitive data than an email message sent by a department manager to the CEO. The content selection conditions may identify certain groups of individuals (e.g., employees, executives, contractors, etc.) and content manipulation operations that these groups of individuals are not allowed to perform (e.g., transmission of sensitive data in email messages, printing of sensitive data, copying of sensitive data to a compact disk, etc.). Subsequently, when a prohibited content manipulation operation is detected, the relevant content is selected for searching.
[0064] The conditions for taking actions upon detecting violations identify which actions (e.g., report violations, intercept and stop messages containing detected violations, re-route messages containing detected violations, etc.) should be taken when a certain type of violation is detected.
[0065] In one embodiment, detection condition identifier 104 provides a user interface facilitating the user input of detection conditions. In other embodiments, the detection condition identifier 104 receives detection conditions as parameters supplied by an Application Programming Interface (API) or via a configuration file formatted in text or a defined data format (e.g., XML or binary format).
[0066] In one embodiment, a single user interface is used to facilitate user input of search scope parameters and user input of detection conditions.
[0067] The index creator 106 is responsible for creating an index for the source data defined by the search scope specifier 102. In one embodiment, the created index contains no copies of the database data, or contains only encrypted or hashed copies of database data. Such an index may be created using a tuple-storage mechanism that provides a data structure for storing multiple tuples associated with fragments of the database data. Examples of the tuple-storage mechanism include a hash table, a vector, an array, a tree, a list, or a table in a relational database management system. As will be described in more detail below, the data stored in the indices only retains the relative placement of the elements in the database in relation to other elements. For example, in the case of a hash table, the index may store, for each fragment of the database data (e.g., a data fragment inside a database cell), the fragment's hash code together with its row number and column number.
[0068] The search engine 108 is responsible for monitoring information content, selecting content that needs to be search, and performing a search of the selected content based on the search scope defined by the search scope specifier 102. The information content being monitored may include messages sent over the network (e.g., email messages), data processed by personal computing devices, data stored on data storage media of personal computing devices such as portable computers, desktop computers, Personal Digital Assistants, cell-phones, etc. The information content being monitored may contain free-form text that is not associated with any known tabular structure. In one embodiment, the content is selected for searching based on the detection conditions maintained by the detection identifier 104.
[0069] The action regulator 110 is responsible for evaluating detected violations, determining which actions to perform for each detected violation based on the detection conditions, and performing the identified actions.
[0070] In one embodiment, the system 100 consists of two components: a policy management system (PMS) and a data monitoring system (DMS). The PMS is responsible for defining the scope of the search and theft detection conditions, for creating an index for specified source data, and for sending data identifying the search scope and theft detection conditions, together with the source data index, to the DMS. The DMS is responsible for performing searches based on the information received from the PMS and performing appropriate actions when theft violations are detected by the search. In one embodiment, the PMS and the DMS are coupled to a computer network that communicates any of the standard protocols for the exchange of information. In one embodiment, the two subsystems (PMS and DMS) run on one Local Area Network (LAN). However, the PMS and DMS may be incorporated into the same physical or logical system. In another embodiment, the PMS and DMS may not necessarily reside on the same LAN. The PMS may reside on the same LAN as the data source, but the DMS may reside on a different LAN that is separated from the LAN on which PMS resides. In this configuration, the two distinct LANs may ultimately be coupled together via the Internet but separated by firewalls, routers, and/or other network devices. This is an advantageous configuration for the case where a company wants to restrict another company that needs their database data (such as a law firm or marketing agency) from violating the first company's database data policy.
[0071] In another embodiment, the system 100 is directed to monitoring actions taken by a user of a personal computing device to detect user operations that may involve a potential misuse of data (e.g., saving or accessing restricted source data on any storage device on the computing system, using restricted source data in an application, printing restricted source data, using restricted source data in any network communication protocol, etc.). In this configuration, the PMS component of the system 100 may reside on a server and the DMS component of the system 100 may reside on a device coupled to the server via a public network (e.g., the Internet) or a private network (e.g., LAN).
[0072] FIG. 2 is a flow diagram of one embodiment of a process for protecting data of an organization. The process is performed by processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a general purpose computer system or a dedicated machine), or a combination of both.
[0073] Processing logic begins by receiving user input pertaining to search scope parameters (processing block 202). The search scope parameters identify source data and specify other parameters that will be described in more detail below.
[0074] At processing block 204, processing logic defines, based on the user input, the scope of a search for information from any random rows of the source data.
[0075] At processing block 206, processing logic identifies detection conditions based on relevant user input. The detection conditions include conditions for selecting content to be searched (e.g., content manipulation operations that cannot be performed by a certain class of individuals) and conditions for taking actions responsive to detected matches. The user input concerning detection conditions may be provided together with, or independently from, the user input pertaining to the search scope parameters.
[0076] Subsequently, at processing block 208, processing logic monitors content that may be subject to violations and selects the content to be searched based on the detection conditions.
[0077] At processing block 210, processing logic searches the content based on the defined scope. If processing logic detects a match (decision box 212), processing logic determines which action to take based on the detection conditions (processing block 214). Alternatively, process 200 ends.
Search Scope Definition
[0078] As discussed above, the scope of a search is defined based on user input. The search is intended to find, in free form text, information from any random rows of source data. The source data may be stored in a tabular format or a non-tabular format. If the source data is stored in a non-tabular format, it is converted, prior to the search, to a tabular format based on relationships among its elements.
[0079] The user input includes various parameters pertaining to the scope of the search. These search scope parameters may identify the source data and specify columns in the source data. In one embodiment, the columns are specified to request that the matches returned by the search include information from any single row of the source data and that the information from the single row include data from each of the specified columns.
[0080] In one embodiment, the search scope parameters specify a value for a particular column. This column value is specified to request that the matches returned by the search include information from any single row of the source data, that the information from the single row include data from the particular column, and that this data be equal to the specified value.
[0081] In one embodiment, the search scope parameters provide a minimum number of columns, in addition to the specified columns from the source data. The minimum number of columns is provided to request that the matches returned by the search include information from any single row of the source data and that the information from the single row include data from at least this number of the specified columns.
[0082] In one embodiment, the search scope parameters specify exclusion columns. The exclusion columns are specified to request that the matches returned by the search include information from any single row of the source data and that the information from the single row exclude data from any of the specified exclusion columns.
[0083] In one embodiment, the search scope parameters specify a minimum number of rows to request that the matches returned by the search include information from at least this number of random rows of the source data.
[0084] In one embodiment, the user input pertaining to the search scope parameters is facilitated via a user interface. FIGS. 3A-3D illustrate exemplary user interfaces that facilitate user input of search scope parameters, according to one embodiment of the present invention. The search scope parameters shown herein are arbitrary and modifiable in various areas of the user interfaces.
[0085] Referring to FIG. 3A , a user interface 300 allows a user to specify the name 302 of the source data and the file name 304 containing the source data. The user interface 300 also allows the user to perform field mapping 306 between data source fields and system column names.
[0086] Referring to FIG. 3B , a user interface 320 allows a user to provide search scope parameters associated with source data 330. Specifically, the user interface 330 allows the user to specify inclusion columns 322, a minimum number of inclusion columns 326, exclusion columns 324, a minimum number of rows (i.e., incident minimum) 328. According to the example illustrated in FIG. 3B , the specified search scope parameters require that a match returned by the search include information from at least one random row of the source data 330, that the information from one row contain data from at least two of the checked inclusion columns 322, and that this information exclude data from any of the combined columns 324.
[0087] Referring to FIG. 3C , a user interface 340 displays various combinations of search scope parameters associated with source data 348. For a first combination 342, the specified search scope parameters require that a match returned by the search include information from at least one row (minimum matches 352) of the source data 348 and that the information from one row contain data from at least one of three specified columns 350.
[0088] For a second combination 344, the specified search scope parameters require that a match returned by the search include information from at least one row (minimum matches 358) of the source data 348 and that the information from one row contain data from at least two of four specified columns 354 and exclude matches confined to the fields specified in 356.
[0089] For a third combination 346, the specified search scope parameters require that a match returned by the search include information from at least 10 possibly non-adjacent rows (minimum matches 362) of the source data 348 and that the information from each of the 10 rows contain data from both columns 360.
[0090] Referring to FIG. 3D , a user interface 370 displays search scope parameters associated with source data 372. These search scope parameters require that a match returned by the search include information from at least one row (minimum matches 376) of the source data 372, that the information from one row contain data from at least two of specified columns 374, and that this information include data matching keywords 378 and 380 and expression 382.
[0091] In addition, the user interface 370 displays detection conditions that specify which content should be subjected to searching. According to these conditions, the content will be selected for searching if certain content matching rules are satisfied (e.g., the recipient of the content matches pattern 386, and the content is included within an attachment of type 388 and the size of the attachment is less than size 50 k specified by 390.
Exemplary Search Techniques
[0092] As discussed above, once the content is selected for searching, it is searched based on the scope defined as discussed above. In one embodiment, a search is performed using an abstract data structure (index) derived from source data. In one embodiment, this index contains no copies of the source data, or contains only encrypted or hashed copies of the source data. This embodiment specifically avoids storing any representation of the data itself so that, in the case of a hacker breaking into the host that runs the DMS (which utilizes the index when performing content searches as discussed above), the data that is exposed to theft is inconsequential. The index may be created using a tuple-storage mechanism that provides a data structure for storing multiple tuples associated with fragments of the database data. Examples of the tuple-storage mechanism include a hash table, a vector, an array, a tree, a list, or a table in a relational database management system. In the process described below, the data stored in the indices only retains the relative placement of the elements in the database in relation to other elements. For example, in the case of a hash table, the index may store, for each fragment of the database data (e.g., a data fragment inside a database cell), the fragment's hash code together with its row number, column number and type of the column.
[0093] In another embodiment, indices contain fragments of the intellectual property that is under protection, thus reducing the value of the solution by exposing that information to security threats.
[0094] In yet another embodiment, copies of a small amount of frequently used strings and numbers from the database that represent a large proportion of the data in the system is still stored directly in the index along with the rest of the information on relative placement of data in the database table(s). This is done by storing copies of these common strings themselves, instead of hash codes. As a result, indices may include the row numbers, column numbers, and type of the source data, but instead of storing a hash code it stores the string itself. For the rest of the cells of the database that are not quite so common, only the row numbers, column numbers, and type of the source data are stored while specifically not storing copies of these strings. This approach uses the fact that the statistical distribution of string and numeric data in databases is often skewed so that the most common terms account for a very large percentage of the overall volume of data stored. Storing these common terms in a separate index helps index query efficiency since the small number of common terms accounts for a large proportion of the queries, and these queries can be run using standard quick techniques from the literature (e.g., hash table lookups, bitmaps, etc.). The reason that this is not a security vulnerability is that this small number of terms that account for a disproportionate share of volume of source data are the least valuable pieces of data. The terms “John” and “Smith” are very common inside databases that contain names, but the theft of these terms is relatively worthless. In this embodiment, the system is still carefully avoiding storing copies of data of less-common terms of higher value (e.g., credit card numbers, SSN, uncommon names, etc.).
[0095] FIG. 4 is a flow diagram of one embodiment of a process for indexing the source data. The process is performed by processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a general purpose computer system or a dedicated machine), or a combination of both.
[0096] Referring to FIG. 4 , processing logic begins with determining whether the source data is stored in a standard tabular format (processing box 402). If not, processing logic converts the source data into a standard tabular format (processing block 404). Each cell in the resulting table stores a fragment of the source data. In one embodiment, each data fragment is a token. A token may be a single word or a cluster of words (e.g., words enclosed in quotation marks). For example, while the word “this” may represent a token stored in a database cell, the phrase “this token” may also represent a standalone token if it is stored as a single string in a database cell.
[0097] Next, processing logic creates a tuple-storage structure derived from the source data (processing block 406). A tuple-storage structure provides a mechanism for storing multiple tuples associated with the fragments of the source data. Examples of tuple-storage structures include a hash table, a vector, an array, a tree or a list. Each type of the tuple-storage structure is associated with a method for retrieving a set of tuples for any given content fragment (the set of tuples may be empty if no match is found in the tuple-storage structure).
[0098] Further, processing logic stores information about the position of each data fragment within the source data in a corresponding tuple (processing block 408). In one embodiment, the information about the position of a data fragment includes the number of a row storing the data fragment in the source data. In another embodiment, this information also includes the number of a column storing the data fragment in the source data and optionally the data type of the column.
[0099] Afterwards, processing logic sorts the tuples in a predetermined order (e.g., in the ascending lexicographic order) (processing block 410).
[0100] Thus, the resulting abstract data structure (i.e., the index) only contains information about the relative placement of data records in the context of the larger whole but does not include any fragments of the source data itself.
[0101] In one embodiment, the contents of the index are treated cryptographically (e.g., with a hash function or using an encryption function with a cryptographic key) to further secure the index from theft.
[0102] Exemplary search techniques will now be described in more detail. FIG. 5 is a flow diagram of one embodiment of a process for searching information content for source data. The process is performed by processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a general purpose computer system or a dedicated machine), or a combination of both.
[0103] Referring to FIG. 5 , processing logic begins with receiving information content (processing block 502). The information content includes free-from text and may be included in a file (e.g., an archived email message stored on a hard drive of a computer) or in a block of data transmitted over a network (e.g., an email message transmitted over a network using any type of a network protocol). As discussed above the information content to be searched may be selected based on theft detection conditions specified by the user.
[0104] Next, processing logic detects in the information content a sequence of content fragments that may possibly contain a portion of source data (processing block 504). The detected sequence of content fragments may be a set of adjacent or non-adjacent tokens within the information content. Each token may correspond to either a word or a phrase. The detected sequence of content fragments may be a portion of the received information content or the entire information content. In another embodiment, the detected sequence of content fragments is considered as a set of subsets of tokens, in which each subset of tokens may possible contain a portion of source data.
[0105] In one embodiment, processing logic decides that a sequence of content fragments may possibly contain a portion of the source data upon determining that the sequence of content fragments resembles column-formatted data. This determination may be made by parsing the received information content to identify separated lines (as may be indicated, for example, by tags <cr> or <cr><lf>) and finding that these separated lines contain a similar number of tokens and optionally the similar data types of the tokens.
[0106] In another embodiment, processing logic decides that a sequence of content fragments may possibly contain a portion of the source data upon parsing the entire information content and searching blocks of contiguous tokens for source data. In one embodiment, the blocks of contiguous tokens are defined based on user-specified parameters such as a user-specified width of each block and a user-specified position of each block within the information content (e.g., the user may require that the two adjacent blocks be separated by a certain number of tokens).
[0107] In yet another embodiment, processing logic decides that a sequence of content fragments may possibly contain a portion of the source data upon finding in the information content an expression of a predefined format. Such expression may be, for example, an account number, a social security number, a credit card number, a phone number, a postal code, an email address, text formatting indicating a monetary or numeric value (e.g., “$” signs together with digits), etc. Once the expression is found, processing logic decides that a region of text surrounding the expression may possibly contain a portion of the source data. The size of this region may be defined by a predetermined number of tokens on each side of the found expression.
[0108] In yet another embodiment, processing logic decides that a sequence of content fragments may possibly contain a portion of the source data upon determining that the word usage or the word distribution in the information content (or in some portion of the information content) resembles a statistical pattern that indicates a possible containment of the source data in the information content.
[0109] In still another embodiment, processing logic decides that a sequence of content fragments may possibly contain a portion of the source data upon determining that certain properties associated with the received information content indicate a possible containment of the source data in the information content based on the history of previous violations. These properties may include, for example, the destination of the information content (e.g., a recipient of an electronic message), the origin of the information content, the time of transmission associated with the information content, the size of transmission associated with the information content, the types of files contained in the transmission (e.g., multipurpose Internet mail extension (MIME) types of files), etc. In one embodiment, the history of previous violations is maintained by identifying, for each detection of source data, the properties of the information content in which the source data was detected and recording these properties in a previous violation database. Subsequently, when processing logic decides whether a sequence of content fragments within the new information content may possibly contain a portion of source data, processing logic identifies the properties of the new information content and searches the previous violation database for these properties. If a match is found, processing logic determines whether the previous violations associated with the matching property indicate a possible containment of source data in the new information content. This indication may be based on the number of previous violations associated with the matching property or the frequency of previous violations associated with the matching property. For example, this indication may be based upon the total number of violations that a particular sender has committed, or the frequency of those violations over a given time period.
[0110] Afterwards, upon detecting a sequence of content fragments that may possibly contain a portion of the source data, processing logic makes a determination as to whether any subset of these content fragments matches a subset of the source data and is in accordance with the search scope parameters discussed above (processing block 506).
[0111] FIGS. 6A-6C are flow diagrams of various exemplary embodiments of a process to find, for a subset of content fragments, a match satisfying search scope parameters in an abstract data structure derived from source data. The process is performed by processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a general purpose computer system or a dedicated machine), or a combination of both.
[0112] Referring to FIG. 6A , processing logic begins with parsing the sequence of content fragments identified at processing block 504 of FIG. 5 into content fragments (e.g., tokens). Then, for each content fragment, processing logic searches the abstract data structure for a set of matching tuples (processing block 602). For example, a word “Smith” contained in the information content may have several occurrences in the source data that are reflected in the abstract data structure. Specifically, each of these occurrences has a corresponding tuple in the abstract data structure. During the search, processing logic retrieves a set of tuples corresponding to the occurrences of the word “Smith” in the source data. Each tuple stores information about the position of this data fragment within a database or a table storing the source data. In one embodiment, the positional information includes the row number of a cell storing the data fragment. In another embodiment, the positional information also includes a column number of this cell and optionally the data type of the column.
[0113] Next, processing logic combines the matching tuple sets found for all the content fragments (processing block 604) and then groups the combined matching tuple sets by row numbers into groups L (processing block 606). As a result, each group L (referred to herein as an accumulator) contains matching tuple sets that all have the same column number, i.e., the matching tuple sets in each group L correspond to fragments of the source data that all appear to be from the same row in the database.
[0114] Further, processing logic sorts the groups L by the number of matching tuple sets contained in each group (processing block 608) and, in one embodiment, selects those groups that have tuple sets with distinct column numbers (processing block 610). Afterwards, processing logic determines whether any of the selected groups satisfy search scope parameters (processing block 612).
[0115] FIG. 6B illustrates one exemplary embodiment of a process for determining whether any selected groups of tuple sets satisfy search scope parameters.
[0116] Referring to FIG. 6B , processing logic begins with determining whether the search scope parameters specify inclusion columns (decision box 652). If not, processing logic proceeds to decision box 664. If so, processing logic determines whether the search scope parameters specify a minimum number M of inclusion columns (decision box 654). If number M is specified, processing logic searches for groups with tuples from at least M number of the inclusion columns (processing block 660) and determines whether any such groups are found (i.e., the number of found groups is greater than 0) (decision box 662). If the determination made at decision box 662 is positive, processing logic proceeds to decision box 664. If the determination made at decision box 662 is negative, processing logic decides that no violation has been detected (processing block 680).
[0117] If number M is not specified (decision box 654), processing logic searches for groups with tuples from each specified inclusion column (processing block 656) and determines whether any such groups are found (decision box 658). If the determination made at decision box 658 is positive, processing logic proceeds to decision box 664. If the determination made at decision box 658 is negative, processing logic decides that no violation has been detected (processing block 680).
[0118] At decision box 664, processing logic determines whether the search scope parameters specify any key words or expressions. If not, processing logic proceeds to decision box 670. If so, processing logic searches for groups with tuples matching the specified keywords or expressions (processing block 666) and determines whether any such groups are found (decision box 668). If the determination made at decision box 668 is positive, processing logic proceeds to decision box 670. If the determination made at decision box 668 is negative, processing logic decides that no violation has been detected (processing block 680).
[0119] At decision box 670, processing logic determines whether the search scope parameters specify exclusion columns. If not, processing logic proceeds to decision box 676. If so, processing logic searches for groups with tuples that are not from all of the exclusion columns (processing block 672) and determines whether any such groups are found (decision box 674). If the determination made at decision box 672 is positive, processing logic proceeds to decision box 676. If the determination made at decision box 672 is negative, processing logic decides that no violation has been detected (processing block 680).
[0120] At decision box 676, processing logic determines whether the search scope parameters specify a minimum number L of rows. If not, processing logic decides that a violation is detected (processing block 682). If so, processing logic determines whether the most recent number of found groups is not less than L (decision box 678). If this determination is positive, processing logic decides that a violation is detected (processing block 682). If the determination made at decision box 678 is negative, processing logic decides that no violation has been detected (processing block 680).
[0121] FIG. 6C illustrates an alternative exemplary embodiment of a process for determining whether any selected groups of tuple sets satisfy search scope parameters.
[0122] Referring to FIG. 6C , processing logic begins with receiving parameter m that identifies the minimum number of inclusion columns (i.e., data source columns whose data needs to be included in the search result) (processing block 682).
[0123] Next, processing logic receives parameter S specifying the set of inclusion columns and confirms that |S| is greater or equal to m (processing block 684).
[0124] At processing block 686, processing logic receives parameter r specifying the minimum number of rows. Parameter r requires that the search result contain data from at least r rows of the source data.
[0125] At processing block 688, processing logic receives parameter E specifying a set of exclusion columns (i.e., data source columns whose data has to be excluded from the search result) and confirms that for each e member if E, |e| is equal to m.
[0126] At processing block 690, processing logic searches text T for the largest match group G in which:
- [0127] (a) each components is a subset g of text T that contains tokens from the same row of data source D,
- [0128] (b) each token from g is an element from a column in D specified by S,
- [0129] (c) |g|>=m, and
- [0130] (d) tokens of g do not contain data from exclusion columns E.
[0131] At decision box 692, processing logic determines whether |G| is greater than r. If so, processing logic decides that a match is detected (processing block 694). If not, processing logic decides that no match is detected (processing block 696).
[0132] Exemplary embodiments of a search process will now be described. FIGS. 7A-7C are flow diagrams of alternate embodiments of a process for searching an incoming message using a hash table index of source data. The process is performed by processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a general purpose computer system or a dedicated machine), or a combination of both.
[0133] Referring to FIG. 7A , processing logic begins with parsing an incoming message (processing block 702). Next, processing logic determines whether the parsed portions of the incoming message contain column-formatted data (processing box 704). In one embodiment, lexical analysis may be used to identify lines in the parsed portions of the incoming message (e.g., by finding tags <cr> or <cr><lf> that are used to separate lines) and then detecting that the number of tokens found in adjacent lines is identical in number and in type. In one embodiment, processing logic stores the type of each token, along with the total number of tokens.
[0134] If the determination made at processing box 704 is negative, processing transitions to processing block 702. Otherwise, processing transitions to processing block 706 where processing logic sets i equal to the first line that resembles column-formatted data.
[0135] Next, processing logic applies a hash function H(k) to each token in line i (processing block 708), finds a set of tuples at H(k) in the hash table for each token in line i, adds the tuples to list L, and regroups list L into a set of accumulators (processing block 712) in which each individual accumulator's tuples have the same row number value. Further, processing logic sorts that list L by the length of each Ai (processing block 714) and checks for unique occurrences of columns in sorted list L (processing block 716). At processing block 710, optional pre-processing logic may be performed to filter the tokens before insertion into list L so that only those tuples with type matching the lexical type of the original token k are added to L. It should be noted that in some other embodiments checking for unique occurrences of columns may be skipped for reasons of speed or simplicity. In yet other embodiments, tuples are simple “singletons” containing row numbers only (i.e., no column number and no type indicator).
[0136] Afterwards, if the incoming message contains more lines that resemble column-formatted data (processing box 718), processing logic increments i to the next line that resembles column-formatted data (processing block 722) and the process transitions to processing block 706. Otherwise, processing logic reports lines of text with Ai that exceed the predetermined size and have unique column numbers (processing block 720).
[0137] Referring to FIG. 7B , processing logic begins with receiving user-specified parameters of “width” (W) and “jump” (J) (processing block 732) and parsing an incoming message (processing block 734). Parameter W specifies the number of contiguous tokens in each block of contiguous tokens that is to be searched during a single iteration and parameter J specifies the required number of tokens between the two adjacent blocks.
[0138] Next, processing logic sets the value of the location variable (St) to zero (processing block 736) and defines a block (“textblock”) to be searched by collecting W contiguous tokens of the message starting at St (processing block 738).
[0139] Further, processing logic applies a hash function H(k) to each token in the textblock (processing block 740), finds a set of tuples at H(k) in the hash table for each token in the textblock, adds the tuples that have the same type as the corresponding tokens in the textblock to list L (processing block 742), regroups list L into a set of accumulators (processing block 744), sorts that list L by the length of each Ai (processing block 746) and checks for unique occurrences of columns in sorted list 1 (processing block 748).
[0140] Afterwards, processing logic increments St by J number of tokens (processing block 750) and determines whether location St is still within the message (processing box 752). If the determination is positive, the process transitions to processing block 738. Otherwise, processing logic reports textblocks with Ai that exceed the predetermined size and have unique column numbers (processing block 758).
[0141] Referring to FIG. 7C , processing logic begins with parsing an incoming message (processing block 764) and looking for a first expression having a user-specified format (processing block 766). Such expression may be, for example, an account number, a social security number, a credit card number, text formatting indicating a monetary or numeric value (e.g., “$” signs together with digits), etc. If the matching expression is not found, the process transitions to processing block 764. Otherwise, the process transitions to processing block 768 where processing logic defines a block (“textblock”) to be searched by collecting W contiguous tokens before and after the matching expression. For example, the textblock may consist of 10 tokens immediately preceding the matching expression, the matching expression itself and 10 tokens immediately following the matching expression.
[0142] Further, processing logic applies a hash function H(k) to each token in the textblock (processing block 770), finds a set of tuples at H(k) in the hash table for each token in the textblock, adds the tuples that have the same type as the corresponding tokens in the textblock to list L (processing block 772), regroups list L into a set of accumulators (processing block 774), sorts that list L by the length of each Ai (processing block 776) and checks for unique occurrences of columns in sorted list L (processing block 778).
[0143] Afterwards, processing logic determines whether the message has anymore expressions of the user-specified format (processing box 780). If this determination is positive, the process transitions to processing block 768. Otherwise, processing logic reports textblocks with Ai that exceed the predetermined size and have unique column numbers (processing block 782).
Comparison with the Prior Art
[0144] Database query mechanisms are significantly different from the teachings described herein. One difference is that B-trees actually contain fragments of the database tables that they index. In the approach described above, there are no copies of the database data stored inside the index. The reason that this is important is that—as mentioned above—the DMS has to have a copy of the index in order to protect the data from escape; however the DMS is also best deployed in a position in the network where it may be exposed to significant threats. Keeping the index that the DMS uses free of any components of the database data is a key requirement.
[0145] Another difference between standard database query mechanisms and the invention outlined here has to do with the types of queries that are required. The standard set of queries used in relational databases is based on predicate logic using connectives like AND and OR. This basic system does not work well for detection of database data that is typically cut-and-paste into email and webmail messages. Database data that is cut-and-paste into email messages is typically from reports and will often contain data in each line that is extraneous and not found inside the database table. An example could be an email message that contains, for example, account information for a bunch of customers. Such a message will contain plenty of records from the core database that requires protection, e.g., first name, last name, social-security number, etc., but could also contain information not in the core database tables. A typical example is information that is “joined” from other databases. Another example is simple line formatting tokens that separate fields of database data. Because of the possibility of this extra data that's typically found on each of these lines, the standard predicate logic connectives like AND and OR applied to each token on the line of an outgoing message produce either too many hits (as is the case with OR) or zero hits (as is the case with AND). In the description herein, the system is able to detect the presence of n or more tokens that are all from the same row of a database table, even in the case where n is much smaller than the total number of tokens in the line. This is another significant difference between the present invention and the prior art mentioned above for database and document query mechanisms.
[0146] There are several major differences between the techniques described above and information retrieval technologies. Firstly, the indices for these systems contain (inside the concordances) the same terms that are stored in the database that is to be protected. Here again, since the system deploys this index into a location on the network that is potentially under hacker threat; this is a definite disadvantage. Secondly, these query systems run Boolean queries using the forms of predicate logic like AND and OR. As mentioned above, this approach is at a distinct disadvantage for detecting database records that have been possibly “joined” with extraneous data from other tables.
[0147] The technique of file shingling is similar to, but substantially different from the technique described herein. In file shingling, the subject of interest is text data (prose, software, outlines, etc.). In the techniques described here, the focus is on protecting database data. One difference is that database data from a given database table may appear with the row order or column order permuted arbitrarily in the test message. These permutations are the simple result of the query mechanisms typically applied to extract database data. A database query could result in a block of database data that comes in arbitrary column order, and arbitrary row order. For this reason, the basic technique of file shingling will not work if applied to database data. File shingling assumes that the same linear sequence is followed between the protected document and the test document.
[0148] There are many important differences between Internet content filtering systems and the teachings described herein. As mentioned above, Internet content filtering systems are based on keyword searches. The novel techniques described above build an abstract data structure from the database data that it seeks to protect. This abstract data structure does not contain fragments of the text it is trying to protect. A keyword filtering system must contain some representation of the text that it is searching for in order to run its queries. The second major difference is that these Internet content filtering systems are not intended to protect database data. Using regular expression matching to detect violations of an organizations privacy policy on database data will also lead to a very inaccurate method of detection. These systems are primarily applied to stop employee abuse of the Internet as it relates to pornographic or abusive content and language. Such systems, if applied to the protection of database data, would use regular expressions to match database records. This would also result in transferring fragments of the database data to the computer on the network where security risks are maximized.
An Exemplary Computer System
[0149] FIG. 8 is a block diagram of an exemplary computer system that may perform one or more of the operations described herein. Referring to FIG. 8 , computer system 800 may comprise an exemplary client 850 or server 800 computer system. Computer system 800 comprises a communication mechanism or bus 811 for communicating information, and a processor 812 coupled with bus 811 for processing information. Processor 812 includes a microprocessor, but is not limited to a microprocessor, such as, for example, Pentium™, PowerPC™, Alpha™, etc.
[0150] System 800 further comprises a random access memory (RAM), or other dynamic storage device 804 (referred to as main memory) coupled to bus 811 for storing information and instructions to be executed by processor 812. Main memory 804 also may be used for storing temporary variables or other intermediate information during execution of instructions by processor 812.
[0151] Computer system 800 also comprises a read only memory (ROM) and/or other static storage device 806 coupled to bus 811 for storing static information and instructions for processor 812, and a data storage device 807, such as a magnetic disk or optical disk and its corresponding disk drive. Data storage device 807 is coupled to bus 811 for storing information and instructions.
[0152] Computer system 800 may further be coupled to a display device 821, such as a cathode ray tube (CRT) or liquid crystal display (LCD), coupled to bus 811 for displaying information to a computer user. An alphanumeric input device 822, including alphanumeric and other keys, may also be coupled to bus 811 for communicating information and command selections to processor 812. An additional user input device is cursor control 823, such as a mouse, trackball, trackpad, stylus, or cursor direction keys, coupled to bus 811 for communicating direction information and command selections to processor 812, and for controlling cursor movement on display 821.
[0153] Another device that may be coupled to bus 811 is hard copy device 824, which may be used for printing instructions, data, or other information on a medium such as paper, film, or similar types of media. Furthermore, a sound recording and playback device, such as a speaker and/or microphone may optionally be coupled to bus 811 for audio interfacing with computer system 800. Another device that may be coupled to bus 811 is a wired/wireless communication capability 825 to communication to a phone or handheld palm device.
[0154] Note that any or all of the components of system 800 and associated hardware may be used in the present invention. However, it can be appreciated that other configurations of the computer system may include some or all of the devices.
[0155] Whereas many alterations and modifications of the present invention will no doubt become apparent to a person of ordinary skill in the art after having read the foregoing description, it is to be understood that any particular embodiment shown and described by way of illustration is in no way intended to be considered limiting. Therefore, references to details of various embodiments are not intended to limit the scope of the claims which in themselves recite only those features regarded as essential to the invention.
Claims
We claim:
1. A computer-implemented method comprising:
receiving user input identifying tabular source data, the tabular source data representing data that has a tabular structure;
receiving user input specifying parameters for a search of a plurality of documents, the search intended to find, in any of the plurality of documents, information from at least one random row within the tabular source data, each of the plurality of documents including freeform text, the search parameters identifying a plurality of columns within the tabular source data;
defining, based on the search parameters, a scope of the search to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from at least one random row within the tabular source data, the matched sub-set of data including a sub-set of tokens matching the information from any single row within the tabular source data and containing a token corresponding to one of the plurality of columns, the token having a specified value when the specified value is contained in the search parameters; and
searching each of the plurality of documents for the information from at least one random row within the tabular data source using the defined scope.
2. The method of claim 1 wherein the matched sub-set of data fragments includes a set of non-adjacent tokens within any of the plurality of documents being searched.
3. The method of claim 1 wherein the matched sub-set of data fragments includes a set of adjacent tokens within any of the plurality of documents being searched.
4. The method of claim 1 wherein the search is defined to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from any single row within the tabular source data and includes data from each of the plurality of columns identified by the search parameters.
5. The method of claim 1 wherein:
the search parameters further specify a number that represents a minimum number of columns from the plurality of columns; and
the search is defined to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from any single row within the tabular source data and includes data from at least the minimum number of columns.
6. The method of claim 1 wherein the search parameters specify a number that represents a minimum number of said any one or more rows within the tabular data source.
7. The method of claim 1 wherein:
the search parameters further specify one or more exclusion columns within the plurality of columns; and
the search is defined to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from any single row within the tabular source data tux' excludes data from each of the one or more exclusion columns.
8. The method of claim 1 wherein the user input is received via a graphical user interface.
9. The method of claim 1 wherein the user input is received as one or more parameters supplied by any one within the group selected from an Application Programming Interface, a configuration file formatted in text, and a configuration file formatted in a defined data format.
10. The method of claim 1 wherein:
the search parameters specify one or more content matching rules for selecting one or more of the plurality of documents for searching.
11. The method of claim 10 further comprising:
selecting one or more of the plurality of documents for searching if the one or more content matching rules are satisfied.
12. A computer-implemented system comprising:
a computer processor and a main memory;
a user interface to receive user input identifying tabular source data, the tabular source data representing data that has a tabular structure, and to receive user input specifying parameters for a search of a plurality of documents, the search parameters identifying a plurality of columns within the tabular source data, the search intended to find, in any of the plurality of documents, information from at least one random row within the tabular source data, each of the plurality of documents including free-form text;
a search scope specifier to define, based on the search parameters, a scope of the search to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from at least one random row within the tabular source data, the matched sub-set of data including a sub-set of tokens matching the information from any single row within the tabular source data and containing a token corresponding to one of the plurality of columns, the token having a specified value when the specified value is contained in the search parameters; and
a search engine to search each of the plurality of documents for the information from at least one random row within the tabular data source using the defined scope.
13. The system of claim 12 wherein the search scope specifier is to define the search scope for finding, in any of the plurality of documents, a sub-set of data fragments that matches the information from any single row within the tabular source data and includes data from each of the plurality of columns identified by the search parameters.
14. The system of claim 12 wherein:
the search parameters specify a number that represents a minimum number of columns from the plurality of columns; and
the search scope specifier is to define the search scope for finding, in any of the plurality of documents, a sub-set of data fragments that matches the information from any single row within the tabular source data and includes data from at least the minimum number of columns.
15. The system of claim 12 wherein the search parameters specify a number that represents a minimum number of said any one or more rows within the tabular source data.
16. The system of claim 12 wherein:
the search parameters specify one or more exclusion columns within the plurality of column; and
the search scope specifier is to define the search scope for finding, in any of the plurality of documents, a sub-set of data fragments that matches the information from any single row within the tabular data source and excludes data from each of the one or more exclusion columns.
17. A computer-implemented apparatus comprising:
a computer processor and a main memory;
means for receiving user input identifying tabular source data, the tabular source data representing data that has a tabular structure;
means for receiving user input specifying parameters for a search of a plurality of documents, the search intended to find, in any of the plurality of documents, information from at least one random row within the tabular source data, each of the plurality of documents including freeform text, the search parameters identifying a plurality of columns within the tabular source data;
means for defining, based on the search parameters, a scope of the search to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from at least one random row within the tabular source data, the matched sub-set of data including a sub-set of tokens matching the information from any single row within the tabular source data and containing token corresponding to one of the plurality of columns, the token having a specified value when the specified value is contained in the search parameters; and
means for searching each of the plurality of documents for the information from at least one random row within the tabular data source using the defined scope.
18. The apparatus of claim 17 wherein the matched sub-set of data fragments includes a set of non-adjacent tokens within any of the plurality of documents being searched.
19. The apparatus of claim 17 wherein the matched sub-set of data fragments includes a set of adjacent tokens within the any of the plurality of documents.
20. The apparatus of claim 17 wherein the user input is received via a graphical user interface.
21. The apparatus of claim 17 wherein the user input is received as one or more parameters supplied by any one within the group selected from an Application Programming Interface, a configuration file formatted in text, and a configuration file formatted in a defined data format.
22. A computer readable storage medium that stores instructions, which when executed on a processor cause the processor to perform a method comprising:
receiving user input identifying tabular source data, the tabular source data representing data that has a tabular structure; receiving user input specifying parameters for a search of a plurality of documents, the search intended to find, in any of the plurality of documents, information from at least one random row within the tabular source data, each of the plurality of documents including freeform text, the search parameters identifying a plurality of columns within the tabular source data;
defining, based on the search parameters, a scope of the search to find, in any of the plurality of documents, a sub-set of data fragments that matches the information from at least one random row within the tabular source data, the matched sub-set of data including a sub-set of tokens matching the information from any single row within the tabular source data and containing a token corresponding to one of the plurality of columns, the token having a specified value when the specified value is contained in the search parameters; and
searching each of the plurality of documents for the information from at least one random row within the tabular data source using the defined scope.
23. The computer readable medium of claim 22 wherein the matched sub-set of data fragments includes a set of non-adjacent tokens within the any of the plurality of documents being searched.
24. The computer readable medium of claim 22 wherein the matched sub-set of data fragments includes a set of adjacent tokens within the any of the plurality of documents.
Patent Citations (48)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4858152(A) | 1989-08-01 | Estes | Applicant |
| US5212821(A) | 1993-05-01 | Gorin et al. | Applicant |
| US5379391(A) | 1995-01-01 | Belsan et al. | Applicant |
| US5384892(A) | 1995-01-01 | Strong | Applicant |
| US5577249(A) | 1996-11-01 | Califano | Applicant |
| US5739391(A) | 1998-04-01 | Ruppel et al. | Applicant |
| US5796948(A) | 1998-08-01 | Cohen | Applicant |
| US5832212(A) | 1998-11-01 | Cragun et al. | Applicant |
| US5835722(A) | 1998-11-01 | Bradshaw et al. | Applicant |
| US5883588(A) | 1999-03-01 | Okamura | Applicant |
| US5884033(A) | 1999-03-01 | Duvall et al. | Applicant |
| US5892905(A) | 1999-04-01 | Brandt et al. | Examiner |
| US5958015(A) | 1999-09-01 | Dascalu | Applicant |
| US5960080(A) | 1999-09-01 | Fahlman et al. | Applicant |
| US5996011(A) | 1999-11-01 | Humes | Applicant |
| US6047283(A) | 2000-04-01 | Braun | Applicant |
| US6055538(A) | 2000-04-01 | Kessenich et al. | Applicant |
| US6065056(A) | 2000-05-01 | Bradshaw et al. | Applicant |
| US6073142(A) | 2000-06-01 | Geiger et al. | Applicant |
| US6233618(B1) | 2001-05-01 | Shannon | Examiner |
| US6321224(B1) | 2001-11-01 | Beall et al. | Examiner |
| US6374241(B1) | 2002-04-01 | Lamburt | Applicant |
| US6442607(B1) | 2002-08-01 | Korn et al. | Applicant |
| US6604141(B1) | 2003-08-01 | Ventura | Examiner |
| US6618725(B1) | 2003-09-01 | Fukuda et al. | Applicant |
| US6636838(B1) | 2003-10-01 | Perlman et al. | Applicant |
| US6639615(B1) | 2003-10-01 | Majumdar | Applicant |
| US6714936(B1) | 2004-03-01 | Nevin, II | Applicant |
| US6732087(B1) | 2004-05-01 | Hughes et al. | Examiner |
| US6768986(B2) | 2004-07-01 | Cras et al. | Applicant |
| US6769032(B1) | 2004-07-01 | Katiyar et al. | Examiner |
| US6778979(B2) | 2004-08-01 | Grefenstette et al. | Applicant |
| US6779120(B1) | 2004-08-01 | Valente et al. | Applicant |
| US6871284(B2) | 2005-03-01 | Cooper et al. | Applicant |
| US6941466(B2) | 2005-09-01 | Mastrianni et al. | Applicant |
| US6965886(B2) | 2005-11-01 | Govrin et al. | Applicant |
| US6983186(B2) | 2006-01-01 | Navani et al. | Applicant |
| US7114185(B2) | 2006-09-01 | Moore et al. | Applicant |
| US7130885(B2) | 2006-10-01 | Chandra et al. | Applicant |
| US7191252(B2) | 2007-03-01 | Redlich et al. | Applicant |
| US7237008(B1) | 2007-06-01 | Tarbotton et al. | Applicant |
| US2001/0037324(A1) | 2001-11-01 | Agrawal et al. | Examiner |
| US2002/0198766(A1) | 2002-12-01 | Magrino et al. | Examiner |
| US2003/0093518(A1) | 2003-05-01 | Hiraga | Applicant |
| US2004/0039991(A1) | 2004-02-01 | Hopkins et al. | Examiner |
| US2004/0225645(A1) | 2004-11-01 | Rowney et al. | Applicant |
| US2005/0216771(A1) | 2005-09-01 | Malcom | Applicant |
| GB2343030(A) | 2000-04-01 | Applicant |
Non-Patent Literature (44)
- Oracle8™ Tuning, Release 8.0, Dec. 1997, Oracle®.Examiner
- PCT Search Report PCT/US03/30178 dated Mar. 11, 2004, 5 pages.Applicant
- Kaufman, et al., “Network Security-Private Communication in a Public World,” 1995, Prentice, Hall PTR, p. 80.Applicant
- Clearwell Systems The Clearwell E-Discovery Platform: Processing, http://www.clearwellsystems.com/products/e-discovery-processing.php, Downloaded Feb. 20, 2008, 2 pages.Applicant
- Clearwell Systems The Clearwell E-Discovery Platform: Review, http://www.clearwellsystems.com/products/e-discovery-review.php, Downloaded Feb. 20, 2008 2 pages.Applicant
- Clearwell Systems The Clearwell E-Discovery Platform: Search &Cull-Down, http://www.clearwellsystems.com/products/e-discovery-search-cull.php, Downloaded Feb. 20, 2008 1 page.Applicant
- Attenex, Attenex Patterns Suite, http://www.attenex.com/products—services/attenex—patterns—suite.aspx, Downloaded Feb. 20, 2008, 2 pages.Applicant
- Autonomy, Autonomy Group product overview, http://www.autonomy.com/content/products/index.en.html, Downloaded Feb. 20, 2008, 2 pages.Applicant
- Autonomy, Security, http://www.autonomy.com/content/Technology/Technology—Benefits/security, Feb. 20, 2008, 2 pages.Applicant
- Autonomy, Technology overview, http://www.autonomy.com/content/Technmology/index.en.html, Downloaded Feb. 20, 2008, 2 pages.Applicant
- Autonomy, Limitations of Other Approaches, http://www.autonomy.com/content/Technology/Limitations—Other—Approaches, Downloaded Feb. 20, 2008, 2 pages.Applicant
- Google, Google Search Appliance, http://www.google.com/enterprise/gsa/, Downloaded, Feb. 20, 2008, 2 pages.Applicant
- Guidance Software, EnCase® eDiscovery Suite, http://www.guidancesoftware.com/products/ediscovery—index.aspx, Downloaded Feb. 20, 2008, 2 pages.Applicant
- Oracle Secure Enterprise Search 10G, Mar. 2006, 8 pages.Applicant
- Alonso, Omar, et al, Oracle Secure Enterprise Search 10g, An Oracle Technical White Patper, Mar. 2006, 21 pages.Applicant
- Krishnaprasad, Muralidhar, et al, Oracle Searching Enterprise Applications (Siebel 7.8 and E-Business Suite 11i) with Oracle Secure Enterprise Search 10.1.8, An Oracle White Paper, Jan. 2007, 25 pages.Applicant
- Buchta, Stefan, Oracle Secure Enterprise Search Version 10.1.8.2, An Oracle Technical White Paper, Oct. 2007, 30 pages.Applicant
- Clearwell Systems, The Clearwell E-Discovery Platform®, http://www.clearwellsystems.com/products/e-discovery-platform, Downloaded Feb. 20, 2008 2 pages.Applicant
- Clearwell Systems, The Clearwell E-Discovery Platform: Analysis, http://www.clearwellsystems.com/products/e-discovery-analysis.php, Downloaded Feb. 20, 2008, 1 page.Applicant
- Clearwell Systems, The Clearwell E-Discovery Platform: Case Management, http://www.clearwellsystems.com/products/e-discovery-case-management, Downloaded Feb. 20, 2008 2 pages.Applicant
- Office Action for U.S. Appl. No. 10/247,002 mailed Mar. 3, 2006.Applicant
- Office Action for U.S. Appl. No. 10/247,002 mailed Aug. 21, 2006.Applicant
- Office Action for U.S. Appl. No. 10/247,002 mailed Jan. 23, 2007.Applicant
- Office Action for U.S. Appl. No. 10/247,002 mailed Sep. 17, 2007.Applicant
- Office Action for U.S. Appl. No. 10/247,002 mailed Dec. 12, 2007.Applicant
- Office Action for U.S. Appl. No. 10/247,002 mailed Jun. 18, 2008.Applicant
- Office Action for U.S. Appl. No. 10/431,145 mailed Oct. 23, 2006.Applicant
- Office Action for U.S. Appl. No. 10/431,145 mailed Jul. 26, 2007.Applicant
- Office Action for U.S. Appl. No. 10/431,145 mailed Feb. 25, 2008.Applicant
- Notice of Allowance for U.S. Appl. No. 10/431,145 mailed Aug. 20, 2008.Applicant
- Office Action for U.S. Appl. No. 10/607,718 mailed Feb. 10, 2006.Applicant
- Office Action for U.S. Appl. No. 10/607,718 mailed Jun. 28, 2006.Applicant
- Office Action for U.S. Appl. No. 10/607,718 mailed Nov. 15, 2006.Applicant
- Office Action for U.S. Appl. No. 10/607,718 mailed Jul. 10, 2007.Applicant
- Office Action for U.S. Appl. No. 10/607,718 mailed Jan. 8, 2008.Applicant
- Office Action for U.S. Appl. No. 10/607,718 mailed Jul. 3, 2008.Applicant
- Office Action for U.S. Appl. No. 10/892,982 mailed Jan. 23, 2007.Applicant
- Office Action for U.S. Appl. No. 10/892,982 mailed Sep. 17, 2007.Applicant
- Office Action for U.S. Appl. No. 10/892,982 mailed Apr. 8, 2008.Applicant
- Office Action for U.S. Appl. No. 10/892,615 mailed Apr. 27, 2007.Applicant
- Office Action for U.S. Appl. No. 10/892,615 mailed Dec. 12, 2007.Applicant
- Office Action for U.S. Appl. No. 10/892,615 mailed Apr. 21, 2008.Applicant
- Office Action for U.S. Appl. No. 11/057,988 mailed Aug. 18, 2008.Applicant
- Office Action for U.S. Appl. No. 11/058,551 mailed Sep. 9, 2008.Applicant