US 9,116,975 B2Grant

Systems and user interfaces for dynamic and interactive simultaneous querying of multiple data stores

Issue Date:2015-08-25

•16 Claims

•12 Drawing Sheets

Abstract

Embodiments of the present disclosure relate to a computer system and interactive user interfaces configured to enable efficient and rapid access to multiple different data sources simultaneously, and by an unskilled user. The unskilled user may provide simple and intuitive search terms to the system, and the system may thereby automatically query multiple related data sources of different types and present results to the user. Data sources in the system may be efficiently interrelated with one another by way of a mathematical graph in which nodes represent data sources and/or portions of data sources (for example, database tables), and edges represent relationships among the data sources and/or portions of data sources. For example, edges may indicate relationships between particular rows and/or columns of various tables. The table graph enables a compact and memory efficient storage of relationships among various disparate data sources.

Metadata

Assignee

PALANTIR TECHNOLOGIES INC.

Inventors

Ankit Shankar
Andrew Ash
Geoff Stowe
Thomas Petracca
Benjamin Duffield

Application Information

Application Number:US 14/504,103

Filing Date:2014-10-01

Priority Date:2013-10-18

Art Unit:2165

Classifications

IPC:

G06F7/00G06F17/30

Patent Drawings (12 sheets)

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57.

[0002] This application claims benefit of U.S. Provisional Patent Application No. 61/893,080, filed Oct. 18, 2013, and titled “TABLE GRAPH.” The entire disclosure of each of the above items is hereby made part of this specification as if set forth fully herein and incorporated by reference for all purposes, for all that it contains.

TECHNICAL FIELD

[0003] Embodiments of present disclosure relate to systems and techniques for accessing one or more databases in substantially real-time to provide information in an interactive user interface. More specifically, embodiments of the present disclosure relate to user interfaces for automatically and simultaneously querying multiple different data sets and/or different electronic collections of data.

BACKGROUND

[0004] The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.

[0005] Traditional database queries are generated and used by skilled computer programmers to access data from a data source, such as a database. Traditional database queries are useful in many fields (for example, scientific fields, financial fields, political fields, and/or the like). Typically, a computer programmer must determine the proper format for the query based on the type of database accessed, and must determine the parameters of the query users or analysts that are familiar with the requirements of the data needed. Some man-machine interfaces for generating reports in this manner are software development tools that allow a computer programmer to write and test computer programs. Following development and testing of the computer program, the computer program must be released into a production environment for use. Thus, this approach for generating queries may be inefficient because an entire software development life cycle (for example, requirements gathering, development, testing, and release) may be required even if only one element of the query requires changing, or one aspect of the database has changed. Furthermore, this software development life cycle may be inefficient and consume significant processing and/or memory resources.

[0006] Further, traditional queries must be formatted specifically as required by the type of data source accessed. Accordingly, traditional methods of database querying have difficulties with handling queries to various types of data sources at the same time.

SUMMARY

[0007] The systems, methods, and devices described herein each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure, several non-limiting features will now be discussed briefly.

[0008] Embodiments of the present disclosure relate to a computer system and interactive user interfaces configured to enable efficient and rapid access to multiple different data sources simultaneously, and by an unskilled user. For example, the unskilled user may provide simple and intuitive search terms to the system, and the system may thereby automatically query multiple related data sources of different types and present results to the user. Accordingly, the system may enable efficient unskilled user interactions with complex and disparate data sources, and efficient presentation of data (including search results) to the user.

[0009] In various embodiments, data sources in the system may be efficiently interrelated with one another by way of a mathematical graph (referred to herein as a “table graph”) in which nodes represent data sources and/or portions of data sources (for example, database tables), and edges represent relationships among the data sources and/or portions of data sources. For example, edges may indicate relationships between particular rows and/or columns of various tables. The table graph enables a compact and memory efficient storage of relationships among various disparate data sources. By comparison to previous methods, in which data from disparate sources of different types were usually re-copied to common data sources and/or updated to a common type, the present disclosure describes a system in which these steps need not be performed, and thus the system is more efficient from both processor usage and memory usage perspectives.

[0010] Further, embodiments of the present disclosure relate to a computer system designed to provide interactive, graphical user interfaces (also referred to herein as “user interfaces”) for enabling non-technical users to quickly and dynamically generate, edit, and update search queries. The user interfaces are interactive such that a user may make selections, provide inputs, and/or manipulate outputs. In response to various user inputs, the system automatically accesses one or more table graphs, formulates necessary database queries, traverses and queries associated data sources, obtains search results, and/or displays the search results to the user.

[0011] Various embodiments of the present disclosure enable search query generation and display in fewer steps, result in faster creation of outputs (such as search results), consume less processing and/or memory resources than previous technology, permit users to have less knowledge of programming languages and/or software development techniques, and/or allow less technical users or developers to create outputs (such as search results) than previous systems and user interfaces. Thus, in some embodiments, the user interfaces described herein are more efficient as compared to previous user interfaces, and enable the user to cause the system to automatically access and query multiple different data sources.

[0012] In some embodiments of the present disclosure, user interfaces are generated that enable a user to efficiently relate various different data sources in a mathematical graph.

[0013] In some embodiments, the system may automatically perform queries of data sources related in the table graph in parallel. Accordingly, the present system may be even more efficient over previous systems as the table graph enables parallel and automatic querying of multiple data sources so as to provide search results to the user with even greater speed and frees up processor resources for other tasks.

[0014] Further, as described herein, in some embodiments the system may be configured and/or designed to generate user interface data useable for rendering the various interactive user interfaces described. In these embodiments, the user interface data may be used by the system, and/or another computer system, device, and/or software program (for example, a browser program), to render the interactive user interfaces. The interactive user interfaces may be displayed on, for example, electronic displays (including, for example, touch-enabled displays).

[0015] According to an embodiment, a search system is disclosed that is configured to execute a search query, the search system comprising: one or more computing devices having hardware processors configured to execute instructions in order to: access a first data store of a first type storing at least a first data table; access a second data store of a second type different than the first type, the second data store storing at least a second data table; execute a table graph having a first node associated with the first data table, a second node associated with the second data table, and a link between the first node and the second node, the link indicating a first field of the first data table that is associated with a second field of the second data table, said executing comprising: looking up first information associated with a search query in the first data store; look up second information associated with the first information in the second data store; provide the second information for display or processing by the search system.

[0016] According to an aspect, at least one of the first field and the second field are full-text searchable.

[0017] According to another aspect, the link between the first node and the second node is a bi-directional link.

[0018] According to yet another aspect, the first type and the second type each include one or more of a relational data store, an object-oriented data store, a proprietary data store, a file-based data store, a hierarchical data store, a network data store, and an elastic-search data store.

[0019] According to another aspect, the table graph is executed via an application programming interface configured to format the second information as one or more data objects, wherein the data objects further comprise attributes and values defined by a user.

[0020] According to yet another aspect, the search query includes one or more regular expression rules.

[0021] According to another aspect, the table graph further comprises a third node associated with a third data table and wherein executing the table graph further comprises concurrently looking up the first information in the first data table and looking up a third information in the third data table.

[0022] According to yet another aspect, the lookups in the first data table and the third data tables are executed concurrently in response to the one or more computing devices automatically determining that the lookups are suitable for concurrent execution based on at least one of: query dependency, query complexity, history of query execution duration, usage statistics of the first, second, and/or third data stores, and/or predicted usage demand of the first, second, and third data stores.

[0023] According to another embodiment, a table graph system is disclosed that is configured to electronically communicate with at least one data store, the table graph system comprising: one or more physical computing devices having hardware processors configured to execution instructions in order to: receive instructions to add a first data table as a first node in a table graph; receive instructions to add a second data table as a second node in the table graph, wherein the first data table and the second data table are of different types; upon receiving instructions to add a relationship between the first and second nodes, add the relationship, wherein the relationship indicates a first field of the first data table is to be associated with a second field of the second data table, wherein the table graph is executable in order to access data stored in the first data table and subsequently data in the second data table based at least partly on the data stored in the first data table.

[0024] According to an aspect, the one or more physical computing devices are further configured to: receive instructions to add a third node linked with the first node and/or the second node; receive instructions to indicate the first node and the third node as concurrently processable, wherein the first node and the third node are executable concurrently in response to execution of the table graph.

[0025] According to another aspect, the one or more physical computing devices are further configured to: receive instructions to add a third node linked with the first node and/or the second node; receive instructions to execute at least two of the nodes concurrently; automatically determine an order of executing the at least two of the nodes concurrently.

[0026] According to yet another aspect, the one or more physical computing devices are further configured to automatically add one or more relationships between the first and second nodes.

[0027] According to another aspect, the one or more physical computing devices are further configured to receive instructions to change the relationship between the first and second nodes from a one-directional link to a bi-directional link.

[0028] According to yet another aspect, the first data table and the second data table are located remotely from each other.

BRIEF DESCRIPTION OF THE DRAWINGS

[0029] FIG. 1 illustrates one embodiment of a database system using an ontology.

[0030] FIG. 2 illustrates one embodiment of a system for creating and accessing a table graph.

[0031] FIG. 3 illustrates one example of executing an example table graph.

[0032] FIG. 4A illustrates two stages of executing the example table graph of FIG. 3 with example data tables.

[0033] FIG. 4B illustrates an example interface for entering search terms for a search that is executed using one or more table graphs.

[0034] FIG. 5A is a flowchart depicting an illustrative process of executing a search using a table graph.

[0035] FIG. 5B is a flowchart depicting an illustrative process of generating of a table graph.

[0036] FIG. 6A illustrates an example interface that is configured to enable users to create a table graph and configure properties of the table graph.

[0037] FIG. 6B illustrates an example interface that is configured to allow users to drag and drop tables from various data sources into the interface in order to create a table graph.

[0038] FIG. 7 illustrates an example interface that displays a table graph that includes nodes that can be executed in parallel.

[0039] FIG. 8 is a flowchart depicting an illustrative process of executing select nodes of a table graph in parallel.

[0040] FIG. 9 is a block diagram illustrating one embodiment of a computer system with which certain methods and modules discussed herein may be implemented.

DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS

Terms

[0041] In order to facilitate an understanding of the systems and methods discussed herein, a number of terms are defined below. The terms defined below, as well as other terms used herein, should be construed to include the provided descriptions, the ordinary and customary meaning of the terms, and/or any other implied meaning for the respective terms. Thus, the descriptions below do not limit the meaning of these terms, but only provide exemplary definitions.

[0042] Ontology: Stored information that provides a data model for storage of data in one or more databases. For example, the stored data may comprise definitions for object types and property types for data in a database, and how objects and properties may be related.

[0043] Database: A broad term for any data structure for storing and/or organizing data, including, but not limited to, relational databases (Oracle database, mySQL database, etc.), spreadsheets, XML files, and text file, among others. It is also called a data store or a data structure herein.

[0044] Data Object or Object: A data container for information representing specific things in the world that have a number of definable properties. For example, a data object can represent an entity such as a person, a place, an organization, a market instrument, or other noun. A data object can represent an event that happens at a point in time or for a duration. A data object can represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data object may be associated with a unique identifier that uniquely identifies the data object. The object's attributes (e.g. metadata about the object) may be represented in one or more properties.

[0045] Object Type: Type of a data object (e.g., person, event, or document). Object types may be defined by an ontology and may be modified or updated to include additional object types. An object definition (e.g., in an ontology) may include how the object is related to other objects, such as being a sub-object type of another object type (e.g. an agent may be a sub-object type of a person object type), and the properties the object type may have.

[0046] Properties: Attributes of a data object that represent individual data items. At a minimum, each property of a data object has a property type and a value or values.

[0047] Property Type: The type of data a property is, such as a string, an integer, or a double. Property types may include complex property types, such as a series data values associated with timed ticks (e.g. a time series), etc.

[0048] Property Value: The value associated with a property, which is of the type indicated in the property type associated with the property. A property may have multiple values.

[0049] Link: A connection between two data objects, based on, for example, a relationship, an event, and/or matching properties. Links may be directional, such as one representing a payment from person A to B, or bidirectional.

[0050] Link Set: Set of multiple links that are shared between two or more data objects.

[0051] Table Graph: Set of multiple nodes and edges between two or more of the nodes. A node in a table graph may represent a data table or a portion of a data table. An edge in a table graph may represent a relationship between two nodes in the table graph. A relationship may represent, for example, a mapping between a data field of a node and a data field of another node.

Object Centric Data Model

[0052] To provide a framework for the following discussion of specific systems and methods described herein, an example database system 210 using an ontology 205 will now be described. This description is provided for the purpose of providing an example and is not intended to limit the techniques to the example data model, the example database system, or the example database system's use of an ontology to represent information.

[0053] In one embodiment, a body of data is conceptually structured according to an object-centric data model represented by ontology 205. The conceptual data model is independent of any particular database used for durably storing one or more database(s) 209 based on the ontology 205. For example, each object of the conceptual data model may correspond to one or more rows in a relational database or an entry in Lightweight Directory Access Protocol (LDAP) database, or any combination of one or more databases.

[0054] FIG. 1 illustrates an object-centric conceptual data model according to an embodiment. An ontology 205, as noted above, may include stored information providing a data model for storage of data in the database 209. The ontology 205 may be defined by one or more object types, which may each be associated with one or more property types. At the highest level of abstraction, data object 201 is a container for information representing things in the world. For example, data object 201 can represent an entity such as a person, a place, an organization, a market instrument, or other noun. Data object 201 can represent an event that happens at a point in time or for a duration. Data object 201 can represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data object 201 is associated with a unique identifier that uniquely identifies the data object within the database system.

[0055] Different types of data objects may have different property types. For example, a “person” data object might have an “Eye Color” property type and an “Event” data object might have a “Date” property type. Each property 203 as represented by data in the database system 210 may have a property type defined by the ontology 205 used by the database 209.

[0056] Objects may be instantiated in the database 209 in accordance with the corresponding object definition for the particular object in the ontology 205. For example, a specific monetary payment (e.g., an object of type “event”) of US$30.00 (e.g., a property of type “currency”) taking place on 3/27/2009 (e.g., a property of type “date”) may be stored in the database 209 as an event object with associated currency and date properties as defined within the ontology 205.

[0057] The data objects defined in the ontology 205 may support property multiplicity. In particular, a data object 201 may be allowed to have more than one property 203 of the same property type. For example, a “person” data object might have multiple “Address” properties or multiple “Name” properties.

[0058] Each link 202 represents a connection between two data objects 201. In one embodiment, the connection is either through a relationship, an event, or through matching properties. A relationship connection may be asymmetrical or symmetrical. For example, “person” data object A may be connected to “person” data object B by a “Child Of” relationship (where “person” data object B has an asymmetric “Parent Of” relationship to “person” data object A), a “Kin Of” symmetric relationship to “person” data object C, and an asymmetric “Member Of” relationship to “Organization” data object X. The type of relationship between two data objects may vary depending on the types of the data objects. For example, “person” data object A may have an “Appears In” relationship with “Document” data object Y or have a “Participate In” relationship with “Event” data object E. As an example of an event connection, two “person” data objects may be connected by an “Airline Flight” data object representing a particular airline flight if they traveled together on that flight, or by a “Meeting” data object representing a particular meeting if they both attended that meeting. In one embodiment, when two data objects are connected by an event, they are also connected by relationships, in which each data object has a specific relationship to the event, such as, for example, an “Appears In” relationship.

[0059] As an example of a matching properties connection, two “person” data objects representing a brother and a sister, may both have an “Address” property that indicates where they live. If the brother and the sister live in the same home, then their “Address” properties likely contain similar, if not identical property values. In one embodiment, a link between two data objects may be established based on similar or matching properties (e.g., property types and/or property values) of the data objects. These are just some examples of the types of connections that may be represented by a link and other types of connections may be represented; embodiments are not limited to any particular types of connections between data objects. For example, a document might contain references to two different objects. For example, a document may contain a reference to a payment (one object), and a person (a second object). A link between these two objects may represent a connection between these two entities through their co-occurrence within the same document.

[0060] Each data object 201 can have multiple links with another data object 201 to form a link set 204. For example, two “person” data objects representing a husband and a wife could be linked through a “Spouse Of” relationship, a matching “Address” property, and one or more matching “Event” properties (e.g., a wedding). Each link 202 as represented by data in a database may have a link type defined by the database ontology used by the database.

[0061] FIG. 2 is a block diagram illustrating one embodiment of a system for creating and accessing a table graph. A table graph, as used herein, defines relationships between multiple data tables from one or more data sources. The data table, or a portion of a data table, may be represented as nodes and the relationships between nodes as edges between/among two or more of the nodes. The edges (e.g., relationships) between two nodes may represent, for example, a mapping between particular data fields of nodes.

[0062] As illustrated in FIG. 2, a variety of database types may be data sources of a table graph. In the embodiment of FIG. 2, a table graph API 248 is configured to interface between the table graph 250 and multiple data sources, such as the data sources illustrated in FIG. 2, including a proprietary database 240, an elastic search database 242, a SQL database 244, an ODBC database 246, an object-oriented database (not shown in this figure), a file-based data store (not shown in this figure), a key-value store (not shown in this figure) and so forth. The table graph API 248 is capable of parsing data from various heterogeneous databases using one or more parsers and/or transformers. In some embodiments, a parser may communicate with a data source, such as an external data store, an internal data store, a proprietary database, etc., and parse the data received from the data source. In some embodiments, a transformer will further transform the data into a format that can be easily read by the table graph API 248, such as an object or another type of data. Depending on the embodiment, if there is an unspecified data source that the table graph API 248 has not previously interacted with, the table graph API 248 may first automatically detect or determine a set of rules to parse data from the unspecified source, and/or a user may manually provide translation data, so that data sources of that type may later be accessed by table graphs.

[0063] The data access system 252 may be used to generate table graphs, such as table graph 250. Users such as data analysts, database administrators, IT administrators, testing engineers, QA engineers, database and/or software developers, who have sufficient privilege to interact with the data access system 252 may generate table graphs. They may also share the generated table graphs with other end users, analysts, engineers, administrators, and so forth. An end user, a data analyst, or other users who do not have to be familiar with the underlying system, may be able to easily interact with table graphs through the data access system 252.

[0064] In the example in FIG. 2, a user 254 may, through the data access system 252, submit a request to add a first data table as a first node in a table graph 250. The user 254 may further add other data tables as nodes in the table graph 250. The user 254 may also specify set of relationships to add between the tables as edges of the table graph. In the example of table graph 250, five nodes A, B, C, D, and E, which may each be associated with different tables possibly from multiple data sources (or some may represent a common table) are added to table graph 250. The edge between nodes A and B is a bi-directional edge, where the direction(s) of edges indicate the direction of data flow between nodes. The other edges in the table graph 250 are one directional edges. A bi-directional edge may represent that there is a two-way relationship between a data field in one node and a data field in another node. For example, the ID field of a first node may be mapped to the fromID field in a second node. In addition, the toID field of the second node may be mapped to the ID field of the first node. However, in some embodiments, a bi-directional edge may also be represented as two one-directional edges. A one-directional edge represents a one-way relationship from a data field in one node to a data field in another node, which, in some situations, may mean that data from one data field in one node may be used to match a data field in another node. In some embodiments, the user 254 that creates the table graph 250 may be a system administrator, database administrator, or a database or system developer. In some other embodiments, the user 254 may be an end-user or a user of the table graph system. In some situations, there may be a user that creates the table graph 250 and other users that have access to the table graph 250 or have privileges to edit, remove, and/or execute queries using the table graph 250. In some embodiments, applications may also interact with data access system 252. For example, a data quality monitoring system may need to query a table graph and process the returned results. The application 256 in this example would be the data quality monitoring system. In another example, the application 256 may be a part of an integrated system that detects fraud, security breaches, and so forth, and the application 256 may receive search queries and/or instructions to create and/or configure various table graphs for various purposes.

[0065] FIG. 3 illustrates one example of a process of executing a table graph based on a user-specified request. In this example, two data tables may come from a data store 301 or the data store 301 and another data store in an external data store. The two data tables are example Customer Info 307 and Transactions 309. The two data tables have been added as nodes in the table graph shown in FIG. 3. The customer info node 303 represents the Customer Info data table 307 and the transactions node 305 represents the Transactions data table 309.

[0066] As shown in the example in FIG. 3, the Customer Info table 307 (also referred to in FIG. 3 as “T1”) includes three data fields: ID, Customer, and Occupation. The ID field is represented in this example as numbers such as 213, 214, 215, etc. The Customer field may store names of the customers, such as “John Doe,” “Jane Doe,” and “James Bond,” and so forth. The Transactions table (also referred to as “T2” in FIG. 3), includes five data fields: Trans. No., fromID, toID, Item, and Cost. The fromID and toID fields in the table represent the identities of the people who are involved in the transaction in a given row in the Transactions table. For example, Trans. No. 90 is a transaction from a person 213 to a person 215 that involves a printer. The printer's cost is $107.99.

[0067] Two edges, which can also be represented in some embodiments as a single bi-directional edge, connect the customer info node 303 and the transactions node 305. From the customer info node 303, an edge represents a relationship between the ID field in the customer info node 303 and the fromID field in the transactions node 305. From the transactions node 305, an edge represents a relationship between the toID field in the transactions node 305 and the ID field in the customer info node 303. With the edges establishing table lookups, a user may be able to quickly search for transactions and identities of the people involved in the transactions without performing the intermediate search steps.

[0068] FIG. 4A illustrates two stages of executing the example table graph of FIG. 3 with example data tables. The same underlying data tables as used in FIG. 3, Customer Info 307 and Transactions 309, are used in this example. For the purposes of clear illustration, the nodes in the table graph are labeled with different reference numbers. The customer info node 401 and transactions node 402 are connected as in FIG. 3, by two edges.

[0069] In one example, a user may wish to search for all the transactions from John Doe to James Bond. Traditionally, such a query may have to be carried out in several steps, possibly using different search functionality for different data sources, and/or using a complicated search term.

[0070] In the embodiment of FIG. 4A, using a table graph the search may be significantly easier for the user to execute because intermediate steps of parsing query results and making further queries based on previous queries are transparent and hidden from the user. After creating the table graph with the two tables as nodes and edges established between the two tables, queries may be easily carried out. The received search query may be received by the data access system 252 (FIG. 2) and carried out by accessing multiple data sources via the table graph API 248, for example. Because the ID field in the customer info node 401 is linked to the fromID field in the transactions node 401 and the toID field in the transactions node 401 is linked to the ID field of the customer info node 307, the table graph search may be executed directly, which may involve sending over the ID of 213, and receiving a set of transactions satisfying the search criteria (James Bond, which corresponds to toID 215, and the transaction detail: Trans. No. 00090, from ID 213, toID 215, Item printer, Cost $107.99). In some embodiments, the results will be parsed and presented to the user as an object or a set of objects. The user, however, does not need to parse any intermediate results such as searching for the ID related to a name, searching for a name that is related to an ID, or searching for a transaction that is related to the IDs.

[0071] In the second stage of the search, the table graph may automatically repeat the table graph using the customer information returned from a previous execution of the table graph, such as to not only find transactions initiated by James Bond, but to also find transactions initiated by others involved in transactions with James Bond. Traditionally, such a query may have to be carried out in several steps or using a complicated search term. Through the use of the table graph, rather than the user needing to parse the results and find out that the toID of the transaction involving James Bond (fromID 215) is 214, and then executing queries of the various tables to find transactions involving ID 214, the recursive searching according to the table graph arrangement is automated. For example, the customer ID of 215 returned in the first stage (top half of FIG. 4A) of the search, which corresponds to James Bond, may be used in a second execution of the table graph (bottom half of FIG. 4A) in order to receive a set of transactions satisfying the search criteria (Jane Doe, which corresponds to ID 214, and the transaction detail: Trans. No. 00091, from ID 215, toID 214, Item rice, Cost $4.50). In some embodiments, the results will be parsed and presented to the user as an object or a set of objects. Such recursive execution of table lookups (and other features) are easily implemented using table graphs.

[0072] FIG. 4B illustrates an example interface for entering search term for a search that is executed using a table graph. The example user interface 850 may be generated and presented to a user, such as a data analyst that wishes to find data on a certain data object, including multiple levels of interactions with the data object that may be indicated in various data tables of various formats. In the example user interface 850, the field to be searched is Customer's Name, as shown in text field 855. The specific query includes the following search term: John D*, which the user may enter in the search box 860. The wildcard “*” represents that any character may be deemed a match. For example, a customer's name that is “John Doe” and a customer's name that is “John Davis” both satisfy this search criteria.

[0073] Depending on the embodiment, results of a search may be displayed in the example user interface 850 or in a separate interface. For purposes of illustration, FIG. 8 illustrates search results that may be returned by executing the table graph of FIGS. 3-4 (although additional results may be obtained if recursive execution of the table graph is continued). In the example as shown, a direct hit is displayed: “A transaction for $107.99 was found between John Doe and James Bond for a Printer (Transaction No. 00090).” In addition, an indirect hit (e.g., a transaction of an indication associated with John D*, rather than John D* himself) may also be displayed, such as the one in the example user interface 850: “A transaction for $4.50 was found between James Bond and Jane Doe for Rice (Transaction No. 00091).” In this example, the indirect hit may be found by the search because John Doe has transacted with James Bond, who also transacted with Jane Doe.

[0074] In some embodiments, instead of displaying search results in formatted text, the user interface 850 may display all or a subset of the search results as data field values, unparsed results, objects, and/or files. The results may also be offered as downloadable files formatted in various ways for the convenience of the user.

Example Table Graph Methods

[0075] FIG. 5A is a flowchart depicting an illustrative process of executing a search using a table graph. The process of FIG. 5A may be performed by the data access system 252 and/or the API 248 in response to input from a data analyst, for example, such as part of a data analysis software platform. However, the process may be performed by other computing systems. Depending on the embodiment, the method of FIG. 5A may include fewer or additional blocks and the blocks may be performed in an order that is different than illustrated.

[0076] The process 500 begins at block 503, wherein the data access system 252 accesses a table graph, such as a table graph selected by the user or a default table graph associated with a particular search functionality that the user wishes to perform (whether or not the user even knows that table graphs are being used to execute the search functionality). For purposes of the example in FIG. 5A, a table graph having two nodes (such as in FIGS. 3-4) is assumed, although table graphs may include any quantity of nodes in various configurations. In some embodiments, accessing the table graph may also include obtaining information regarding the nodes and edges in the table graph, such as the names, properties, relations, index types, and data fields involved in the nodes and edges.

[0077] The process 500 then proceeds to block 505 and a first data store storing data of a first type is accessed. Depending on the embodiment, the first data store may be a database of several different types, such as a proprietary database, a SQL database, an elastic search database, an ODBC database, a JDBC database, an open source database, and so forth. Moreover, the data of the first type as stored in the first data store may be of any type. For example, the data may be of one or more following types: string, float, long, integer, binary, Boolean, text, object, BLOB, BigInt, char, numeric, Date, DateTime, real, SmallInt, Time, Timestamp, Varbinary, Varchar, and so forth. The structure of the data does not need to be specified before the data is accessed. For instance, in some embodiments, if an unknown data structure is encountered, the API 248 may be programmed to analyze and find out the data structure. In some embodiments, the API 248 may notify an administrator or user that an unknown data structure is encountered and receive the administrator or user's instructions.

[0078] The process 500 then proceeds to block 510 and a second data store storing data of a second type is accessed. The second data store may be a data store that is either internal or external to the first data store. For example, the second data store may be a database maintained by the same or a different organization at a different location as the first data store. Moreover, the second data store may store data that is of a different type than the first store. For example, if the first data store is a SQL database, the second data store may be a database of a proprietary type, and the two data stores may or may not be able to directly share query terms with each other. For example, the first data store may be a data store maintained by Company A that stores information related to consumers, including their names, identities, and so forth. The first data store may be implemented as a MySQL database. The second data store may be a data stored maintained by a department store B. The second data store may use the Microsoft Access format to store its transaction information related to department store customer transactions. In some embodiments, the first and second data stores are not accessed (blocks 505, 510) until data is actually requested from the data stores, such as when the table graph is executed (block 520).

[0079] The process 500 then proceeds to block 515 and a search query is received. In some embodiments, the search query may be submitted by a user through an application. In some other embodiments, the user may directly interact with a table graph system. The search query may be processed by the data access system 252, which interacts with the table graphs and may be further be in contact with the table graph API 248 in order to access the various data sources.

[0080] The process 500 then proceeds to block 520 and the search query may be executed using the table graph. In some embodiments, the data access system 252 and/or the API 248 may analyze the search query to parse information such as the nodes and edges relevant to this search query. The data access system 252 and/or the API 248 may also generate one or more queries to the relevant data stores, which may include information such as search terms, data fields, name of the data tables, etc. Because the one or more queries formatted by the data access system 252 are transparent to the user, the user does not need to specify the various search queries (e.g., the exact query language used by the various data stores), details regarding how to join tables, how to parse intermediate results, or other details regarding the actual search execution. Moreover, as discussed previously, if the search query involves the look up of more than one tables (nodes) and the operation to be performed on one table depends on the intermediate results received from another table, such details may be transparent to the user. The user does not need to parse the intermediate results obtained at each node of the search query.

[0081] FIG. 5B is a flowchart depicting an illustrative process of generating a table graph. The process of FIG. 5B may be performed by the data access system 252 by a system administrator or data analyst, for example, such as part of a data analysis software platform. However, the process may be performed by other computing systems. Depending on the embodiment, the method of FIG. 5B may include fewer or additional blocks and the blocks may be performed in an order that is different than illustrated.

[0082] For purposes of the example in FIG. 5B, a table graph having two nodes (such as in FIGS. 3-4) is generated, although table graphs may include any quantity of nodes in various configurations. The process 550 begins at block 555, wherein instructions to add a first table as a node are received from a user or an administrator. The first table may be physically located in a database that is remote from the user. Although the word “table” is used, the data in the first table may be in any other data container and/or formatter, either structured or unstructured. For example, data in the table may be in an XML-like format or a user-defined format. The data may also be in a traditional database format, an object-oriented database format, and so forth. In some embodiments, the instructions to add a first table to a table graph as a node may also include additional information such as an alias for the node. For example, an alias for the customer info node 303 (FIG. 3) may be “Domain1.DB1.T1.” The received instructions may also include, in some embodiments, information regarding how the data in the first table may be structured.

[0083] The process 550 then proceeds to block 560 and instructions to add another table as a node is received. In some embodiments, the additional table that is added to the table graph may be in the same database as the first table. However, in some other instances, the additional table may belong to a database that is not directly related to the first table. It could even be of a type that cannot normally directly communicate with the first table because they might be of different database types.

[0084] The process 550 then proceeds to block 565 and instructions to add a relationship between the tables are received. Depending on the embodiment, the received relationship may be of a type that is bi-directional or one-directional. When the received instructions are to create a relationship that is bi-directional, a bi-directional edge between the tables are added to the table graph. In some other embodiments, instead of creating a bi-directional edge, two one-directional edges are created and added to the table graph. The edges between the tables denote the relationship that is added to the table graph. One common type of relationship that may be added between the two nodes in a table graph is a mapping. For example, the ID column in one node may be mapped to the toID column in another node. In another example, the name column in one node may be mapped to the full_name column in another node.

[0085] The creation of an edge may not indicate that there is a one-to-one relationship between the data records stored in the two nodes. Instead, a variety of scenarios may exist. For example, the ID column in one node may correspond to the toID column in another node, but there may be multiple records with the same toID values in the other node. Moreover, the ID column in the one node may be sequential, unique, and non-negative integer values. The toID column in the other node may have redundancy and/or non-integer values. Details such as these may be transparent to a user who queries the table graph, which adds to the efficiency and ease of use to the system.

[0086] As another example, the name column (or any other field) in one node may contain both first name and last name (or other combinations of data). The full_name column in the other node, however, may have incomplete data records, such as “James B.” instead of “James Bond.” The edge between these two nodes, therefore, may, based on user request, include an exact mapping of data records in the two nodes, or a mapping that include partial matches or accommodate data ranges, elastic matches, and so forth.

[0087] The process 550 then proceeds to a decision block 570 which determines whether additional tables may be added as nodes to the table graph. If the user wishes to add another table as a node to the table graph, then the answer to the question in the decision block 570 is yes. In some embodiments, instructions may be received from an administrator or a user with sufficient privilege to add a plurality of tables as nodes in a table graph, then the answer to the question in the decision block 570 is also yes. Accordingly, the process 550 proceeds to block 560, wherein instructions to add another table as a node in the table graph is received. The process 550 then proceeds to block 565 wherein the computing system receives instructions to add a relationship between nodes in the table graph.

[0088] However, if the user does not want to add more nodes to the table graph or if all the tables have been added as nodes as instructed, then the answer to the question in the decision block 570 is no. Accordingly, the process 550 proceeds to block 575, wherein the table graph is built and stored. In some embodiments, the table graph may be built and stored in a local computing device of the user or administrator that creates the table graph, such as in a computer, a tablet device, a handheld device, and so forth. In some other embodiments, the table graph may be built and stored in a remote computing device.

[0089] Moreover, building the table graph may include indexing fields (and/or columns) that may be relevant to edges in the table graph and/or fields that should be indexed according to the instruction of a user. For example, in the customer_info node 303 (FIG. 3), an index may be created for the ID column. Depending on the embodiment, various types of indexing methods and indices may be used. In addition, the Customer column may also be indexed.

[0090] Depending on the embodiments, the indexing methods used may present full text searchability and matching capability for regular expression and fuzzy matches. For example, instead of requiring an exact match to a customer's name, “James Bond” may be considered a match for a search term “James B”. Also, the user may specify that a search should satisfy the requirement of “Jame*B*d”, wherein the wildcard represents any character. Additional regular expression type of matching capabilities may also be accommodated and made possible by the indexing methods and/or query techniques used by a table graph.

[0091] Moreover, in some embodiments, the edges between the nodes in a table graph are tolerant of data quality issues. For example, instead of “James Bond,” a data record in the database may include the name “Jomes Bond” (with a typo in “Jomes”). A fuzzy matching capability may identify this record as potentially the same as “James Bond,” and the edge between two tables in which a name field is used as part of a relationship may still identify a data record containing the record “Jomes Bond.”

[0092] In another example, the table graph may automatically perform record matches in various ways. For example, if a phone number is given as 123-456-7890, this may automatically be matched with other formats for phone numbers such as 123.456.7890, (123) 456-7890, and/or the like.

[0093] In one embodiment, nodes and/or edges may be added via command line instructions. For example, a node in a table graph may be added using syntax such as: Node customer=new CustomerNode( ) In another embodiment, a node be also added using syntax such as: graph.addNode (customer). These syntaxes are presented for illustrative purposes only.

Example User Interfaces

[0094] FIG. 6A illustrates an example interface that is configured to enable users to create a table graph and configure properties of the table graph. A user interface such as the example user interface 600 may be generated and presented to a user and allow the user to add various data sources by pressing add data sources button 615. As shown in the example interface 600, one data source, db1, has already been added. The user interface 600 may also allow a user to add various tables as nodes by selecting them from a drop-down menu such the drop-down menu 620 and/or some other interface that shows tables available for selection, such as from the one or more selected data sources. Alternatively, the user interface may also allow a user to create a new node directly with the user interface by pressing the create new node button 625. Depending on the embodiment, once the user creates a new node, a new table is created in the underlying data store. By creating a new feature using the new node button 625, the user may conveniently add data to a table graph. For example, while analyzing data regarding James Bond, the user may think of other data that might also be relevant to the analysis, which is not currently in the table graph or in a known data store. Therefore, the user may add the table using the new node button 625. This feature allows users to interact with data in a table graph directly and dynamically, which may help yield more useful analysis results.

[0095] The user interface 600 may also allow users to configure the edge types between/among the nodes in the table graph. For example, the example user interface of FIG. 6 shows nodes 650 and 655 selected by the user (indicated by the bold outline of the nodes in this example) such that a relationship between those selected nodes can be created and/or updated. In this example, a user may choose to add a bi-directional edge between node 650 (node “A”) and node 655 (node “B”) by dragging an edge between two nodes in the table graph. The type of an edge can also be configured and/or edited. For example, a user may choose to change a bi-directional edge into a one-directional edge. A user may also remove an existing edge.

[0096] The user interface 600 may also allow a user to select certain fields to index in order to complete the configuration of an edge. For example, the edge between nodes A 650 and B 655 may be configured to be between the “Last Name” field in node A 650 and the “Surname” field in node B 655. In the example of FIG. 6, with nodes 650 and 655 selected, drop down menus 640 and 645 are populated with fields of the respective tables (associated with nodes 650 and 655) such that the user can selected corresponding index nodes of the two tables. For example, a user may choose to change the relationship between the two nodes by choosing the appropriate data field in a drop down menu 640 (for node A 650) and the drop down menu 645 (for node B 645). In some other embodiments, other types of interface elements may be generated and presented in order for users to choose the data fields to index.

[0097] FIG. 6B illustrates another example interface that is configured to allow users to drag and drop tables from various data sources into the interface to create a table graph. The example user interface 750 may be generated and presented to a user, such as an administrator and/or analyst that wishes to develop multi-source search logic. The example user interface 750, as shown, illustrates representations of two separate data stores: DB1 760, which is a proprietary database, and DB3 770, which is a SQL database. As shown, three tables from DB1 760 are available for selection as nodes in a table graph: T1 761 (User table), T2 762 (Background table), and T3 763 (Security table). In addition, three tables from DB3 770 are available for selection as nodes in the table graph: T2 771 (Events), T3 772 (Misc.), and T4 773 (History).

[0098] In some embodiments, if a user wishes to add a data table as a node into an existing or a new table graph, the user may drag a table and drop it into the table graph, at which time the table is inserted as a node in the table graph. In the example user interface 750, a user has dragged and dropped three tables as nodes into the table graph: node 751 (DB1.T1), node 752 (DB3.T2), and node 753 (DB3.T3). Edges may also be added between the tables. A user may also click on an edge and create indices on the tables and make further configurations as to the mapping between data fields in the nodes.

[0099] FIG. 7 illustrates an example user interface 700 that displays a table graph that includes nodes that can be executed in parallel. In this example the displayed table graph 720 includes a total of eight nodes, several of which are configured to execute concurrently with certain other nodes, as discussed below.

[0100] A table graph that includes at least two nodes that are configured to be executed in parallel may be called a parallel table graph. In some embodiments, one or more nodes in a table graph may be included in a group so that searches related to the nodes in the group may be executed in parallel, making the searches even more efficient. For instance, in the example table graph 720, the nodes may be grouped automatically (and/or manually) into five different groups. In this example, Group 1 includes node A 721 and node B 722. Group 2 includes node C 723 and node E 725. Group 3 only includes one node, which is node D 724. Group 4 includes only one node, node F 726. Finally, group 5 includes two nodes, node G 727 and node H 728. In one embodiment, the nodes that belong to the same group may be executed in parallel because the search queries involving each of these nodes may be configured to be executed independently.

[0101] In some instances, there could be more than one way to partition a table graph into multiple groups. A table graph may be partitioned into several sub graphs in multiple ways. Therefore, besides automatically grouping several nodes together into one group, a user may choose to alter the grouping of nodes (e.g., an automatic grouping provided by the table graph generation software) for a parallel table graph for reasons of execution efficiency, data quality, and so forth. A user may utilize an interface such as the example user interface 700 and edit the existing grouping of nodes for parallel table graph execution. If, after the user's configuration, certain nodes assigned into the same group by the user cannot be executed in parallel, the example user interface 700 may display a warning message to the user and let the user know that the current assignment of nodes into a group would not result in a viable parallel table graph execution.

[0102] The following is an example of parallel table graph execution: Suppose a parallel table graph includes 3 tables/nodes including Table 1 that links a customer name to a customer ID, Table 2 that links a customer ID to a phone number, and Table 3 that links a customer ID to an address. In a search for a customer name, an initial search of Table 1 may be performed. However, one a customer ID corresponding to the customer name is determined, a parallel search of Tables 2 and 3 may be performed. Accordingly, in this example, a parallel table graph execution may be performed automatically on nodes corresponding to Tables 2 and 3.

[0103] FIG. 8 is a flowchart depicting an illustrative process of executing a parallel table graph (e.g., a table graph with at least two nodes configured to execute at least partially concurrently). The process of FIG. 8 may be performed by the data access system 252 and/or the API 248 in response to input from a data analyst, for example, such as part of a data analysis software platform. However, the process may be performed by other computing systems. Depending on the embodiment, the method of FIG. 8 may include fewer or additional blocks and the blocks may be performed in an order that is different than illustrated.

[0104] The process 900 begins at block 905, wherein a table graph is accessed. Accessing a table graph may include receiving information regarding the edges and nodes in the table graph and the data fields that may be involved in the edges and nodes.

[0105] The process 900 proceeds to block 910 and instructions regarding executing some nodes in the table graph in parallel are received. As discussed previously, the instructions to execute certain nodes in parallel may be received from a user and/or automatically determined. In some other embodiments, such instructions may be received from an application or a physical computing device that have instructions stored on it to execute a search query using a table graph. For example, an application that interacts with a table graph regularly, such as a program that periodically queries a table graph and reports updated results, may include instructions to query the table graph in parallel. A user or an administrator may set up such instructions as part of the application. Alternatively, the table graph system may automatically determine that particular nodes may be queried in parallel, and may automatically execute the particular nodes in parallel when a search query is received.

[0106] The process 900 then proceeds to block 915, and the order of executing the nodes in the table graph are determined. Depending on the embodiments, the determination may be made automatically based on the dependencies of the search queries and/or other factors, such as expected time for executing a query, the complexity of a query, records of past search query execution duration, amount of data potentially involved in a search query/or in a node, database usage statistics, search demand predictions, and so forth. The factors may further be weighted in order to plan the search queries in a cost-effective way. For example, queries that may be repeated periodically can be scheduled to take place at certain times when the demand on a database server is low. In another example, nodes involved in search queries that, according to statistics, may take a long time to finish, may be executed with more priority than other search nodes involving other nodes, even if both could be executed in parallel.

[0107] In some other embodiments, the determination of the order of executing the nodes may also be made by a user, who may arrange the order of executing the nodes by assigning certain nodes into the same or various different execution stages and/or groups. Also, depending on the embodiment, the determination may be made by a combination of user input and automatic determination. A user may modify the automatic parallel table graph execution arrangement. A user's parallel table graph execution arrangement may undergo sanity checks performed automatically or as part of a program.

[0108] The process 900 then proceeds to block 920 and at least some of the nodes in the table graph are executed in parallel according to the determined order. In some embodiments, a user interface may also be executed and created to the user so that the user may monitor the execution of the table graph as it happens. In some other embodiments, performance statistics may be gathered for the table graph search in order to further optimize future parallel table graph searches.

Implementation Mechanisms

[0109] According to one embodiment, the techniques described herein are implemented by one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more general purpose hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, server computer systems, portable computer systems, handheld devices, networking devices or any other device or combination of devices that incorporate hard-wired and/or program logic to implement the techniques.

[0110] Computing device(s) are generally controlled and coordinated by operating system software, such as iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatible operating systems. In other embodiments, the computing device may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.

[0111] For example, FIG. 9 is a block diagram that illustrates a computer system 800 upon which the processed discussed herein may be implemented. For example, a table graph generation user interface may be generated and displayed to a user by a first computer system 800, while a search query using one or more table graphs may be executed by another computer system 800 (or possibly the same computer system in some embodiments). Furthermore the data sources may each include any portion of the components and functionality discussed with reference to the computer system 800.

[0112] The example computer system 800 includes a bus 802 or other communication mechanism for communicating information, and a hardware processor, or multiple processors, 804 coupled with bus 802 for processing information. Hardware processor(s) 804 may be, for example, one or more general purpose microprocessors.

[0113] Computer system 800 also includes a main memory 806, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 802 for storing information and instructions to be executed by processor 804. Main memory 806 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 804. Such instructions, when stored in storage media accessible to processor 804, render computer system 800 into a special-purpose machine that is customized to perform the operations specified in the instructions.

[0114] Computer system 800 further includes a read only memory (ROM) 808 or other static storage device coupled to bus 802 for storing static information and instructions for processor 804. A storage device 810, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 802 for storing information and instructions.

[0115] Computer system 800 may be coupled via bus 802 to a display 812, such as a cathode ray tube (CRT) or LCD display (or touch screen), for displaying information to a computer user. An input device 814, including alphanumeric and other keys, is coupled to bus 802 for communicating information and command selections to processor 804. Another type of user input device is cursor control 816, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 804 and for controlling cursor movement on display 812. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.

[0116] Computing system 800 may include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.

[0117] In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage

[0118] Computer system 800 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 800 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 800 in response to processor(s) 804 executing one or more sequences of one or more instructions contained in main memory 806. Such instructions may be read into main memory 806 from another storage medium, such as storage device 810. Execution of the sequences of instructions contained in main memory 806 causes processor(s) 804 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.

[0119] The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 810. Volatile media includes dynamic memory, such as main memory 806. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.

[0120] Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between nontransitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 802. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.

[0121] Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 804 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 800 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 802. Bus 802 carries the data to main memory 806, from which processor 804 retrieves and executes the instructions. The instructions received by main memory 806 may retrieves and executes the instructions. The instructions received by main memory 806 may optionally be stored on storage device 810 either before or after execution by processor 804.

[0122] Computer system 800 also includes a communication interface 818 coupled to bus 802. Communication interface 818 provides a two-way data communication coupling to a network link 820 that is connected to a local network 822. For example, communication interface 818 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 818 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 818 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

[0123] Network link 820 typically provides data communication through one or more networks to other data devices. For example, network link 820 may provide a connection through local network 822 to a host computer 824 or to data equipment operated by an Internet Service Provider (ISP) 826. ISP 826 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 828. Local network 822 and Internet 828 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 820 and through communication interface 818, which carry the digital data to and from computer system 800, are example forms of transmission media.

[0124] Computer system 800 can send messages and receive data, including program code, through the network(s), network link 820 and communication interface 818. In the Internet example, a server 830 might transmit a requested code for an application program through Internet 828, ISP 826, local network 822 and communication interface 818.

[0125] The received code may be executed by processor 804 as it is received, and/or stored in storage device 810, or other non-volatile storage for later execution.

[0126] Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.

[0127] The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.

[0128] Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.

[0129] The term “comprising” as used herein should be given an inclusive rather than exclusive interpretation. For example, a general purpose computer comprising one or more processors should not be interpreted as excluding other computer components, and may possibly include such components as memory, input/output devices, and/or network interfaces, among others.

[0130] Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.

[0131] It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.

Claims

What is claimed is:

1. A search system configured to execute a search query, the search system comprising:

one or more computing devices having hardware processors configured to execute instructions in order to:

access a first data store of a first type storing at least a first data table;

access a second data store of a second type different than the first type, the second data store storing at least a second data table;

generate a table graph comprising:

a first node associated with the first data table;

a second node associated with the second data table;

a first link between the first node and the second node, the first link indicating a first field of the first data table that is associated with a second field of the second data table; and

a second link between the second node and the first node, the second link indicating a third field of the second data table that is associated with a fourth field of the first data table;

execute a search query on said table graph by:

looking up first information associated with the search query in the first data table;

looking up second information associated with the first information in the second data table by reference to the first link, wherein the first and second information together comprise a direct hit of the search query; and

looking up third information associated with the second information in the first data table by reference to the second link, wherein the third information is different from the first information, and wherein the third information comprises an indirect hit of the search query; and

provide, for display by the search system, at least:

the second information and a first indication that the second information comprises the direct hit of the search query; and

the third information and a second indication that the third information comprises the indirect hit of the search query.

2. The search system of claim 1, wherein at least one of the first field and the second field are full-text searchable.

3. The search system of claim 1, wherein the first link between the first node and the second node is a bi-directional link.

4. The search system of claim 1, wherein the first type and the second type each include one or more of a relational data store, an object-oriented data store, a proprietary data store, a file-based data store, a hierarchical data store, a network data store, or an elastic-search data store.

5. The search system of claim 1, wherein the table graph is generated via an application programming interface configured to format the second information and the third information as one or more data objects, wherein the data objects further comprise attributes and values defined by a user.

6. The search system of claim 1, wherein the search query includes one or more regular expression rules.

7. The search system of claim 1, wherein the table graph further comprises a third node associated with a third data table and wherein executing the search query on the table graph further comprises:

concurrently looking up the first information in the first data table and looking up fourth information in the third data table.

8. The search system of claim 7, wherein the lookups in the first data table and the third data tables are executed concurrently in response to the one or more computing devices automatically determining that the lookups are suitable for concurrent execution based on at least one of: query dependency, query complexity, history of query execution duration, usage statistics of the first, second, and/or third data stores, and/or predicted usage demand of the first, second, and third data stores.

9. The search system of claim 1, wherein the first and fourth fields of the first data table are the same.

10. A table graph system configured to electronically communicate with at least one data store, the table graph system comprising:

one or more physical computing devices having hardware processors configured to execution instructions in order to:

receive instructions to add a first data table as a first node in a table graph;

receive instructions to add a second data table as a second node in the table graph, wherein the first data table and the second data table are of different types;

upon receiving instructions to add a first relationship between the first and second nodes, add the first relationship, wherein the first relationship indicates a first field of the first data table is to be associated with a second field of the second data table;

upon receiving instructions to add a second relationship between the second and first nodes, add the second relationship, wherein the second relationship indicates a third field of the second data table is to be associated with a fourth field of the first data table; and

upon receiving instructions to execute a search query on the table graph, execute the search query by:

looking up first information associated with the search query in the first data table;

looking up second information associated with the first information in the second data table by reference to the first relationship, wherein the first and second information together comprise a first hit of the search query, the first hit comprising a direct hit of the search query;

looking up third information associated with the second information in the first data store by reference to the second link, wherein the third information is different from the first information, and wherein the third information comprises a second hit of the search query, the second hit comprising an indirect hit of the search query; and

providing, for display by the search system, at least:

the second information and a first indication that the second information comprises the direct hit of the search query; and

the third information and a second indication that the third information comprises the indirect hit of the search query.

11. The system of claim 10, wherein the one or more physical computing devices are further configured to:

receive instructions to add a third node linked with the first node and/or the second node; and

receive instructions to indicate the first node and the third node as concurrently processable, wherein the first node and the third node are executable concurrently in response to execution of the search query on the table graph.

12. The system of claim 10, wherein the one or more physical computing devices are further configured to:

receive instructions to add a third node linked with the first node and/or the second node;

receive instructions to execute at least two of the nodes concurrently; and

automatically determine an order of executing the at least two of the nodes concurrently.

13. The system of claim 10, wherein the one or more physical computing devices are further configured to automatically add one or more relationships between the first and second nodes.

14. The system of claim 10, wherein the one or more physical computing devices are further configured to receive instructions to change the relationship between the first and second nodes from a one-directional link to a bi-directional link.

15. The system of claim 10, wherein the first data table and the second data table are located remotely from each other.

16. The search system of claim 9, wherein the second and third fields of the second data table are the same.

Patent Citations (500)

Patent	Date	Inventor	Cited By
US5109399(A)	1992-04-01	Thompson	Applicant
US5329108(A)	1994-07-01	Lamoure	Applicant
US5631981(A)	1997-05-01	Rao et al.	Applicant
US5632009(A)	1997-05-01	Rao et al.	Applicant
US5670987(A)	1997-09-01	Doi et al.	Applicant
US5724575(A)	1998-03-01	Hoover et al.	Applicant
US5781704(A)	1998-07-01	Rossmo	Applicant
US5845300(A)	1998-12-01	Comer	Applicant
US5872973(A)	1999-02-01	Mitchell et al.	Applicant
US5897636(A)	1999-04-01	Kaeser	Applicant
US6057757(A)	2000-05-01	Arrowsmith et al.	Applicant
US6073129(A)	2000-06-01	Levine et al.	Applicant
US6091956(A)	2000-07-01	Hollenberg	Applicant
US6161098(A)	2000-12-01	Wallman	Applicant
US6219053(B1)	2001-04-01	Tachibana et al.	Applicant
US6232971(B1)	2001-05-01	Haynes	Applicant
US6243717(B1)	2001-06-01	Gordon et al.	Applicant
US6247019(B1)	2001-06-01	Davies	Applicant
US6279018(B1)	2001-08-01	Kudrolli et al.	Applicant
US6304873(B1)	2001-10-01	Klein et al.	Applicant
US6341310(B1)	2002-01-01	Leshem et al.	Applicant
US6366933(B1)	2002-04-01	Ball et al.	Applicant
US6369835(B1)	2002-04-01	Lin	Applicant
US6418438(B1)	2002-07-01	Campbell	Applicant
US6456997(B1)	2002-09-01	Shukla	Applicant
US6510504(B2)	2003-01-01	Satyanarayanan	Applicant
US6549944(B1)	2003-04-01	Weinberg et al.	Applicant
US6560620(B1)	2003-05-01	Ching	Applicant
US6574635(B2)	2003-06-01	Stauber et al.	Applicant
US6581068(B1)	2003-06-01	Bensoussan et al.	Applicant
US6594672(B1)	2003-07-01	Lampson et al.	Applicant
US6631496(B1)	2003-10-01	Li et al.	Applicant
US6642945(B1)	2003-11-01	Sharpe	Applicant
US6714936(B1)	2004-03-01	Nevin, III	Applicant
US6745382(B1)	2004-06-01	Zothner	Applicant
US6775675(B1)	2004-08-01	Nwabueze et al.	Applicant
US6828920(B2)	2004-12-01	Owen et al.	Applicant
US6839745(B1)	2005-01-01	Dingari et al.	Applicant
US6877137(B1)	2005-04-01	Rivette et al.	Applicant
US6976210(B1)	2005-12-01	Silva et al.	Applicant
US6980984(B1)	2005-12-01	Huffman et al.	Applicant
US6985950(B1)	2006-01-01	Hanson et al.	Applicant
US7036085(B2)	2006-04-01	Barros	Applicant
US7043702(B2)	2006-05-01	Chi et al.	Applicant
US7055110(B2)	2006-05-01	Kupka et al.	Applicant
US7058648(B1)	2006-06-01	Lightfoot et al.	Applicant
US7111231(B1)	2006-09-01	Huck et al.	Applicant
US7139800(B2)	2006-11-01	Bellotti et al.	Applicant
US7158878(B2)	2007-01-01	Rasmussen et al.	Applicant
US7162475(B2)	2007-01-01	Ackerman	Applicant
US7168039(B2)	2007-01-01	Bertram	Applicant
US7171427(B2)	2007-01-01	Witkowski et al.	Applicant
US7269786(B1)	2007-09-01	Malloy et al.	Applicant
US7278105(B1)	2007-10-01	Kitts	Applicant
US7290698(B2)	2007-11-01	Poslinski et al.	Applicant
US7333998(B2)	2008-02-01	Heckerman et al.	Applicant
US7370047(B2)	2008-05-01	Gorman	Applicant
US7379811(B2)	2008-05-01	Rasmussen et al.	Applicant
US7379903(B2)	2008-05-01	Caballero et al.	Applicant
US7426654(B2)	2008-09-01	Adams et al.	Applicant
US7451397(B2)	2008-11-01	Weber et al.	Applicant
US7454466(B2)	2008-11-01	Bellotti et al.	Applicant
US7461158(B2)	2008-12-01	Rider et al.	Applicant
US7467375(B2)	2008-12-01	Tondreau et al.	Applicant
US7487139(B2)	2009-02-01	Fraleigh et al.	Applicant
US7502786(B2)	2009-03-01	Liu et al.	Applicant
US7525422(B2)	2009-04-01	Bishop et al.	Applicant
US7529727(B2)	2009-05-01	Arning et al.	Applicant
US7558677(B2)	2009-07-01	Jones	Applicant
US7574428(B2)	2009-08-01	Leiserowitz et al.	Applicant
US7579965(B2)	2009-08-01	Bucholz	Applicant
US7596285(B2)	2009-09-01	Brown et al.	Applicant
US7614006(B2)	2009-11-01	Molander	Applicant
US7617232(B2)	2009-11-01	Gabbert et al.	Applicant
US7620628(B2)	2009-11-01	Kapur et al.	Applicant
US7627812(B2)	2009-12-01	Chamberlain et al.	Applicant
US7634717(B2)	2009-12-01	Chamberlain et al.	Applicant
US7703021(B1)	2010-04-01	Flam	Applicant
US7712049(B2)	2010-05-01	Williams et al.	Applicant
US7716077(B1)	2010-05-01	Mikurak	Applicant
US7725530(B2)	2010-05-01	Sah et al.	Applicant
US7725547(B2)	2010-05-01	Albertson et al.	Applicant
US7725728(B2)	2010-05-01	Ama et al.	Applicant
US7730082(B2)	2010-06-01	Sah et al.	Applicant
US7730109(B2)	2010-06-01	Rohrs et al.	Applicant
US7770100(B2)	2010-08-01	Chamberlain et al.	Applicant
US7805457(B1)	2010-09-01	Viola et al.	Applicant
US7809703(B2)	2010-10-01	Balabhadrapatruni et al.	Applicant
US7818658(B2)	2010-10-01	Chen	Applicant
US7894984(B2)	2011-02-01	Rasmussen et al.	Applicant
US7899611(B2)	2011-03-01	Downs et al.	Applicant
US7917376(B2)	2011-03-01	Bellin et al.	Applicant
US7920963(B2)	2011-04-01	Jouline et al.	Applicant
US7933862(B2)	2011-04-01	Chamberlain et al.	Applicant
US7941321(B2)	2011-05-01	Greenstein et al.	Applicant
US7962281(B2)	2011-06-01	Rasmussen et al.	Applicant
US7962495(B2)	2011-06-01	Jain et al.	Applicant
US7962848(B2)	2011-06-01	Bertram	Applicant
US7970240(B1)	2011-06-01	Chao et al.	Applicant
US7971150(B2)	2011-06-01	Raskutti et al.	Applicant
US7984374(B2)	2011-07-01	Caro et al.	Applicant
US8001465(B2)	2011-08-01	Kudrolli et al.	Applicant
US8001482(B2)	2011-08-01	Bhattiprolu et al.	Applicant
US8010545(B2)	2011-08-01	Stefik et al.	Applicant
US8015487(B2)	2011-09-01	Roy et al.	Applicant
US8024778(B2)	2011-09-01	Cash et al.	Applicant
US8036632(B1)	2011-10-01	Cona et al.	Applicant
US8041714(B2)	2011-10-01	Aymeloglu et al.	Applicant
US8103543(B1)	2012-01-01	Zwicky	Applicant
US8112425(B2)	2012-02-01	Baum et al.	Applicant
US8126848(B2)	2012-02-01	Wagner	Applicant
US8134457(B2)	2012-03-01	Velipasalar et al.	Applicant
US8145703(B2)	2012-03-01	Frishert et al.	Applicant
US8185819(B2)	2012-05-01	Sah et al.	Applicant
US8196184(B2)	2012-06-01	Amirov et al.	Applicant
US8214361(B1)	2012-07-01	Sandler et al.	Applicant
US8214764(B2)	2012-07-01	Gemmell et al.	Applicant
US8225201(B2)	2012-07-01	Michael	Applicant
US8229947(B2)	2012-07-01	Fujinaga	Applicant
US8230333(B2)	2012-07-01	Decherd et al.	Applicant
US8280880(B1)	2012-10-01	Aymeloglu et al.	Applicant
US8290942(B2)	2012-10-01	Jones et al.	Applicant
US8301464(B1)	2012-10-01	Cave et al.	Applicant
US8301904(B1)	2012-10-01	Gryaznov	Applicant
US8312367(B2)	2012-11-01	Foster	Applicant
US8312546(B2)	2012-11-01	Alme	Applicant
US8352881(B2)	2013-01-01	Champion et al.	Applicant
US8368695(B2)	2013-02-01	Howell et al.	Applicant
US8397171(B2)	2013-03-01	Klassen et al.	Applicant
US8412707(B1)	2013-04-01	Mianji	Applicant
US8447722(B1)	2013-05-01	Ahuja et al.	Applicant
US8452790(B1)	2013-05-01	Mianji	Applicant
US8463036(B1)	2013-06-01	Ramesh et al.	Applicant
US8489331(B2)	2013-07-01	Kopf et al.	Applicant
US8489641(B1)	2013-07-01	Seefeld et al.	Applicant
US8498984(B1)	2013-07-01	Hwang et al.	Applicant
US8504542(B2)	2013-08-01	Chang et al.	Applicant
US8514082(B2)	2013-08-01	Cova et al.	Applicant
US8515207(B2)	2013-08-01	Chau	Applicant
US8554579(B2)	2013-10-01	Tribble et al.	Applicant
US8554709(B2)	2013-10-01	Goodson et al.	Applicant
US8577911(B1)	2013-11-01	Stepinski et al.	Applicant
US8589273(B2)	2013-11-01	Creeden et al.	Applicant
US8620641(B2)	2013-12-01	Farnsworth et al.	Applicant
US8646080(B2)	2014-02-01	Williamson et al.	Applicant
US8676857(B1)	2014-03-01	Adams et al.	Examiner
US8689108(B1)	2014-04-01	Duffield et al.	Applicant
US8713467(B1)	2014-04-01	Goldenberg et al.	Applicant
US8726379(B1)	2014-05-01	Stiansen et al.	Applicant
US8739278(B2)	2014-05-01	Varghese	Applicant
US8742934(B1)	2014-06-01	Sarpy et al.	Applicant
US8745516(B2)	2014-06-01	Mason et al.	Applicant
US8781169(B2)	2014-07-01	Jackson et al.	Applicant
US8787939(B2)	2014-07-01	Papakipos et al.	Applicant
US8799799(B1)	2014-08-01	Cervelli et al.	Applicant
US8812960(B1)	2014-08-01	Sun et al.	Applicant
US8830322(B2)	2014-09-01	Nerayoff et al.	Applicant
US8832594(B1)	2014-09-01	Thompson et al.	Applicant
US8868537(B1)	2014-10-01	Colgrove et al.	Applicant
US8917274(B2)	2014-12-01	Ma et al.	Applicant
US8924872(B1)	2014-12-01	Bogomolov et al.	Applicant
US8930331(B2)	2015-01-01	McGrew et al.	Applicant
US8937619(B2)	2015-01-01	Sharma et al.	Applicant
US8938686(B1)	2015-01-01	Erenrich et al.	Applicant
US2001/0021936(A1)	2001-09-01	Bertram	Applicant
US2001/0051949(A1)	2001-12-01	Carey et al.	Applicant
US2001/0056522(A1)	2001-12-01	Satyanarayana	Applicant
US2002/0033848(A1)	2002-03-01	Sciammarella et al.	Applicant
US2002/0065708(A1)	2002-05-01	Senay et al.	Applicant
US2002/0091694(A1)	2002-07-01	Hrle et al.	Applicant
US2002/0091707(A1)	2002-07-01	Keller	Applicant
US2002/0095658(A1)	2002-07-01	Shulman	Applicant
US2002/0116120(A1)	2002-08-01	Ruiz et al.	Applicant
US2002/0130907(A1)	2002-09-01	Chi et al.	Applicant
US2002/0174201(A1)	2002-11-01	Ramer et al.	Applicant
US2003/0028560(A1)	2003-02-01	Kudrolli et al.	Applicant
US2003/0039948(A1)	2003-02-01	Donahue	Applicant
US2003/0105759(A1)	2003-06-01	Bess et al.	Applicant
US2003/0115481(A1)	2003-06-01	Baird et al.	Applicant
US2003/0120675(A1)	2003-06-01	Stauber et al.	Applicant
US2003/0144868(A1)	2003-07-01	MacIntyre et al.	Applicant
US2003/0163352(A1)	2003-08-01	Surpin et al.	Applicant
US2003/0200217(A1)	2003-10-01	Ackerman	Applicant
US2003/0212718(A1)	2003-11-01	Tester	Applicant
US2003/0225755(A1)	2003-12-01	Iwayama et al.	Applicant
US2003/0229848(A1)	2003-12-01	Arend et al.	Applicant
US2004/0032432(A1)	2004-02-01	Baynger	Applicant
US2004/0064256(A1)	2004-04-01	Barinek et al.	Applicant
US2004/0085318(A1)	2004-05-01	Hassler et al.	Applicant
US2004/0095349(A1)	2004-05-01	Bito et al.	Applicant
US2004/0111410(A1)	2004-06-01	Burgoon et al.	Examiner
US2004/0117345(A1)	2004-06-01	Bamford et al.	Applicant
US2004/0117387(A1)	2004-06-01	Civetta et al.	Applicant
US2004/0126840(A1)	2004-07-01	Cheng et al.	Applicant
US2004/0143602(A1)	2004-07-01	Ruiz et al.	Applicant
US2004/0148301(A1)	2004-07-01	McKay et al.	Applicant
US2004/0163039(A1)	2004-08-01	Gorman	Applicant
US2004/0181554(A1)	2004-09-01	Heckerman et al.	Applicant
US2004/0193600(A1)	2004-09-01	Kaasten et al.	Applicant
US2004/0205524(A1)	2004-10-01	Richter et al.	Applicant
US2004/0260702(A1)	2004-12-01	Cragun et al.	Applicant
US2005/0027705(A1)	2005-02-01	Sadri et al.	Applicant
US2005/0028094(A1)	2005-02-01	Allyn	Applicant
US2005/0080769(A1)	2005-04-01	Gemmell	Applicant
US2005/0086207(A1)	2005-04-01	Heuer et al.	Applicant
US2005/0097441(A1)	2005-05-01	Herbach et al.	Applicant
US2005/0108231(A1)	2005-05-01	Findleton et al.	Applicant
US2005/0114763(A1)	2005-05-01	Nonomura et al.	Applicant
US2005/0125715(A1)	2005-06-01	Franco et al.	Applicant
US2005/0180330(A1)	2005-08-01	Shapiro	Applicant
US2005/0182793(A1)	2005-08-01	Keenan et al.	Applicant
US2005/0183005(A1)	2005-08-01	Denoue et al.	Applicant
US2005/0246327(A1)	2005-11-01	Yeung et al.	Applicant
US2005/0251786(A1)	2005-11-01	Citron et al.	Applicant
US2005/0289524(A1)	2005-12-01	McGinnes	Applicant
US2006/0026120(A1)	2006-02-01	Carolan et al.	Applicant
US2006/0026170(A1)	2006-02-01	Kreitler et al.	Applicant
US2006/0045470(A1)	2006-03-01	Poslinski et al.	Applicant
US2006/0059139(A1)	2006-03-01	Robinson	Applicant
US2006/0074866(A1)	2006-04-01	Chamberlain et al.	Applicant
US2006/0074881(A1)	2006-04-01	Vembu et al.	Examiner
US2006/0080316(A1)	2006-04-01	Gilmore et al.	Applicant
US2006/0080619(A1)	2006-04-01	Carlson et al.	Applicant
US2006/0116991(A1)	2006-06-01	Calderwood	Applicant
US2006/0129746(A1)	2006-06-01	Porter	Applicant
US2006/0139375(A1)	2006-06-01	Rasmussen et al.	Applicant
US2006/0142949(A1)	2006-06-01	Helt	Applicant
US2006/0149596(A1)	2006-07-01	Surpin et al.	Applicant
US2006/0161558(A1)	2006-07-01	Tamma et al.	Applicant
US2006/0203337(A1)	2006-09-01	White	Applicant
US2006/0209085(A1)	2006-09-01	Wong et al.	Applicant
US2006/0218206(A1)	2006-09-01	Bourbonnais et al.	Applicant
US2006/0218405(A1)	2006-09-01	Ama et al.	Applicant
US2006/0218491(A1)	2006-09-01	Grossman et al.	Applicant
US2006/0218637(A1)	2006-09-01	Thomas et al.	Applicant
US2006/0241974(A1)	2006-10-01	Chao et al.	Applicant
US2006/0242040(A1)	2006-10-01	Rader	Applicant
US2006/0242630(A1)	2006-10-01	Koike et al.	Applicant
US2006/0253502(A1)	2006-11-01	Raman et al.	Applicant
US2006/0265397(A1)	2006-11-01	Bryan et al.	Applicant
US2006/0271277(A1)	2006-11-01	Hu et al.	Applicant
US2006/0279630(A1)	2006-12-01	Aggarwal et al.	Applicant
US2007/0011150(A1)	2007-01-01	Frank	Applicant
US2007/0016363(A1)	2007-01-01	Huang et al.	Applicant
US2007/0038962(A1)	2007-02-01	Fuchs et al.	Applicant
US2007/0050429(A1)	2007-03-01	Goldring et al.	Applicant
US2007/0057966(A1)	2007-03-01	Ohno et al.	Applicant
US2007/0061487(A1)	2007-03-01	Moore et al.	Applicant
US2007/0078832(A1)	2007-04-01	Ott et al.	Applicant
US2007/0083541(A1)	2007-04-01	Fraleigh et al.	Applicant
US2007/0143253(A1)	2007-06-01	Kostamaa et al.	Applicant
US2007/0174760(A1)	2007-07-01	Chamberlain et al.	Applicant
US2007/0192265(A1)	2007-08-01	Chopin et al.	Applicant
US2007/0208497(A1)	2007-09-01	Downs et al.	Applicant
US2007/0208498(A1)	2007-09-01	Barker et al.	Applicant
US2007/0208736(A1)	2007-09-01	Tanigawa et al.	Applicant
US2007/0233756(A1)	2007-10-01	D'Souza et al.	Applicant
US2007/0240062(A1)	2007-10-01	Christena et al.	Applicant
US2007/0266336(A1)	2007-11-01	Nojima et al.	Applicant
US2007/0271317(A1)	2007-11-01	Carmel	Applicant
US2007/0294643(A1)	2007-12-01	Kyle	Applicant
US2008/0015970(A1)	2008-01-01	Brookfield et al.	Applicant
US2008/0040684(A1)	2008-02-01	Crump	Applicant
US2008/0051989(A1)	2008-02-01	Welsh	Applicant
US2008/0052142(A1)	2008-02-01	Bailey et al.	Applicant
US2008/0077597(A1)	2008-03-01	Butler	Applicant
US2008/0077642(A1)	2008-03-01	Carbone et al.	Applicant
US2008/0104019(A1)	2008-05-01	Nath	Applicant
US2008/0104149(A1)	2008-05-01	Vishniac et al.	Applicant
US2008/0126951(A1)	2008-05-01	Sood et al.	Applicant
US2008/0155440(A1)	2008-06-01	Trevor et al.	Applicant
US2008/0162616(A1)	2008-07-01	Gross et al.	Applicant
US2008/0195417(A1)	2008-08-01	Surpin et al.	Applicant
US2008/0195608(A1)	2008-08-01	Clover	Applicant
US2008/0195672(A1)	2008-08-01	Hamel et al.	Applicant
US2008/0201339(A1)	2008-08-01	McGrew	Applicant
US2008/0215546(A1)	2008-09-01	Baum et al.	Applicant
US2008/0222295(A1)	2008-09-01	Robinson et al.	Applicant
US2008/0255973(A1)	2008-10-01	El Wade et al.	Applicant
US2008/0263468(A1)	2008-10-01	Cappione et al.	Applicant
US2008/0267107(A1)	2008-10-01	Rosenberg	Applicant
US2008/0270316(A1)	2008-10-01	Guidotti et al.	Applicant
US2008/0276167(A1)	2008-11-01	Michael	Applicant
US2008/0278311(A1)	2008-11-01	Grange et al.	Applicant
US2008/0288306(A1)	2008-11-01	MacIntyre et al.	Applicant
US2008/0301643(A1)	2008-12-01	Appleton et al.	Applicant
US2009/0002492(A1)	2009-01-01	Velipasalar et al.	Applicant
US2009/0027418(A1)	2009-01-01	Maru et al.	Applicant
US2009/0030915(A1)	2009-01-01	Winter et al.	Applicant
US2009/0031247(A1)	2009-01-01	Walter et al.	Applicant
US2009/0055251(A1)	2009-02-01	Shah et al.	Applicant
US2009/0076845(A1)	2009-03-01	Bellin et al.	Applicant
US2009/0088964(A1)	2009-04-01	Schaaf et al.	Applicant
US2009/0106308(A1)	2009-04-01	Killian et al.	Applicant
US2009/0119309(A1)	2009-05-01	Gibson et al.	Applicant
US2009/0125369(A1)	2009-05-01	Kloostra et al.	Applicant
US2009/0125459(A1)	2009-05-01	Norton et al.	Applicant
US2009/0132921(A1)	2009-05-01	Hwangbo et al.	Applicant
US2009/0132953(A1)	2009-05-01	Reed et al.	Applicant
US2009/0144262(A1)	2009-06-01	White et al.	Applicant
US2009/0144274(A1)	2009-06-01	Fraleigh et al.	Applicant
US2009/0164387(A1)	2009-06-01	Armstrong et al.	Applicant
US2009/0164934(A1)	2009-06-01	Bhattiprolu et al.	Applicant
US2009/0171939(A1)	2009-07-01	Athsani et al.	Applicant
US2009/0172511(A1)	2009-07-01	Decherd et al.	Applicant
US2009/0177962(A1)	2009-07-01	Gusmorino et al.	Applicant
US2009/0179892(A1)	2009-07-01	Tsuda et al.	Applicant
US2009/0222400(A1)	2009-09-01	Kupershmidt et al.	Applicant
US2009/0222760(A1)	2009-09-01	Halverson et al.	Applicant
US2009/0234720(A1)	2009-09-01	George et al.	Applicant
US2009/0249244(A1)	2009-10-01	Robinson et al.	Applicant
US2009/0271435(A1)	2009-10-01	Yako et al.	Applicant
US2009/0281839(A1)	2009-11-01	Lynn et al.	Applicant
US2009/0287470(A1)	2009-11-01	Farnsworth et al.	Applicant
US2009/0292626(A1)	2009-11-01	Oxford	Applicant
US2009/0313223(A1)	2009-12-01	Rantanen	Applicant
US2009/0313311(A1)	2009-12-01	Hoffmann et al.	Applicant
US2010/0011282(A1)	2010-01-01	Dollard et al.	Applicant
US2010/0036831(A1)	2010-02-01	Vemuri et al.	Applicant
US2010/0042922(A1)	2010-02-01	Bradateanu et al.	Applicant
US2010/0057716(A1)	2010-03-01	Stefik et al.	Applicant
US2010/0070523(A1)	2010-03-01	Delgo et al.	Applicant
US2010/0070842(A1)	2010-03-01	Aymeloglu et al.	Applicant
US2010/0070897(A1)	2010-03-01	Aymeloglu et al.	Applicant
US2010/0076939(A1)	2010-03-01	Iwaki et al.	Applicant
US2010/0082541(A1)	2010-04-01	Kottomtharayil	Applicant
US2010/0100963(A1)	2010-04-01	Mahaffey	Applicant
US2010/0103124(A1)	2010-04-01	Kruzeniski et al.	Applicant
US2010/0114817(A1)	2010-05-01	Broeder et al.	Applicant
US2010/0114831(A1)	2010-05-01	Gilbert et al.	Applicant
US2010/0114887(A1)	2010-05-01	Conway et al.	Applicant
US2010/0122152(A1)	2010-05-01	Chamberlain et al.	Applicant
US2010/0131457(A1)	2010-05-01	Heimendinger	Applicant
US2010/0138842(A1)	2010-06-01	Balko et al.	Applicant
US2010/0145909(A1)	2010-06-01	Ngo	Applicant
US2010/0161565(A1)	2010-06-01	Lee et al.	Applicant
US2010/0161688(A1)	2010-06-01	Kesselman et al.	Applicant
US2010/0162176(A1)	2010-06-01	Dunton	Applicant
US2010/0191563(A1)	2010-07-01	Schlaifer et al.	Applicant
US2010/0191884(A1)	2010-07-01	Holenstein et al.	Applicant
US2010/0198684(A1)	2010-08-01	Eraker et al.	Applicant
US2010/0199225(A1)	2010-08-01	Coleman et al.	Applicant
US2010/0211550(A1)	2010-08-01	Daniello et al.	Applicant
US2010/0211618(A1)	2010-08-01	Anderson et al.	Applicant
US2010/0228812(A1)	2010-09-01	Uomini	Applicant
US2010/0235606(A1)	2010-09-01	Oreland et al.	Applicant
US2010/0250412(A1)	2010-09-01	Wagner	Applicant
US2010/0280857(A1)	2010-11-01	Liu et al.	Applicant
US2010/0283787(A1)	2010-11-01	Hamedi et al.	Applicant
US2010/0293174(A1)	2010-11-01	Bennett et al.	Applicant
US2010/0306713(A1)	2010-12-01	Geisner et al.	Applicant
US2010/0321399(A1)	2010-12-01	Ellren et al.	Applicant
US2010/0325526(A1)	2010-12-01	Ellis et al.	Applicant
US2010/0325581(A1)	2010-12-01	Finkelstein et al.	Applicant
US2010/0330801(A1)	2010-12-01	Rouh	Applicant
US2011/0029498(A1)	2011-02-01	Ferguson et al.	Applicant
US2011/0047159(A1)	2011-02-01	Baid et al.	Applicant
US2011/0060753(A1)	2011-03-01	Shaked et al.	Applicant
US2011/0061013(A1)	2011-03-01	Bilicki et al.	Applicant
US2011/0074811(A1)	2011-03-01	Hanson et al.	Applicant
US2011/0078055(A1)	2011-03-01	Faribault et al.	Applicant
US2011/0078173(A1)	2011-03-01	Seligmann et al.	Applicant
US2011/0117878(A1)	2011-05-01	Barash et al.	Applicant
US2011/0119100(A1)	2011-05-01	Ruhl et al.	Applicant
US2011/0131547(A1)	2011-06-01	Elaasar	Applicant
US2011/0137766(A1)	2011-06-01	Rasmussen et al.	Applicant
US2011/0153384(A1)	2011-06-01	Horne et al.	Applicant
US2011/0161096(A1)	2011-06-01	Buehler et al.	Applicant
US2011/0167105(A1)	2011-07-01	Ramakrishnan et al.	Applicant
US2011/0170799(A1)	2011-07-01	Carrino et al.	Applicant
US2011/0173032(A1)	2011-07-01	Payne et al.	Applicant
US2011/0173619(A1)	2011-07-01	Fish	Applicant
US2011/0184813(A1)	2011-07-01	Barnes et al.	Applicant
US2011/0208724(A1)	2011-08-01	Jones et al.	Applicant
US2011/0218934(A1)	2011-09-01	Elser	Applicant
US2011/0219450(A1)	2011-09-01	McDougal et al.	Applicant
US2011/0225198(A1)	2011-09-01	Edwards et al.	Applicant
US2011/0258158(A1)	2011-10-01	Resende et al.	Applicant
US2011/0258242(A1)	2011-10-01	Eidson et al.	Applicant
US2011/0270705(A1)	2011-11-01	Parker	Applicant
US2011/0270812(A1)	2011-11-01	Ruby	Applicant
US2011/0291851(A1)	2011-12-01	Whisenant	Applicant
US2011/0310005(A1)	2011-12-01	Chen et al.	Applicant
US2011/0314007(A1)	2011-12-01	Dassa et al.	Applicant
US2012/0013684(A1)	2012-01-01	Lucia	Applicant
US2012/0019559(A1)	2012-01-01	Siler et al.	Applicant
US2012/0036013(A1)	2012-02-01	Neuhaus et al.	Applicant
US2012/0036434(A1)	2012-02-01	Oberstein	Applicant
US2012/0066296(A1)	2012-03-01	Appleton et al.	Applicant
US2012/0072825(A1)	2012-03-01	Sherkin et al.	Applicant
US2012/0079363(A1)	2012-03-01	Folting et al.	Applicant
US2012/0106801(A1)	2012-05-01	Jackson	Applicant
US2012/0117082(A1)	2012-05-01	Koperda et al.	Applicant
US2012/0131512(A1)	2012-05-01	Takeuchi et al.	Applicant
US2012/0144335(A1)	2012-06-01	Abeln et al.	Applicant
US2012/0150791(A1)	2012-06-01	Willson	Applicant
US2012/0159307(A1)	2012-06-01	Chung et al.	Applicant
US2012/0159362(A1)	2012-06-01	Brown et al.	Applicant
US2012/0159399(A1)	2012-06-01	Bastide et al.	Applicant
US2012/0173985(A1)	2012-07-01	Peppel	Applicant
US2012/0196557(A1)	2012-08-01	Reich et al.	Applicant
US2012/0196558(A1)	2012-08-01	Reich et al.	Applicant
US2012/0208636(A1)	2012-08-01	Feige	Applicant
US2012/0221511(A1)	2012-08-01	Gibson et al.	Applicant
US2012/0221553(A1)	2012-08-01	Wittmer et al.	Applicant
US2012/0221580(A1)	2012-08-01	Barney	Applicant
US2012/0245976(A1)	2012-09-01	Kumar et al.	Applicant
US2012/0246148(A1)	2012-09-01	Dror	Applicant
US2012/0254129(A1)	2012-10-01	Wheeler et al.	Applicant
US2012/0290879(A1)	2012-11-01	Shibuya et al.	Applicant
US2012/0296907(A1)	2012-11-01	Long et al.	Applicant
US2012/0323888(A1)	2012-12-01	Osann, Jr.	Applicant
US2012/0330908(A1)	2012-12-01	Stowe et al.	Applicant
US2012/0330973(A1)	2012-12-01	Ghuneim et al.	Applicant
US2013/0006725(A1)	2013-01-01	Simanek et al.	Applicant
US2013/0036346(A1)	2013-02-01	Cicerone	Applicant
US2013/0046842(A1)	2013-02-01	Muntz et al.	Applicant
US2013/0060786(A1)	2013-03-01	Serrano et al.	Applicant
US2013/0061169(A1)	2013-03-01	Pearcy et al.	Applicant
US2013/0073377(A1)	2013-03-01	Heath	Applicant
US2013/0073454(A1)	2013-03-01	Busch	Applicant
US2013/0078943(A1)	2013-03-01	Biage et al.	Applicant
US2013/0097130(A1)	2013-04-01	Bingol et al.	Applicant
US2013/0097482(A1)	2013-04-01	Marantz et al.	Applicant
US2013/0101159(A1)	2013-04-01	Chao et al.	Applicant
US2013/0111320(A1)	2013-05-01	Campbell et al.	Applicant
US2013/0117651(A1)	2013-05-01	Waldman et al.	Applicant
US2013/0150004(A1)	2013-06-01	Rosen	Applicant
US2013/0151148(A1)	2013-06-01	Parundekar et al.	Applicant
US2013/0157234(A1)	2013-06-01	Gulli et al.	Applicant
US2013/0176321(A1)	2013-07-01	Mitchell et al.	Applicant
US2013/0179420(A1)	2013-07-01	Park et al.	Applicant
US2013/0224696(A1)	2013-08-01	Wolfe et al.	Applicant
US2013/0238616(A1)	2013-09-01	Rose et al.	Applicant
US2013/0246170(A1)	2013-09-01	Gross et al.	Applicant
US2013/0251233(A1)	2013-09-01	Yang et al.	Applicant
US2013/0262527(A1)	2013-10-01	Hunter et al.	Applicant
US2013/0263019(A1)	2013-10-01	Castellanos et al.	Applicant
US2013/0268520(A1)	2013-10-01	Fisher et al.	Applicant
US2013/0279757(A1)	2013-10-01	Kephart	Applicant
US2013/0282696(A1)	2013-10-01	John et al.	Applicant
US2013/0290011(A1)	2013-10-01	Lynn et al.	Applicant
US2013/0290825(A1)	2013-10-01	Arndt et al.	Applicant
US2013/0297619(A1)	2013-11-01	Chandrasekaran et al.	Applicant
US2013/0311375(A1)	2013-11-01	Priebatsch	Applicant
US2013/0318060(A1)	2013-11-01	Chang et al.	Applicant
US2014/0019936(A1)	2014-01-01	Cohanoff	Applicant
US2014/0032506(A1)	2014-01-01	Hoey et al.	Applicant
US2014/0033010(A1)	2014-01-01	Richardt et al.	Applicant
US2014/0040371(A1)	2014-02-01	Gurevich et al.	Applicant
US2014/0047357(A1)	2014-02-01	Alfaro et al.	Applicant
US2014/0059038(A1)	2014-02-01	McPherson et al.	Applicant
US2014/0068487(A1)	2014-03-01	Steiger et al.	Applicant
US2014/0095509(A1)	2014-04-01	Patton	Applicant
US2014/0108068(A1)	2014-04-01	Williams	Applicant
US2014/0108380(A1)	2014-04-01	Gotz et al.	Applicant
US2014/0108985(A1)	2014-04-01	Scott et al.	Applicant
US2014/0149272(A1)	2014-05-01	Hirani et al.	Applicant
US2014/0156527(A1)	2014-06-01	Grigg et al.	Applicant
US2014/0157172(A1)	2014-06-01	Peery et al.	Applicant
US2014/0164502(A1)	2014-06-01	Khodorenko et al.	Applicant
US2014/0189536(A1)	2014-07-01	Lange et al.	Applicant
US2014/0195515(A1)	2014-07-01	Baker et al.	Applicant
US2014/0195887(A1)	2014-07-01	Ellis et al.	Applicant
US2014/0267294(A1)	2014-09-01	Ma	Applicant
US2014/0267295(A1)	2014-09-01	Sharma	Applicant
US2014/0279824(A1)	2014-09-01	Tamayo	Applicant
US2014/0316911(A1)	2014-10-01	Gross	Applicant
US2014/0333651(A1)	2014-11-01	Cervelli et al.	Applicant
US2014/0337772(A1)	2014-11-01	Cervelli et al.	Applicant
US2014/0344231(A1)	2014-11-01	Stowe et al.	Applicant
US2015/0019394(A1)	2015-01-01	Unser et al.	Applicant
US2015/0046870(A1)	2015-02-01	Goldenberg et al.	Applicant
US2015/0089424(A1)	2015-03-01	Duffield et al.	Applicant
DE102014103482	2014-09-01		Applicant
DE102014215621	2015-02-01		Applicant
EP1672527	2006-06-01		Applicant
EP2551799	2013-01-01		Applicant
EP2555126	2013-02-01		Applicant
EP2778983	2014-09-01		Applicant
EP2779082	2014-09-01		Applicant
EP2778977	2014-09-01		Applicant
EP2835745	2015-02-01		Applicant
EP2835770	2015-02-01		Applicant
EP2838039	2015-02-01		Applicant
EP2846241	2015-03-01		Applicant
EP2851852	2015-03-01		Applicant
EP2858014	2015-04-01		Applicant
EP2858018	2015-04-01		Applicant
GB2516155	2015-01-01		Applicant
GB2518745	2015-04-01		Applicant
NL2012778	2014-11-01		Applicant
NL2013306	2015-02-01		Applicant
WO/009529	2000-02-01		Applicant
WO2005/104736	2005-11-01		Applicant
WO2009/061501	2009-05-01		Applicant
WO2010/000014	2010-01-01		Applicant
WO2010/030913	2010-03-01		Applicant
WO2013/010157	2013-01-01		Applicant
WO2013/102892	2013-07-01		Applicant

Non-Patent Literature (140)

“A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.Applicant
“A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.Applicant
Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.Applicant
Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/, Jan. 21, 2006, pp. 8.Applicant
Anonymous, “BackTuIt—JD Edwards One World Version Control System,” printed Jul. 23, 2007 in 1 page.Applicant
Antoshenkov, Gennady, “Dictionary-Based Order-Preserving String Compression,” The VLDB Journal, 1997, vol. 6, pp. 26-39.Applicant
“Apache HBase,” http://hbase.apache.org/ printed Sep. 14, 2011 in 1 page.Applicant
Baker et al., “Megastore: Providing Scalable, Highly Available Storage for Interactive Services,” 5th Biennial Conference on Innovative Data Systems Research (CIDR '11), Jan. 9-12, 2011, Asilomar, California, pp. 12.Applicant
Bernstein et al., “Hyder—A Transactional Record Manager for Shared Flash,” 5th Biennial Conference on Innovative Data Systems Research (CIDR '11), Jan. 9-12, 2011, Asilomar, California, pp. 12.Applicant
Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.Applicant
Bugzilla@Mozilla, “Bug 18726—[feature] Long-click means of invoking contextual menus not supported,” http://bugzilla.mozilla.org/show—bug.cgi?id=18726 printed Jun. 13, 2013 in 11 pages.Applicant
Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.Applicant
Chang et al., “Bigtable: A Distributed Storage System for Structured Data”, Google, Inc., OSDI'06: Seventh Symposium on Operating System Design and Implementation, Seattle, WA, Nov. 2006, pp. 14.Applicant
Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152.Applicant
Conner, Nancy, “Google Apps: The Missing Manual,” Sharing and Collaborating on Documents, May 1, 2008, pp. 93-97, 106-113 & 120-121.Applicant
Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679.Applicant
Devanbu et al., “Authentic Third-party Data Publication,” 2000, pp. 19, http://www.cs.ucdavis.edu/˜devanbu/authdbpub.pdf.Applicant
Donjerkovic et al., “Probabilistic Optimization of Top N Queries,” Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp. 411-422.Applicant
Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411.Applicant
Dreyer et al., “An Object-Oriented Data Model for a Time Series Management System,” Proceedings of the 7th International Working Conference on Scientific and Statistical Database Management, Charlottesville, Virginia USA, Sep. 28-30, 1994, pp. 12.Applicant
Elmasri et al., “Fundamentals of Database Systems,” 2004, Fourth Edition, pp. 455-491.Applicant
GIS-Net 3 Public—Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3—Public/Viewer.html.Applicant
Goswami, Gautam, “Quite ‘Writely’ Said!” One Brick at a Time, Aug. 21, 2005, pp. 7.Applicant
Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.Applicant
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Elsevier Science, Sep. 2010, Ch. 4 & 10, pp. 53-67 & 143-164.Applicant
Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.Applicant
Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.Applicant
Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.Applicant
Kahan et al., “Annotea: An Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, 2002, vol. 39, pp. 589-608.Applicant
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf downloaded May 12, 2014 in 8 pages.Applicant
Keylines.com, “KeyLines Datasheet,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf downloaded May 12, 2014 in 2 pages.Applicant
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf downloaded May 12, 2014 in 10 pages.Applicant
Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.Applicant
Klemmer et al., “Where Do Web Sites Come From? Capturing and Interacting with Design History,” Association for Computing Machinery, CHI 2002, Apr. 20-25, 2002, Minneapolis, MN, pp. 8.Applicant
Kokossi et al., “D7-Dynamic Ontoloty Management System (Design),” Information Societies Technology Programme, Jan. 10, 2002, pp. 1-27.Applicant
Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.Applicant
Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.Applicant
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.Applicant
Manske, “File Saving Dialogs,” http://www.mozilla.org/editor/ui—specs/FileSaveDialogs.html, Jan. 20, 1999, pp. 7.Applicant
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.Applicant
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.Applicant
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.Applicant
Mentzas et al. “An Architecture for Intelligent Assistance in the Forecasting Process,” Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, Jan. 3-6, 1995, vol. 3, pp. 167-176.Applicant
Microsoft—Developer Network, “Getting Started with VBA in Word 2010,” Apr. 2010, http://msdn.microsoft.com/en-us/library/ff604039%28v=office.14%29.aspx as printed Apr. 4, 2014 in 17 pages.Applicant
Microsoft Office—Visio, “About connecting shapes,” http://office.microsoft.com/en-us/visio-help/about-connecting-shapes-HP085050369.aspx printed Aug. 4, 2011 in 6 pages.Applicant
Microsoft Office—Visio, “Add and glue connectors with the Connector tool,” http://office.microsoft.com/en-us/visio-help/add-and-glue-connectors-with-the-connector-tool-HA010048532.aspx?CTT=1, printed Aug. 4, 2011 in 1 page.Applicant
Miklau et al., “Securing History: Privacy and Accountability in Database Systems,” 3rd Biennial Conference on Innovative Data Systems Research (CIDR), Jan. 7-10, 2007, Asilomar, California, pp. 387-396.Applicant
Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.Applicant
Niepert et al., “A Dynamic Ontology for a Dynamic Reference Work”, Joint Conference on Digital Libraries, Jun. 17-22, 2007, Vancouver, British Columbia, Canada, pp. 1-10.Applicant
Peng et al., “Large-scale Incremental Processing Using Distributed Transactions and Notifications” Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, USENIX, 2010, pp. 14.Applicant
Rouse, Margaret, “OLAP Cube,” http://searchdatamanagement.techtarget.com/definition/OLAP-cube, Apr. 28, 2012, pp. 16.Applicant
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.Applicant
Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.Applicant
“The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.Applicant
“The Apache Cassandra Project,” http://cassandra.apache.org/ printed Sep. 14, 2011 in 3 pages.Applicant
Thomson et al., “The Case for Determinism in Database Systems,” The 36th International Conference on Very Large Data Bases, Sep. 13-17, 2010, Singapore, Proceedings of the VLDB Endowment, vol. 3, No. 1, pp. 11.Applicant
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].Applicant
Wollrath et al., “A Distributed Object Model for the Java System,” Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996, pp. 219-231.Applicant
Official Communication in Canadian Patent Application No. 2,677,464, dated Mar. 19, 2012.Applicant
Official Communication in Canadian Patent Application No. 2,677,464, dated Aug. 22, 2012.Applicant
Official Communication in Canadian Patent Application No. 2,677,464, dated Jan. 16, 2013.Applicant
European Search Report in European Application No. EP08730336.8, dated Jun. 6, 2012.Applicant
International Search Report and Written Opinion in Application No. PCT/US2008/054511, dated Jul. 31, 2008.Applicant
International Search Report and Written Opinion in Application No. PCT/US2009/056703, dated Mar. 15, 2010.Applicant
Extended European Search Report in European Application No. EP 12182274.6, dated Nov. 5, 2012.Applicant
Official Communication in European Application No. EP 13157474.1 dated May 28, 2013.Applicant
Official Communication in New Zealand Application No. 616212 dated Oct. 9, 2013.Applicant
Official Communication in New Zealand Application No. 616212 dated May 7, 2014.Applicant
Official Communication in European Application No. EP 12179096.8 dated Mar. 13, 2013.Applicant
Official Communication in European Application No. EP 14158861.6 dated Jun. 16, 2014.Applicant
Official Communication in New Zealand Application No. 622517 dated Apr. 3, 2014.Applicant
Official Communication in New Zealand Application No. 624557 dated May 14, 2014.Applicant
Official Communication in New Zealand Application No. 628585 dated Aug. 26, 2014.Applicant
Official Communication in New Zealand Application No. 628263 dated Aug. 12, 2014.Applicant
Official Communication in Great Britain Application No. 1404457.2 dated Aug. 14, 2014.Applicant
Official Communication in New Zealand Application No. 627962 dated Aug. 5, 2014.Applicant
Chung, Chin-Wan, “Dataplex: An Access to Heterogeneous Distributed Databases,” Communications of the ACM, Association for Computing Machinery, Inc., vol. 33, No. 1, Jan. 1, 1990, pp. 70-80.Applicant
Definition “Identify” downloaded Jan. 22, 2015, 1 page.Applicant
Definition “Overlay” downloaded Jan. 22, 2015, 1 page.Applicant
Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages.Applicant
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” 14th International Conference on World Wide Web, WWW 2005: Chiba, Japan, May 10-14, 2005, pp. 86-95.Applicant
Nierman, “Evaluating Structural Similarity in XML Documents,” 2002, 6 pages.Applicant
Olanoff, Drew, “Deep Dive with the New Google Maps for Desktop with Google Earth Integration, It's More than Just a Utility,” May 15, 2013, pp. 1-6, retrieved from the internet: http://web.archive.org/web/20130515230641/http://techcrunch.com/2013/05/15/deep-dive-with-the-new-google-maps-for-desktop-with-google-earth-integration-its-more-than-just-a-utility/.Applicant
Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64.Applicant
Wikipedia, “Federated Database System,” Sep. 7, 2013, retrieved from the internet on Jan. 27, 2015 http://en.wikipedia.org/w/index.php?title=Federated—database—system&oldid=571954221.Applicant
Yang et al., “HTML Page Analysis Based on Visual Cues,” 2001, pp. 859-864.Applicant
Notice of Allowance for U.S. Appl. No. 14/102,394 dated Aug. 25, 2014.Applicant
Notice of Allowance for U.S. Appl. No. 14/108,187 dated Aug. 29, 2014.Applicant
Notice of Allowance for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014.Applicant
Notice of Allowance for U.S. Appl. No. 14/268,964 dated Dec. 3, 2014.Applicant
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.Applicant
Notice of Allowance for U.S. Appl. No. 14/192,767 dated Dec. 16, 2014.Applicant
Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014.Applicant
Official Communication for European Patent Application No. 14159464.8 dated Jul. 31, 2014.Applicant
Official Communication for New Zealand Patent Application No. 628840 dated Aug. 28, 2014.Applicant
Official Communication in New Zealand Patent Application No. 628495 dated Aug. 19, 2014.Applicant
Official Communication for Great Britain Patent Application No. 1408025.3 dated Nov. 6, 2014.Applicant
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.Applicant
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.Applicant
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.Applicant
Official Communication for Great Britain Patent Application No. 1413935.6 dated Jan. 27, 2015.Applicant
Official Communication for European Patent Application No. 14180281.9 dated Jan. 26, 2015.Applicant
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.Applicant
Official Communication for European Patent Application No. 14180142.3 dated Feb. 6, 2015.Applicant
Official Communication for European Patent Application No. 14186225.0 dated Feb. 13, 2015.Applicant
Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015.Applicant
Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015.Applicant
Official Communication for European Patent Application No. 14189347.9 dated Mar. 4, 2015.Applicant
Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015.Applicant
Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.Applicant
Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014.Applicant
Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.Applicant
Official Communication for U.S. Appl. No. 14/268,964 dated Sep. 3, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.Applicant
Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014.Applicant
Official Communication for U.S. Appl. No. 14/148,568 dated Oct. 22, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.Applicant
Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014.Applicant
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 23, 2014.Applicant
Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014.Applicant
Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014.Applicant
Official Communication for U.S. Appl. No. 14/319,765 dated Nov. 25, 2014.Applicant
Official Communication for U.S. Appl. No. 14/323,935 dated Nov. 28, 2014.Applicant
Official Communication for U.S. Appl. No. 14/326,738 dated Dec. 2, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.Applicant
Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015.Applicant
Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 4, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.Applicant
Official Communication for U.S. Appl. No. 14/306,138 dated Feb. 18, 2015.Applicant
Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.Applicant
Official Communication for U.S. Appl. No. 14/473,552 dated Feb. 24, 2015.Applicant
Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 2015.Applicant
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015.Applicant
Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015.Applicant
Official Communication for U.S. Appl. No. 14/323,935 dated Mar. 31, 2015.Applicant
Official Communication for U.S. Appl. No. 14/326,738 dated Mar. 31, 2015.Applicant
Official Communication for U.S. Appl. No. 14/278,963 dated Jan. 30, 2015.Applicant

Abstract