The present invention relates generally to data science, machine and deep learning computer algorithms, data graph modeling, and analysis of linked data. More specifically, techniques for management of integrated access to public and privately-accessible datasets are described.
As demand for data and data science expands rapidly, significant research into potential uses of data in various applications are also increasing at a dramatic rate. With enormous amounts of data and information becoming increasingly available, utilizing data is becoming a greater focus of both consumer and commercial activities alike. Datasets (i.e., sets or groups of logically-related data and/or information) are being created to provide statistical information that researchers are using to discover new innovations and applications in almost every aspect of contemporary life and lifestyles. However, utilizing data also involves addressing a growing problem, which includes identifying data, sources thereof, and managing the ever-increasing amount of data becoming available. Moreover, as the amount and complexity of data, datasets, databases, datastores and data storage facilities increase, the ability to identify, locate, retrieve, analyze, and present data in useful ways is also becoming increasingly difficult. Today, managing large amounts of data for useful purposes poses a significant problem for individual users, organizations, and entities alike. Conventional techniques are problematic in that these are neither capable nor configured to manage large scale problems such as providing integrated access to data that is both available on public resources as well as those that are hosted or stored on private (i.e., secure (i.e., requiring authentication or authorization before access is permitted)) data storage resources. More importantly, users are typically burdened by conventional techniques in that access to data often requires not only proficient, if not expert, knowledge of both computer programming languages commonly known and used by data researchers and scientists (e.g., Python, or others), but knowledge of complex computer databases, datastores, data repositories, data warehouses, data and object schema, data modeling, graph modeling, graph data, linked data, and numerous other data science topics is also required. Queries executed to retrieve data using conventional techniques typically require knowledge of specific programming or formatting languages, which can limit the usability of data. Specifically, conventional techniques are problematic because these lack intrinsic knowledge or technical functionality to permit a user such as a data scientist to locate, manage, access, and execute queries to retrieve data from various disparate and often dissimilar data resources.
Thus, what is needed is a solution for managing consolidated, integrated access to public and/or privately-accessible (i.e., secure) data without the limitations of conventional techniques.
Various embodiments or examples (“examples”) of the invention are disclosed in the following detailed description and the accompanying drawings:
Various embodiments or examples may be implemented in numerous ways, including as a system, a process, an apparatus, a user interface, or a series of program instructions on a computer readable medium such as a computer readable storage medium or a computer network where the program instructions are sent over optical, electronic, or wireless communication links. In general, operations of disclosed processes may be performed in an arbitrary order, unless otherwise provided in the claims.
A detailed description of one or more examples is provided below along with accompanying figures. The detailed description is provided in connection with such examples, but is not limited to any particular example. The scope is limited only by the claims and numerous alternatives, modifications, and equivalents are encompassed. Numerous specific details are set forth in the following description in order to provide a thorough understanding. These details are provided for the purpose of example and the described techniques may be practiced according to the claims without some or all of these specific details. For clarity, technical material that is known in the technical fields related to the examples has not been described in detail to avoid unnecessarily obscuring the description.
As illustrated in exemplary topology 100, in some examples, dataset access platform 102 may be configured to access public and/or privately-accessible datasets that are hosted on one or more databases, some, all, or none of which may be hosted on data networks such as networks 108-112. As used herein, “dataset access platform,” “access platform,” and “platform” may be used interchangeably without limitation and, in some examples, refers to a computer program, software, firmware, circuitry, algorithms, logic, hardware, or a combination thereof in order to implement techniques (e.g., systems, processes, or the like) for providing integrated query, access, retrieval, and other data operations using public and private datasets. As shown in topology 100, platform 102 may be configured to access databases 104-106, 114-118, 122 and/or datastore 123 including databases 124-128 in order to execute a query to retrieve one or more datasets stored in these elements. Datasets may be retrieved by, for example, data scientists, researchers, or any other user who may be interested in querying and retrieving a dataset for a given purpose. Datasets may include any type, form, format, or amount of publicly-accessible sources of data such as those available from Data.Gov, the U.S. Department of Defense, oceanographic data from the National Oceanic and Atmospheric Administration (NOAA), as well as privately collected, curated, managed, and created datasets such as those found on corporate, non-profit, research, scientific, or academic data networks. Datasets may be retrieved from a large number of sources and, as used herein, are not intended to be limited to any specific type, source, or format of data. In some examples, network 108 may be a publicly-accessible data network that includes one or more databases such as databases 114-118.
In some examples, databases 104-106, 114-118, 122 and datastore 123 including databases 124-128 may be accessed or used by dataset access platform 102 using a “farm” or collection of graph database engines (see element 228 (
As shown, platform 102 may be configured to access datasets stored on publicly-accessible (i.e., public or open) databases 104-106 and 114-118 or, in some examples, private database 122 and/or datastore 123 and databases 124-128. Platform 102, in some examples, may be a platform or application such as that developed by Data.World of Austin, Texas, including various features and functionality, as described in some of those properties incorporated by reference as set forth above. As shown, datastore 123 includes databases 124-128, although the number, type, format, data schema, and other characteristics may be varied and are not limited to the examples shown and described. For example, datastore 123 may use a database management system (not shown) to manage databases 124-128. As shown here, platform 102 may be configured to communicate over one or more other data networks such as the Internet, a private data network, or a computing cloud, without limitation to the type of data network provided a layered topology is used to communicate queries to/from platform 102 and a destination or target database (e.g., databases 104-106, 114-118, 122 and datastore 123 including databases 124-128). Platform 102 may also be configured to access datastore 123, which could be housed and operated on a separate data network (e.g., data network 112) than another data network through which a query or request is transmitted, passed, or sent (e.g., data network 110). In other words, platform 102 may be a standalone, distributed, local, remote, or cloud-based application, process, algorithm(s), computer program, software, firmware, hardware, server, or the like (hereafter “application”) that may be a standalone or distributed application, the latter of which may have one or more resources housed, stored in memory, executed from, or reside on disparate physical resources (e.g., servers, computers, or the like) in different geographic locations. However, when a query or request to query (the terms “query,” “request,” or “request to query” may be used interchangeably herein) is received by platform 102 for one or more of databases 104-106, 114-118, 122 and datastore 123 including databases 124-128, platform 102 may be configured to receive, parse, interpret, convert, rewrite, optimize, and execute the query in order to retrieve a dataset from one of the aforementioned data sources (i.e., databases 104-106, 114-118, 122 and datastore 123 including databases 124-128).
In some examples, a query (e.g., sent in SQL, SPARQL, R, Python, Java, Javascript, JSON, XML, or any other programming or formatting language that is used to generate and send queries for retrieving datasets) may be received by platform 102 and sent to access control module 120 (as with platform 102, access control module 120 may be a standalone, distributed, local, remote, or cloud-based application, process, algorithm(s), computer program, software, firmware, hardware, server, or the like (hereafter “application”)), which provides access control functionality and prevents unauthorized access to datasets stored on one or more of databases 122 and 124-128 and datastore 123. In other words, access control module 120 receives queries on behalf of, for example, a private data network (e.g., network 112), which could be a scientific, academic, research, governmental, military, financial, corporate, non-profit, or any other type of data network in which non-public access is desired or security measures including, but not limited to access control module 120, are intended to limit, deter, or prevent access. If the query received by platform 102 and sent to network 112, which is an exemplary private data network, is rejected due to a lack of authorization or permission to access the dataset and/or data network (i.e., an access control condition is not met), platform 102 can notify a user (not shown) on a display or user interface that indicates a status of the query (also not shown). For example, a query written in SQL may be received by platform 102, which may be a standalone (e.g., hosted, remote, or local) or distributed (e.g., server, network, or cloud-based) software platform composed of multiple programs or scripts (e.g., Java®, JavaScript®, and/or other programming or formatting languages, structured or unstructured, or the like) that is configured to parse and analyze the query to determine through inference (as described in greater detail below) attributes, one of which may include an access control condition that permits the query to be run (i.e., executed) against an access-controlled (e.g., password, encryption, authentication, token-based, or any other form of electronic or digital security measure intended to limit or prevent access to a given dataset) database, datastore, dataset, network, or the like. Once authenticated (i.e., an access control condition matches or is approved by access control module 120), a query (not shown) from platform 102 may be permitted access in order to retrieve a dataset from database 122 or datastore 123 (and, subsequently, databases 124-128). Due to conventional solutions being problematic in handling and executing queries in one format against databases that may be in another format, platform 102 is configured to receive, parse, and run inference operations (as described in greater detail below) in order to determine and identify any attributes that may be related to the query, the dataset(s), or the database or datastore in which the dataset(s) are stored. More specifically, platform 102 includes, among other modules and functionality, an inference engine (not shown) that is configured to infer one or more attributes of a query, the target dataset (i.e., the dataset requested once the query has been executed), and the source database or datastore on which the dataset(s) are stored. Further, platform 102 may also be configured to convert a query from one format (e.g., SQL or another structured or unstructured query language) into a different “atomic” format (e.g., RDF™ (as developed by W3C®, or another triple-oriented language (i.e., languages and protocols such as SPARQL (as also developed by W3C®) that may be used to convert data associated with queries into subject-predicate-object-oriented data structures otherwise known as “triples”) that can be used to generate, by platform 102, rewritten queries that incorporate other triple data directed to attributes such as type, format, access control conditions, or in an integrated manner against various types and formats of databases, datastores, data repositories, data warehouses, and the like.
As an example, platform 102 may be configured to rewrite a query (e.g., programmed or formatted in SQL, Python, R, or other statistical or data analytical software) from one format, structure, or schema to another in order to execute a query against multiple disparate types of data storage facilities (e.g., databases, datastores, data repositories, data warehouses, and the like), which may each be of a different schema, structure, and/or type, without restriction. Further, in some examples, platform 102 may be configured to rewrite a query from one format, structure, or schema into another, but also “optimize” a rewritten query (as described in further detail below), by converting data associated with one or more inferred attributes that were determined during the parsing of the query upon its receipt by platform 102. “Optimizing” a query before, during, or after it has been rewritten by platform 102, may, in some examples, refer to optimizing a copy of a query or a master of a query. Optimizing a query may occur during or after a rewriting operation has been performed by platform 102, which could include, but is not limited to, rewriting a query (i.e., master or a copy) from one query language to another format that can then be used to generate further downstream queries for different target or disparate databases that may include datasets that are either sought, in accordance with the original query, or logic incorporated into platform 102 may execute to infer there may be other datasets that are indexed or linked (i.e., as linked data) by platform 102 that, although not known or targeted by the original query, could be returned with the intended target dataset. In some examples, queries may be optimized after being written from SQL to triples using RDF™, SPARQL™, or the like because the rewritten triple data, which may be stored in a datastore accessed by platform 102, but intended to store converted triple data from incoming queries (i.e., a “triple store”) may be retrieved with other triple data that has been generated resultantly from inferred attributes. In other words, inferred attributes such as type, data types (i.e., specific types of data that are typically identified by columnar or row headings in a tabular format, but could also be found in a multi-dimensional grid storage structure such as name, date, value, postal code, country, state, or any other type that can be used to identify a logical grouping of data, without limitation or restriction), data structure, data schema, object schema, addresses (e.g., Uniform Resource Locator (URL), Uniform Resource Identifier (URI), web address, and the like), layout, design, style, format, language, structure, and others without limitation to any particular attribute or type or category thereof. The triple data rewritten from the query and the triple data associated with attributes related to the query (hereafter, “query” may refer to a copy of a query or a master (i.e., original or originally received by platform 102) query, without limitation or restriction) may be specifically rewritten for a database housing or storing the intended target dataset database. In some examples, an original query or a copy of an original query may be subject to various data operations by platform 102, without restriction or limitation. If a copy of an original query is used by platform 102, the original query may itself be identified as a “master” and saved to one or more of databases 104-106 or another database, datastore, data warehouse, data repository, or other data facility or structure used by platform 102 to store internal data. Thus, a master query or master (hereafter “master”) may be preserved in the event query data used by platform 102 becomes corrupted or unusable.
In some examples, other databases that are “known” through previous queries or discovery by platform 102 that may store or house datasets similar, related, or associated with the intended dataset may be identified as a linked dataset or linked data and included in part of a data model or graph that can be used to retrieve data or datasets in response to various queries. In other words, platform 102 may use a graph (i.e., data model) that, once a query is received, logic (e.g., a logic module that may employ rules, machine learning, artificial intelligence, deep learning, natural language processing, or other algorithms, software, computer programs, applications, or the like to implement decision-based processing of data) then determines other linked data may be related to the dataset sought by the query and delivered to the user in response. Further, the linked datasets may also be included in a modified or new graph that may be created to include the intended target dataset as a new node within the graph. Various types of graph generation techniques may be used, without limitation or restrictions, such as mapping different data types (e.g., using specification such as comma separated values (“csv”) to RDF, CSVW, among others) and storing these maps as graphs within a database or datastore (e.g., databases 104-106 and 114-118). Other graph generation techniques may be used and are not limited to any particular algorithm, process, or methodology.
In some examples, although a SQL-based query may have a SELECT statement (i.e., a programmatic query command or query statement intended to fetch an intended dataset or data stored within a given database), platform 102 may be configured to convert a statement (e.g., a query statement such as SELECT in SQL, and other comparable commands in any other type of query language, structured or unstructured) into SPARQL, for example, by parsing the query statement into a data structure such as an abstract syntax tree in an intended (i.e., target) language such as SPARQL. Once generated, an abstract syntax tree mapping a received query statement may be used to determine how to map the statement from its native language into a comparable statement in, for example, SPARQL (or another language that may be configured to perform the processes described herein). Using an abstract syntax tree (not shown) may be used to further generate a resultant SPARQL query statement, command, data structure, or object that may be configured to execute over (e.g., using) a triple store or triple data within a datastore, such as those described herein. Using attributes inferred from or stated in a originally-received (i.e., native) statement (e.g., SQL query statement, as described above as an example), triple data can be amassed in a triple store (i.e., a datastore, database, repository, or other type of data structure configured to store triple data reduced, atomically, as described herein) and used during the generation of a substantially equivalent statement (e.g., a query) into SPARQL. As an example, attributes may identify an access control condition (e.g., password, token, or other security feature that must be navigated successfully before access to a dataset or a database, data repository, datastore, or other type of data structure is permitted) that manages (e.g., controls) access to a target or intended dataset. For example, a password, token, hash value, or any other type of security-oriented attribute may be converted into one or more triples and, in some examples, an endpoint server (not shown) associated, in data communication, or configured to perform data operations with platform 102 may be used to rewrite the triple data of the query and the attribute into another form, format, language, structure, or schema for a target database that the endpoint server is configured to communicate with over one or more data networks. In some examples, platform 102 may be configured to receive a query, rewrite the data associated with the query and any attributes (e.g., attributes of the query, the target dataset(s), the target database(s), paths, linked data, or any other attribute including, but not limited to those examples provided above) into a language, structure, schema, or format associated with another database by converting query data (i.e., data associated with a query) and data associated with attributes of the queries into triples, execute the rewritten queries, and, in some examples, return not only the requested dataset(s), but also dataset(s) that may be related to the dataset(s). In other examples, platform 102 may be configured to return only the target dataset(s) requested by the query and no others. In still other examples, platform 102 may be configured to return some dataset(s) that may be associated with or related to the target dataset(s) requested by the query, which may be determined based on rules or logic of platform 102. Further, platform 102 may also be configured to create or modify a graph (e.g., data model) that is used when a query for a given dataset is received, which may be further used to return additional data that could be valuable due to an attribute-determined relationship or association between the target dataset, the query, and other dataset(s) known or graphed or identified as linked data by platform 102. The above-described topology, elements, and processes may be varied in size, shape, configuration, function, and implementation and are not limited to the examples shown and described.
As shown, application 201 may be a implemented as a process, computer program, software, firmware, hardware, circuitry, logic, or a combination thereof (hereafter “application”) and, in some examples, may be written in Java® and/or JavaScript®, among others. Each of elements 201-228 may be programmed, developed, or encoded using software programming techniques familiar to these programming and formatting languages or others, without restriction, regardless of whether object-oriented, structured, or unstructured. In some examples, application 201 is configured with elements 202-228 in order to receive query 203 that is directed to retrieve (e.g., fetch, download, access and copy, or otherwise obtain using one or more data operations) a target dataset (e.g., dataset 242) in response to rewritten query 244. As described herein, application 201 may be written in any programming or formatting language (e.g., SQL, Python, R, or others) used to query a database. Application 201 may be configured to receive query 203 using API 204 and analyzing, using logic module 210, query 203 to determine one or more attributes associated with query 203, dataset 242, or a database (e.g., databases 104-106, databases 114-118, database 122, and datastore 123 (including databases 124-128) as shown and described above in connection with
Here, in some examples, a replica of query 203 (not shown) or query 203 is parsed by logic module 210, which is configured to analyze data received by application 201 (e.g., query 203) or dataset 242 and to generate instructions to other elements within application 201 to perform various data operations such as those described herein. Structurally, logic module 210 may be a set of logical rules or algorithms for machine learning, deep learning, artificial intelligence, or the like. Logic module 210 may be programmatically coded in one or more languages such as Java®, JavaScript®, R, or others, without limitation or restriction. Functionally, logic module 210 may be configured to perform various data operations such as generating data or signals to provide instructions to inference engine 214, query engine 216, or any other element of application 201. Logic module 210 may also be configured to generate and send instructions (i.e., as data or signals) to graph database engine 228 in order to generate one or more data models associated with query 203. Further, during parsing, inference engine 214 may be configured to determine attributes associated with query 203 through inference (e.g., Bayesian, statistical, probabilistic, predictive, or other techniques may be employed for inference and are not limited to any specific types of techniques for inferring attribute data associated with query 203). In some examples, attributes may include, but are not limited to, any type of information or characteristic associated with or about a query, dataset 242, which is intended to be fetched by query 203 (i.e., using, for example, a SQL SELECT command to retrieve dataset 242 for a given database (not shown)), and the destination or target database from which dataset 242 is to be retrieved. While examples are provided for the disclosed techniques to operate on a singular dataset, these may also be extended to operate on multiple datasets and databases, without limitation or restriction. Attributes may include, but are not limited to, property attributes (e.g., string literal, numerical, or the like), values, qualities, characteristics, or any other data, metadata, and information about or related to an item contained within a dataset or a database and which can be inferred by inference engine 214. Attributes, once inferred by inference engine 214 as a result of parsing being directed by logic module 210, along with query 203 can be converted into “atomic” data or triples in accordance with languages, protocols, and formats such as the Resource Description Framework (hereafter “RDF”) as promulgated by the World Wide Web Consortium (hereafter “W3C”), SPARQL, and others used for organizing, formatting, programming, converting, structuring, or otherwise manipulating data for use on “semantic web” applications and the like, including semantic uses for retrieving dataset 242 from databases or the like or from other data networks that do not employ common data languages, formats, and protocols. By converting, for example, SQL-based data (or data for query 203 formatted using a structured or unstructured language) can be converted into RDF triple data that can be used as a common base language, format, or protocol that can later be used by query engine 216 and proxy/endpoint server 206 to “rewrite” or construct rewritten query 244, which is ultimately transmitted from application 201 to a database for retrieving dataset 242. In some examples, dataset 242 may be retrieved or fetched from a database using rewritten query 244 and may include not only dataset 242, but also other datasets that might be related to or are similar to the dataset sought.
In some examples, the determination of whether dataset 242 may be related to other dataset(s) that were previously retrieved or otherwise indexed by application 201 and its elements (namely, graph database engine 228, which may be configured to create a graph or data model representative of dataset 242 that were previously fetched (i.e., retrieved) and/or stored in one or more of databases 220-224) may be made by logic module 210, query engine 216, and graph database engine 228. When query 203 is received, for example, logic module 210 analyzes inferred attribute data from inference engine 214 and can generate/send instructions to query engine 216 to reference graph database engine 228 in order to determine whether any of the triple data converted from query 203 and stored in one or more of databases 220-224 matches previously converted triple data stored similarly. Alternatively, a graph created of query 203 (or a copy thereof) or dataset 242 may also be stored in one or more of databases 220-224 and used as a reference for a comparison to another graph previously stored in databases 220-224 to determine if there is a match (i.e., where there are other datasets that may be related (and presumably of interest to a data scientist (i.e., user)) or similarity with dataset 242. In other examples, a rule or set of rules that establish a percentage or numerical threshold may be input using logic module 210 (e.g., display module 218 may be configured to generate, by executing one or more scripts, forms, or formats such as HTML, XML, PHP, or the like) to provide a user interface that a data scientist or researcher (i.e., a user of platform 200) may use to input a rule, criteria, or restriction for use in determining whether there are any dataset(s) that may be similar to dataset 242. In still other examples, users may enter other rules, criteria, or restrictions that permit or do not permit application 201 to return similar or matching datasets for presentation on a user interface (not shown) provided by display module 218, which, working in concert with API, may receive and send (for display or visual rendering) data in various types of formats including, but not limited to HTML, XML, XHTML, or any other type of programming or formatting language that may be used to generate the user interface.
Referring back to inference engine 214, any attributes inferred may be analyzed by logic module 210 and then converted into, for example, triple data (e.g., triple formats such as those described herein and in accordance with protocols such as SPARQL, RDF, among others, without limitation and/or restriction) that can be stored along with the triple data associated with query 203 itself; stored, that is, in one or more of databases 220-224. Inference engine 214 may also be configured to infer attributes about a given dataset(s) such as layout (e.g., columns, rows, axes, matrices, cells, text, among others), data type (e.g., string literals, numbers, integers, fractions, decimals, whole numbers, and the like), but also exceptions (i.e., data that is inconsistent with inferred attributes or other data within a given dataset(s)). In some examples, when exceptions are found, display module 218 may be configured to visually present, render, or otherwise display, in various types of graphical user interface layouts (not shown), without limitation or restriction. In some examples, user interfaces may be presented that provide, in addition to data from a retrieved dataset(s), but also exceptions, annotations, outlier data, inferred attributes, attribute data, or others, using techniques that data scientists and researchers would be familiar with using (e.g., Python, R, and the like) without requiring in-depth or expert knowledge of programming languages underlying platform 102 (e.g., SPARQL, RDF, Java®, JavaScript®, among others). In some examples, one or more of databases 220-224 may be configured to store only triple data, while another database may be configured to store query 203 as a master (as previously described) or copies thereof in order to restore from a catastrophic loss or data corruption event. As an example, query 203 may be rejected by a target database (e.g., databases 104-106, databases 114-118, database 122, and datastore 123 (including databases 124-128) as shown and described above in connection with
In some examples, an access control condition, in some examples, as a type of attribute can also be converted by conversion module 212 into triple data that may be stored in one or more of databases 220-224, one or all of which may be either local, remote (not shown), or distributed (local or remote) data storage facilities. In some examples, databases 220-224 may be standalone, server, network, or cloud-based data storage facilities and are not limited to the examples or configurations shown and described in connection with
Referring back to conversion module 212, data associated with query 203 (or a copy thereof) may be converted into triple data and stored in one or more of databases 220-224, which may be later used to generate rewritten query 244 by, in some examples, proxy/endpoint server 206. In some examples, proxy/endpoint server 206 may be implemented using multiple instantiations for different types, structures, formats, and data schema of databases, datastores, data warehouses, data repositories, or any other types of data storage facility(s). As shown, after query 203 has been converted into triple data that may be stored in one or more of databases 220-224 (and as further described above) and any inferred attributes determined by inference engine 214 have also been converted into triple data (which may likewise be stored in one or more of databases 220-224), proxy/endpoint server 206 and query engine 216 are configured to generate rewritten query 244 for each target database (not shown) on which dataset 242 is stored (e.g., as originally programmed using, for example, a SELECT statement in SQL) as well as any other dataset(s) that have been identified by logic module 210 as a result of analyzing graphs and/or data models generated by graph database engine 228 and/or those previously generated by graph database engine 228 and stored on one or more of databases 220-224 (i.e., identifying other datasets that may be similar to or match dataset 242, or identifying isomorphic (i.e., data that is related to other data) amongst queried, retrieved, or linked dataset(s)). Further, logic module 210 may also limit, expand, or otherwise modify the number and type of dataset(s) retrieved in response to a fetch command or statement, depending upon rules or instructions provided by a user as received by API 204 and display module 218. In still further examples, proxy/endpoint server 206 may include multiple instantiations, each of which is configured to generate multiple rewritten queries for different types, formats, structures, and/or data schemas for various databases (i.e., multiple versions of rewritten query 244, where each version may be generated for different types of databases (e.g., Relational, Document-oriented, Key-value, Graph, or others), without limitation or restriction to any particular type, format, or data schema of database. The described techniques enable data scientists (e.g., users) to generate a request using a query language that can be parsed, analyzed, converted, and rewritten in order to support different types, formats, structures, and data schemas without having to manually rewrite each query for a specific type of database. Further, rewritten query 244 may be “optimized” such that data or metadata representing attributes inferred by inference engine 214 can also be included as triple data during the rewriting process (as described in further detail below) in order to include data or information that can not only fetch or retrieve dataset 242, but also dataset(s) that may be useful, valuable, or otherwise related to the one sought by query 203. Optimization may also include rewriting query 203 from one query language into triples, as discussed herein, and from the triples data into rewritten query 244 by proxy/endpoint server 206, which may also include, during the rewriting process (as described in greater detail below) an access control condition (e.g., password, token, authentication data, encryption data, hash value, or other security data or information) from the converted triple data stored in databases 220-224 in order for rewritten query 24 to gain access to and retrieve from, for example, dataset 242 from a private (i.e., secure) network (e.g., network 112, which may include access control module 120, datastore 123, and databases 122-128). In other examples, the above-described elements may be varied in size, shape, configuration, function, and implementation and are not limited to the descriptions provided.
As shown, stack 300 includes application layer 302, which may be the architectural layer at which application 201 (
Query layer 304 is an exemplary layer of the architecture of application stack 300, which may be an architectural layer at which query data is retrieved, analyzed, parsed, or otherwise used to transfer data for various computing operations associated with receiving query 203 (
Here, linked data layer 306 may be an architectural data layer at which query 203 (
Here, triple data layer 308 is illustrative of an exemplary layer in the architecture of application 201 (
In some examples, query copy/replication 510 may be a process that is implemented by application 201 (
When a replica is generated by query copy/replication 510, in some examples, storage 512 may be configured to run or execute as a process to store a generated copy of a query and the original query (i.e., master) in one or more databases associated with application 201 (
Here, triple conversion 514 may be implemented as, for example, a process configured to convert query data into triples (e.g., RDF triples, items that are subject-predicate-object oriented, or another atomic format apart from those described herein). Data associated with a query may include query data received and parsed directly from, for example, query 203 (
Here, some data networks may utilize SQL as a primary data storage and query language while others may use DMX for data mining purposes, and still others may use LDAP for querying services run over Transport Control Protocol/Internet Protocol (i.e., “TCP/IP”). In still other examples, proxy/endpoint server 206 may use different query languages and the processes described herein such as triple conversion 514, endpoint query generation 516, and endpoint query execution 518 are not limited to any particular language or version thereof. In other examples, the above-described processes may be designed, implemented, configured, or otherwise executed differently and are not limited to the examples shown and described.
Alternatively, in some examples, if an access control condition (e.g., such as those described above) is determined by inference engine 214 (
Alternative processes may be implemented other than the examples shown and/or described. For example, an alternative process may be included to parse a query to identify its various components and then determine what datasets are desired (i.e., targeted) for access. Once determined, the targeted dataset(s) can be evaluated further by inferring any attributes such as access control conditions. Access control conditions inferred may include, but are not limited to, checking token-based access controls for each targeted dataset and, if an access control condition or attribute indicates access is not authorized by data within the query, it is rejected and data is transmitted back to the user for display via, for example, display module 218 (
In other examples, the above-described process may be varied in function, order, procedure, and process, without limitation to any of the examples or accompanying descriptions.
Running as parallel processes to those used for handling query copies as described above, in some examples, a query may be identified as a master (630). Once identified, a database or datastore in data communication with application 201 (
Referring back to
Referring back to
In other examples, a public dataset may be stored on a public network and, if no access control condition is required, then platform 102 (
Referring back to
Referring back to
According to some examples, computer system 800 performs specific operations by processor 804 executing one or more sequences of one or more instructions stored in system memory 806. Such instructions may be read into system memory 806 from another computer readable medium, such as static storage device 808 or disk drive 810. In some examples, hard-wired circuitry may be used in place of or in combination with software instructions for implementation.
The term “computer readable medium” refers to any tangible medium that participates in providing instructions to processor 804 for execution. Such a medium may take many forms, including but not limited to, non-volatile media and volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as disk drive 810. Volatile media includes dynamic memory, such as system memory 806.
Common forms of computer readable media includes, for example, floppy disk, flexible disk, hard disk, magnetic tape, any other magnetic medium, CD-ROM, any other optical medium, punch cards, paper tape, any other physical medium with patterns of holes, RAM, PROM, EPROM, FLASH-EPROM, any other memory chip or cartridge, or any other medium from which a computer can read.
Instructions may further be transmitted or received using a transmission medium. The term “transmission medium” may include any tangible or intangible medium that is capable of storing, encoding or carrying instructions for execution by the machine, and includes digital or analog communications signals or other intangible medium to facilitate communication of such instructions. Transmission media includes coaxial cables, copper wire, and fiber optics, including wires that comprise bus 802 for transmitting a computer data signal.
In some examples, execution of the sequences of instructions may be performed by a single computer system 800. According to some examples, two or more computer systems 800 coupled by communication link 820 (e.g., LAN, PSTN, or wireless network) may perform the sequence of instructions in coordination with one another. Computer system 800 may transmit and receive messages, data, and instructions, including program, i.e., application code, through communication link 820 and communication interface 812. Received program code may be executed by processor 804 as it is received, and/or stored in disk drive 810, or other non-volatile storage for later execution. In other examples, the above-described techniques may be implemented differently in design, function, and/or structure and are not intended to be limited to the examples described and/or shown in the drawings.
Although the foregoing examples have been described in some detail for purposes of clarity of understanding, the above-described inventive techniques are not limited to the details provided. There are many alternative ways of implementing the above-described invention techniques. The disclosed examples are illustrative and not restrictive.
This application is a continuation application of copending U.S. patent application Ser. No. 16/457,759, filed Jun. 28, 2019; U.S. patent application Ser. No. 16/457,759 is a continuation application of U.S. patent application Ser. No. 15/439,911, filed Feb. 22, 2017, now U.S. Pat. No. 10,439,013; U.S. patent application Ser. No. 15/439,911 is a continuation-in-part application of U.S. patent application Ser. No. 15/186,514, filed Jun. 19, 2016, now U.S. Pat. No. 10,102,258; U.S. patent application Ser. No. 15/439,911 is also a continuation-in-part application of U.S. patent application Ser. No. 15/186,515, filed Jun. 19, 2016, now U.S. Pat. No. 10,515,085; U.S. patent application Ser. No. 15/439,911 is also a continuation-in-part application of U.S. patent application Ser. No. 15/186,516, filed Jun. 19, 2016, now U.S. Pat. No. 10,452,677; U.S. patent application Ser. No. 15/439,911 is also a continuation-in-part application of U.S. patent application Ser. No. 15/186,517, filed Jun. 19, 2016, now U.S. Pat. No. 10,324,925; U.S. patent application Ser. No. 15/439,911 is also a continuation-in-part application of U.S. patent application Ser. No. 15/186,519, filed Jun. 19, 2016, now U.S. Pat. No. 10,699,027; U.S. patent application Ser. No. 15/439,911 is also a continuation-in-part application of U.S. patent application Ser. No. 15/186,520, filed Jun. 19, 2016, now U.S. Pat. No. 10,346,429; U.S. patent application Ser. No. 16/457,759 is a continuation application of U.S. patent application Ser. No. 16/428,456, filed May 31, 2019, now U.S. Pat. No. 11,093,633; U.S. patent application Ser. No. 16/428,456 is a continuation application of U.S. patent application Ser. No. 15/439,911, filed Feb. 22, 2017, now U.S. Pat. No. 10,439,013; U.S. patent application Ser. No. 16/457,759 is also a continuation-in-part application of U.S. patent application Ser. No. 15/186,514, filed Jun. 19, 2016, now U.S. Pat. No. 10,102,258; U.S. patent application Ser. No. 16/457,759 a continuation-in-part application of U.S. patent application Ser. No. 15/186,515, filed Jun. 19, 2016, now U.S. Pat. No. 10,515,085; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/186,516, filed Jun. 19, 2016, now U.S. Pat. No. 10,452,677; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/186,517, filed Jun. 19, 2016, now U.S. Pat. No. 10,324,925; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/186,519, filed Jun. 19, 2016, now U.S. Pat. No. 10,699,027; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/186,520, filed Jun. 19, 2016, now U.S. Pat. No. 10,346,429; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/454,923, filed Mar. 9, 2017, now U.S. Pat. No. 10,353,911; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. Nonprovisional patent application Ser. No. 15/454,955, filed Mar. 9, 2017, now U.S. Pat. No. 10,691,710; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/454,969, filed Mar. 9, 2017, now U.S. Pat. No. 10,747,774; U.S. patent application Ser. No. 16/457,759 is a continuation-in-part application of U.S. patent application Ser. No. 15/454,981, filed Mar. 9, 2017, now U.S. Pat. No. 10,645,548; all of which are hereby incorporated by reference in their entirety for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5845285 | Klein | Dec 1998 | A |
6144962 | Weinberg et al. | Nov 2000 | A |
6317752 | Lee et al. | Nov 2001 | B1 |
6529909 | Bowman-Amuah | Mar 2003 | B1 |
6768986 | Cras et al. | Jul 2004 | B2 |
6961728 | Wynblatt et al. | Nov 2005 | B2 |
7080090 | Shah et al. | Jul 2006 | B2 |
7143046 | Babu et al. | Nov 2006 | B2 |
7146375 | Egilsson et al. | Dec 2006 | B2 |
7680862 | Chong et al. | Mar 2010 | B2 |
7702639 | Stanley et al. | Apr 2010 | B2 |
7761407 | Stern | Jul 2010 | B1 |
7818352 | Krishnamoorthy et al. | Oct 2010 | B2 |
7836063 | Salazar et al. | Nov 2010 | B2 |
7853081 | Thint | Dec 2010 | B2 |
7856416 | Hoffman et al. | Dec 2010 | B2 |
7877350 | Stanfill et al. | Jan 2011 | B2 |
7953695 | Roller et al. | May 2011 | B2 |
7987179 | Ma et al. | Jul 2011 | B2 |
8037108 | Chang | Oct 2011 | B1 |
8060472 | Itai et al. | Nov 2011 | B2 |
8099382 | Liu et al. | Jan 2012 | B2 |
8170981 | Tewksbary | May 2012 | B1 |
8275784 | Cao et al. | Sep 2012 | B2 |
8296200 | Mangipudi et al. | Oct 2012 | B2 |
8312389 | Crawford et al. | Nov 2012 | B2 |
8429179 | Mirhaji | Apr 2013 | B1 |
8521565 | Faulkner et al. | Aug 2013 | B2 |
8538985 | Betawadkar-Norwood et al. | Sep 2013 | B2 |
8583631 | Ganapathi et al. | Nov 2013 | B1 |
8616443 | Butt et al. | Dec 2013 | B2 |
8640056 | Helfman et al. | Jan 2014 | B2 |
8719252 | Miranker et al. | May 2014 | B2 |
8762160 | Lulla | Jun 2014 | B2 |
8799240 | Stowe et al. | Aug 2014 | B2 |
8831070 | Huang et al. | Sep 2014 | B2 |
8843502 | Elson et al. | Sep 2014 | B2 |
8856643 | Drieschner | Oct 2014 | B2 |
8892513 | Forsythe | Nov 2014 | B2 |
8935272 | Ganti et al. | Jan 2015 | B2 |
8943313 | Glew et al. | Jan 2015 | B2 |
8965915 | Ganti et al. | Feb 2015 | B2 |
8990236 | Mizrahy et al. | Mar 2015 | B2 |
8996559 | Ganti et al. | Mar 2015 | B2 |
8996978 | Richstein et al. | Mar 2015 | B2 |
9002860 | Ghemawat | Apr 2015 | B1 |
9171077 | Balmin et al. | Oct 2015 | B2 |
9218365 | Irani et al. | Dec 2015 | B2 |
9244952 | Ganti et al. | Jan 2016 | B2 |
9268820 | Henry | Feb 2016 | B2 |
9268950 | Gkoulalas-Divanis et al. | Feb 2016 | B2 |
9396283 | Miranker et al. | Jul 2016 | B2 |
9454611 | Henry | Sep 2016 | B2 |
9495429 | Miranker | Nov 2016 | B2 |
9560026 | Worsley | Jan 2017 | B1 |
9607042 | Long | Mar 2017 | B2 |
9613152 | Kucera | Apr 2017 | B2 |
9659081 | Ghodsi et al. | May 2017 | B1 |
9690792 | Bartlett et al. | Jun 2017 | B2 |
9696981 | Martin et al. | Jul 2017 | B2 |
9710526 | Couris et al. | Jul 2017 | B2 |
9710568 | Srinivasan et al. | Jul 2017 | B2 |
9720958 | Bagehorn et al. | Aug 2017 | B2 |
9760602 | Ghodsi et al. | Sep 2017 | B1 |
9769032 | Ghodsi et al. | Sep 2017 | B1 |
9798737 | Palmer | Oct 2017 | B2 |
9836302 | Hunter et al. | Dec 2017 | B1 |
9959337 | Ghodsi et al. | May 2018 | B2 |
9990230 | Stoica et al. | Jun 2018 | B1 |
10095735 | Ghodsi et al. | Oct 2018 | B2 |
10102258 | Jacob et al. | Oct 2018 | B2 |
10176234 | Gould et al. | Jan 2019 | B2 |
10216860 | Miranker et al. | Feb 2019 | B2 |
10248297 | Beechuk et al. | Apr 2019 | B2 |
10296329 | Hunter et al. | May 2019 | B2 |
10318567 | Henry | Jun 2019 | B2 |
10324925 | Jacob et al. | Jun 2019 | B2 |
10346429 | Jacob et al. | Jul 2019 | B2 |
10353911 | Reynolds et al. | Jul 2019 | B2 |
10361928 | Ghodsi et al. | Jul 2019 | B2 |
10438013 | Jacob et al. | Oct 2019 | B2 |
10452677 | Jacob et al. | Oct 2019 | B2 |
10452975 | Jacob et al. | Oct 2019 | B2 |
10474501 | Ghodsi et al. | Nov 2019 | B2 |
10474736 | Stoica et al. | Nov 2019 | B1 |
10545986 | Tappan et al. | Jan 2020 | B2 |
10546001 | Nguyen et al. | Jan 2020 | B1 |
D876454 | Knowles et al. | Feb 2020 | S |
10558664 | Armbrust et al. | Feb 2020 | B2 |
D877167 | Knowles et al. | Mar 2020 | S |
D879112 | Hejazi et al. | Mar 2020 | S |
10606675 | Luszczak et al. | Mar 2020 | B1 |
10645548 | Reynolds et al. | May 2020 | B2 |
10664509 | Reeves et al. | May 2020 | B1 |
10673887 | Crabtree et al. | Jun 2020 | B2 |
10678536 | Hunter et al. | Jun 2020 | B2 |
10691299 | Broek et al. | Jun 2020 | B2 |
10691433 | Shankar et al. | Jun 2020 | B2 |
10713314 | Yan et al. | Jul 2020 | B2 |
10769130 | Armbrust et al. | Sep 2020 | B1 |
10769535 | Lindsley | Sep 2020 | B2 |
10810051 | Shankar et al. | Oct 2020 | B1 |
10922308 | Griffith | Feb 2021 | B2 |
10984008 | Jacob et al. | Apr 2021 | B2 |
11042556 | Griffith et al. | Jun 2021 | B2 |
11042560 | Griffith et al. | Jun 2021 | B2 |
11068453 | Griffith | Jul 2021 | B2 |
11068475 | Boutros et al. | Jul 2021 | B2 |
11068847 | Boutros et al. | Jul 2021 | B2 |
11093539 | Henry | Aug 2021 | B2 |
11294972 | George et al. | Apr 2022 | B2 |
11327991 | Reynolds et al. | May 2022 | B2 |
11468049 | Griffith et al. | Oct 2022 | B2 |
11500831 | Griffith et al. | Nov 2022 | B2 |
20020133476 | Reinhardt | Sep 2002 | A1 |
20020143755 | Wynblatt et al. | Oct 2002 | A1 |
20030093597 | Marshak et al. | May 2003 | A1 |
20030120681 | Baclawski | Jun 2003 | A1 |
20030208506 | Greenfield et al. | Nov 2003 | A1 |
20040064456 | Fong et al. | Apr 2004 | A1 |
20050004888 | McCrady et al. | Jan 2005 | A1 |
20050010550 | Potter et al. | Jan 2005 | A1 |
20050010566 | Cushing et al. | Jan 2005 | A1 |
20050234957 | Olson et al. | Oct 2005 | A1 |
20050246357 | Geary et al. | Nov 2005 | A1 |
20050278139 | Glaenzer et al. | Dec 2005 | A1 |
20060100995 | Albornoz et al. | May 2006 | A1 |
20060117057 | Legault et al. | Jun 2006 | A1 |
20060129605 | Doshi | Jun 2006 | A1 |
20060161545 | Pura | Jul 2006 | A1 |
20060168002 | Chesley | Jul 2006 | A1 |
20060218024 | Lulla | Sep 2006 | A1 |
20060235837 | Chong et al. | Oct 2006 | A1 |
20070027904 | Chow et al. | Feb 2007 | A1 |
20070055662 | Edelman et al. | Mar 2007 | A1 |
20070139227 | Speirs et al. | Jun 2007 | A1 |
20070179760 | Smith | Aug 2007 | A1 |
20070203933 | Iversen et al. | Aug 2007 | A1 |
20070271604 | Webster et al. | Nov 2007 | A1 |
20070276875 | Brunswig et al. | Nov 2007 | A1 |
20080046427 | Lee et al. | Feb 2008 | A1 |
20080091634 | Seeman | Apr 2008 | A1 |
20080140609 | Werner et al. | Jun 2008 | A1 |
20080162550 | Fey | Jul 2008 | A1 |
20080162999 | Schlueter et al. | Jul 2008 | A1 |
20080216060 | Vargas | Sep 2008 | A1 |
20080240566 | Thint | Oct 2008 | A1 |
20080256026 | Hays | Oct 2008 | A1 |
20080294996 | Hunt et al. | Nov 2008 | A1 |
20080319829 | Hunt et al. | Dec 2008 | A1 |
20090006156 | Hunt et al. | Jan 2009 | A1 |
20090013281 | Helfman et al. | Jan 2009 | A1 |
20090018996 | Hunt et al. | Jan 2009 | A1 |
20090064053 | Crawford et al. | Mar 2009 | A1 |
20090094416 | Baeza-Yates et al. | Apr 2009 | A1 |
20090106734 | Riesen et al. | Apr 2009 | A1 |
20090119254 | Cross et al. | May 2009 | A1 |
20090132474 | Ma et al. | May 2009 | A1 |
20090132503 | Sun et al. | May 2009 | A1 |
20090138437 | Krishnamoorthy et al. | May 2009 | A1 |
20090150313 | Heilper et al. | Jun 2009 | A1 |
20090157630 | Yuan | Jun 2009 | A1 |
20090182710 | Short et al. | Jul 2009 | A1 |
20090198693 | Pura | Aug 2009 | A1 |
20090234799 | Betawadkar-Norwood | Sep 2009 | A1 |
20090248714 | Liu | Oct 2009 | A1 |
20090300054 | Fisher et al. | Dec 2009 | A1 |
20100114885 | Bowers et al. | May 2010 | A1 |
20100138388 | Wakeling et al. | Jun 2010 | A1 |
20100223266 | Balmin et al. | Sep 2010 | A1 |
20100235384 | Itai et al. | Sep 2010 | A1 |
20100241644 | Jackson et al. | Sep 2010 | A1 |
20100250576 | Bowers et al. | Sep 2010 | A1 |
20100250577 | Cao et al. | Sep 2010 | A1 |
20100268722 | Yalamanchi et al. | Oct 2010 | A1 |
20100332453 | Prahlad et al. | Dec 2010 | A1 |
20110153047 | Cameron et al. | Jun 2011 | A1 |
20110202560 | Bowers et al. | Aug 2011 | A1 |
20110283231 | Richstein et al. | Nov 2011 | A1 |
20110298804 | Hao et al. | Dec 2011 | A1 |
20120016895 | Butt et al. | Jan 2012 | A1 |
20120036162 | Gimbel | Feb 2012 | A1 |
20120102022 | Miranker et al. | Apr 2012 | A1 |
20120154633 | Rodriguez | Jun 2012 | A1 |
20120179644 | Miranker | Jul 2012 | A1 |
20120190386 | Anderson | Jul 2012 | A1 |
20120254192 | Gelbard | Oct 2012 | A1 |
20120278902 | Martin et al. | Nov 2012 | A1 |
20120284301 | Mizrahy et al. | Nov 2012 | A1 |
20120310674 | Faulkner et al. | Dec 2012 | A1 |
20120330908 | Stowe et al. | Dec 2012 | A1 |
20120330979 | Elson et al. | Dec 2012 | A1 |
20130031208 | Linton et al. | Jan 2013 | A1 |
20130031364 | Glew et al. | Jan 2013 | A1 |
20130041893 | Strike | Feb 2013 | A1 |
20130054517 | Beechuk et al. | Feb 2013 | A1 |
20130110775 | Forsythe | May 2013 | A1 |
20130110825 | Henry | May 2013 | A1 |
20130114645 | Huang et al. | May 2013 | A1 |
20130138681 | Abrams et al. | May 2013 | A1 |
20130156348 | Irani et al. | Jun 2013 | A1 |
20130238667 | Carvalho et al. | Sep 2013 | A1 |
20130262443 | Leida et al. | Oct 2013 | A1 |
20130263019 | Castellanos et al. | Oct 2013 | A1 |
20130318070 | Wu et al. | Nov 2013 | A1 |
20130321458 | Miserendino et al. | Dec 2013 | A1 |
20140006448 | McCall | Jan 2014 | A1 |
20140019426 | Palmer | Jan 2014 | A1 |
20140067762 | Carvalho | Mar 2014 | A1 |
20140113638 | Zhang et al. | Apr 2014 | A1 |
20140115013 | Anderson | Apr 2014 | A1 |
20140119611 | Prevrhal et al. | May 2014 | A1 |
20140164431 | Tolbert | Jun 2014 | A1 |
20140198097 | Evans | Jul 2014 | A1 |
20140214857 | Srinivasan et al. | Jul 2014 | A1 |
20140229869 | Chiantera et al. | Aug 2014 | A1 |
20140236933 | Schoenbach et al. | Aug 2014 | A1 |
20140244623 | King | Aug 2014 | A1 |
20140279640 | Moreno et al. | Sep 2014 | A1 |
20140279845 | Ganti et al. | Sep 2014 | A1 |
20140280067 | Ganti et al. | Sep 2014 | A1 |
20140280286 | Ganti et al. | Sep 2014 | A1 |
20140280287 | Ganti et al. | Sep 2014 | A1 |
20140337331 | Hassanzadeh et al. | Nov 2014 | A1 |
20140337436 | Hoagland et al. | Nov 2014 | A1 |
20140372434 | Smith et al. | Dec 2014 | A1 |
20150046547 | Vohra et al. | Feb 2015 | A1 |
20150052125 | Ellis et al. | Feb 2015 | A1 |
20150052134 | Bornea et al. | Feb 2015 | A1 |
20150066387 | Yamada et al. | Mar 2015 | A1 |
20150081666 | Long | Mar 2015 | A1 |
20150095391 | Gajjar et al. | Apr 2015 | A1 |
20150120643 | Dantressangle et al. | Apr 2015 | A1 |
20150142829 | Lee et al. | May 2015 | A1 |
20150143248 | Beechuk et al. | May 2015 | A1 |
20150149879 | Miller et al. | May 2015 | A1 |
20150186653 | Gkoulalas-Divanis et al. | Jul 2015 | A1 |
20150213109 | Kassko et al. | Jul 2015 | A1 |
20150234884 | Henriksen | Aug 2015 | A1 |
20150242867 | Prendergast et al. | Aug 2015 | A1 |
20150269223 | Miranker et al. | Sep 2015 | A1 |
20150277725 | Masterson et al. | Oct 2015 | A1 |
20150278273 | Wigington et al. | Oct 2015 | A1 |
20150278335 | Opitz et al. | Oct 2015 | A1 |
20150339572 | Achin et al. | Nov 2015 | A1 |
20150356144 | Chawla et al. | Dec 2015 | A1 |
20150372915 | Shen et al. | Dec 2015 | A1 |
20150379079 | Kota | Dec 2015 | A1 |
20160004820 | Moore | Jan 2016 | A1 |
20160012059 | Balmin et al. | Jan 2016 | A1 |
20160019091 | Leber et al. | Jan 2016 | A1 |
20160055184 | Fokoue-Nkoutche et al. | Feb 2016 | A1 |
20160055261 | Reinhardt et al. | Feb 2016 | A1 |
20160063017 | Bartlett | Mar 2016 | A1 |
20160063271 | Bartlett et al. | Mar 2016 | A1 |
20160092090 | Stojanovic et al. | Mar 2016 | A1 |
20160092474 | Stojanovic et al. | Mar 2016 | A1 |
20160092475 | Stojanovic et al. | Mar 2016 | A1 |
20160092476 | Stojanovic et al. | Mar 2016 | A1 |
20160092527 | Kang et al. | Mar 2016 | A1 |
20160098418 | Dakshinamurthy et al. | Apr 2016 | A1 |
20160100009 | Zoldi et al. | Apr 2016 | A1 |
20160103908 | Fletcher et al. | Apr 2016 | A1 |
20160117358 | Schmid et al. | Apr 2016 | A1 |
20160117362 | Bagehorn et al. | Apr 2016 | A1 |
20160125057 | Gould et al. | May 2016 | A1 |
20160132572 | Chang et al. | May 2016 | A1 |
20160132608 | Rathod | May 2016 | A1 |
20160132787 | Drevo et al. | May 2016 | A1 |
20160147837 | Nguyen | May 2016 | A1 |
20160162785 | Grobman | Jun 2016 | A1 |
20160171380 | Kennel et al. | Jun 2016 | A1 |
20160173338 | Wolting | Jun 2016 | A1 |
20160188789 | Kisiel et al. | Jun 2016 | A1 |
20160203196 | Schnall-Levin et al. | Jul 2016 | A1 |
20160210364 | Henry | Jul 2016 | A1 |
20160225271 | Robichaud et al. | Aug 2016 | A1 |
20160232457 | Gray et al. | Aug 2016 | A1 |
20160275204 | Miranker et al. | Sep 2016 | A1 |
20160283551 | Fokoue-Nkoutche et al. | Sep 2016 | A1 |
20160292206 | Velazquez et al. | Oct 2016 | A1 |
20160314143 | Hiroshige | Oct 2016 | A1 |
20160321316 | Pennefather et al. | Nov 2016 | A1 |
20160322082 | Davis et al. | Nov 2016 | A1 |
20160350414 | Henry | Dec 2016 | A1 |
20160352592 | Sasaki et al. | Dec 2016 | A1 |
20160358102 | Bowers et al. | Dec 2016 | A1 |
20160358103 | Bowers et al. | Dec 2016 | A1 |
20160371288 | Biannic et al. | Dec 2016 | A1 |
20160371355 | Massari et al. | Dec 2016 | A1 |
20170017537 | Razin et al. | Jan 2017 | A1 |
20170032259 | Goranson et al. | Feb 2017 | A1 |
20170053130 | Hughes et al. | Feb 2017 | A1 |
20170075973 | Miranker | Mar 2017 | A1 |
20170132401 | Gopi et al. | May 2017 | A1 |
20170161323 | Simitsis | Jun 2017 | A1 |
20170161341 | Hrabovsky et al. | Jun 2017 | A1 |
20170177729 | Duke et al. | Jun 2017 | A1 |
20170213004 | Fox et al. | Jul 2017 | A1 |
20170220615 | Bendig et al. | Aug 2017 | A1 |
20170220667 | Ghodsi et al. | Aug 2017 | A1 |
20170228405 | Ward et al. | Aug 2017 | A1 |
20170236060 | Ignatyev | Aug 2017 | A1 |
20170316070 | Krishnan et al. | Nov 2017 | A1 |
20170318020 | Kamath et al. | Nov 2017 | A1 |
20170357653 | Bicer et al. | Dec 2017 | A1 |
20170364538 | Jacob et al. | Dec 2017 | A1 |
20170364539 | Jacob et al. | Dec 2017 | A1 |
20170364553 | Jacob et al. | Dec 2017 | A1 |
20170364564 | Jacob et al. | Dec 2017 | A1 |
20170364568 | Reynolds et al. | Dec 2017 | A1 |
20170364569 | Jacob et al. | Dec 2017 | A1 |
20170364570 | Jacob et al. | Dec 2017 | A1 |
20170364694 | Jacob et al. | Dec 2017 | A1 |
20170364703 | Jacob et al. | Dec 2017 | A1 |
20170371881 | Reynolds et al. | Dec 2017 | A1 |
20170371926 | Shiran et al. | Dec 2017 | A1 |
20180025027 | Palmer | Jan 2018 | A1 |
20180025307 | Hui et al. | Jan 2018 | A1 |
20180031703 | Ngai et al. | Feb 2018 | A1 |
20180032327 | Adami et al. | Feb 2018 | A1 |
20180040077 | Smith et al. | Feb 2018 | A1 |
20180046668 | Ghodsi et al. | Feb 2018 | A1 |
20180048536 | Ghodsi et al. | Feb 2018 | A1 |
20180075115 | Murray et al. | Mar 2018 | A1 |
20180121194 | Hunter et al. | May 2018 | A1 |
20180210936 | Reynolds et al. | Jul 2018 | A1 |
20180262864 | Reynolds et al. | Sep 2018 | A1 |
20180300354 | Liang et al. | Oct 2018 | A1 |
20180300494 | Avidan et al. | Oct 2018 | A1 |
20180314556 | Ghodsi et al. | Nov 2018 | A1 |
20180314705 | Griffith et al. | Nov 2018 | A1 |
20180314732 | Armbrust et al. | Nov 2018 | A1 |
20180330111 | Käbisch et al. | Nov 2018 | A1 |
20190005104 | Prabhu et al. | Jan 2019 | A1 |
20190034491 | Griffith et al. | Jan 2019 | A1 |
20190042606 | Griffith et al. | Feb 2019 | A1 |
20190050445 | Griffith et al. | Feb 2019 | A1 |
20190050459 | Griffith et al. | Feb 2019 | A1 |
20190057107 | Bartlett et al. | Feb 2019 | A1 |
20190065567 | Griffith et al. | Feb 2019 | A1 |
20190065569 | Boutros et al. | Feb 2019 | A1 |
20190066052 | Boutros et al. | Feb 2019 | A1 |
20190079968 | Griffith et al. | Mar 2019 | A1 |
20190095472 | Griffith | Mar 2019 | A1 |
20190121807 | Boutros et al. | Apr 2019 | A1 |
20190138538 | Stojanovic et al. | May 2019 | A1 |
20190155852 | Miranker et al. | May 2019 | A1 |
20190258479 | Hunter et al. | Aug 2019 | A1 |
20190266155 | Jacob et al. | Aug 2019 | A1 |
20190272279 | Jacob et al. | Sep 2019 | A1 |
20190278793 | Henry | Sep 2019 | A1 |
20190286617 | Abu-Abed et al. | Sep 2019 | A1 |
20190295296 | Gove, Jr. | Sep 2019 | A1 |
20190317961 | Brener et al. | Oct 2019 | A1 |
20190332606 | Kee et al. | Oct 2019 | A1 |
20190347244 | Jacob et al. | Nov 2019 | A1 |
20190347258 | Jacob et al. | Nov 2019 | A1 |
20190347259 | Jacob et al. | Nov 2019 | A1 |
20190347268 | Griffith | Nov 2019 | A1 |
20190347347 | Griffith | Nov 2019 | A1 |
20190370230 | Jacob et al. | Dec 2019 | A1 |
20190370262 | Reynolds et al. | Dec 2019 | A1 |
20190370266 | Jacob et al. | Dec 2019 | A1 |
20190370481 | Jacob et al. | Dec 2019 | A1 |
20190384571 | Oberbreckling et al. | Dec 2019 | A1 |
20200073644 | Shankar et al. | Mar 2020 | A1 |
20200073865 | Jacob et al. | Mar 2020 | A1 |
20200074298 | Jacob et al. | Mar 2020 | A1 |
20200097504 | Sequeda et al. | Mar 2020 | A1 |
20200117665 | Jacob et al. | Apr 2020 | A1 |
20200117688 | Sequeda et al. | Apr 2020 | A1 |
20200175012 | Jacob et al. | Jun 2020 | A1 |
20200175013 | Jacob et al. | Jun 2020 | A1 |
20200201854 | Miller | Jun 2020 | A1 |
20200218723 | Jacob et al. | Jul 2020 | A1 |
20200241950 | Luszczak et al. | Jul 2020 | A1 |
20200252766 | Reynolds et al. | Aug 2020 | A1 |
20200252767 | Reynolds et al. | Aug 2020 | A1 |
20200257689 | Armbrust et al. | Aug 2020 | A1 |
20200301684 | Shankar et al. | Sep 2020 | A1 |
20200380009 | Reynolds et al. | Dec 2020 | A1 |
20200409768 | Shankar et al. | Dec 2020 | A1 |
20210011901 | Armbrust et al. | Jan 2021 | A1 |
20210019327 | Reynolds et al. | Jan 2021 | A1 |
20210042299 | Migliori | Feb 2021 | A1 |
20210081414 | Jacob et al. | Mar 2021 | A1 |
20210109629 | Reynolds et al. | Apr 2021 | A1 |
20210173848 | Jacob et al. | Jun 2021 | A1 |
20210224250 | Griffith | Jul 2021 | A1 |
20210224330 | Miranker et al. | Jul 2021 | A1 |
20210294465 | Reynolds et al. | Sep 2021 | A1 |
20210374134 | He et al. | Dec 2021 | A1 |
20210374171 | Henry | Dec 2021 | A1 |
20210374555 | Beguerisse-Díaz et al. | Dec 2021 | A1 |
20210390098 | Reynolds et al. | Dec 2021 | A1 |
20210390141 | Jacob et al. | Dec 2021 | A1 |
20210390507 | Reynolds et al. | Dec 2021 | A1 |
20210397589 | Griffith et al. | Dec 2021 | A1 |
20210397611 | Boutres et al. | Dec 2021 | A1 |
20210397626 | Griffith et al. | Dec 2021 | A1 |
20220229838 | Jacob et al. | Jul 2022 | A1 |
20220229847 | Jacob et al. | Jul 2022 | A1 |
20220261411 | Reynolds et al. | Aug 2022 | A1 |
20220277004 | Griffith et al. | Sep 2022 | A1 |
20220327119 | Gasper et al. | Oct 2022 | A1 |
20220337978 | Reynolds et al. | Oct 2022 | A1 |
Number | Date | Country |
---|---|---|
2012289936 | Feb 2014 | AU |
2820994 | Jan 2014 | CA |
103425734 | Jun 2017 | CN |
2631817 | Aug 2013 | EP |
2631819 | Aug 2013 | EP |
2685394 | Jun 2017 | EP |
2740053 | Jun 2019 | EP |
2519779 | May 2015 | GB |
2013175181 | Sep 2013 | JP |
2013246828 | Dec 2013 | JP |
2014524124 | Sep 2014 | JP |
2012054860 | Apr 2012 | WO |
2013020084 | Feb 2013 | WO |
2017190153 | Nov 2017 | WO |
2017222927 | Dec 2017 | WO |
2018156551 | Aug 2018 | WO |
2018164971 | Sep 2018 | WO |
2021252805 | Dec 2021 | WO |
Entry |
---|
“Data.World Comes Out Of Stealth To Make Open Data Easier.” Americaninno.com, AustinInno, Jul. 11, 2016, Retrieved from the Internet; URL: www.americaninno.com/austin/open-data-tech-brett-hurts-startup-data-world-launches/ [retrieved Jan. 27, 2020]. |
Alaoui et al., “SQL to SPARQL Mapping for RDF querying based on a new Efficient Schema Conversion Technique,” International Journal of Engineering Research & Technology (IJERT); ISSN: 2278-0181; vol. 4 Issue 10, Oct. 1, 2015, Retrieved from internet: https://www.ijert.org/research/sql-to-sparql-mapping-for-rdf-querying-based-on-a-new-efficient-schema-conversion-technique-IJERTV4IS1--1-5.pdf. Retrieved on Oct. 6, 2020. |
Angles, R., Gutierrez. C., “The Expressive Power of SPARQL,” Proceedings of the 7th International Semantic Web Conference (ISWC2008). 2008. |
Arenas, M., et al., “A Direct Mapping of Relational Data to RDF,” W3C Recommendation, Sep. 27, 2012, Retrieved from the Internet; URL: https://www.w3.org/TR/rdb-direct-mapping/ [retrieved Mar. 7, 2019]. |
Beckett, D., Berners-Lee, T., “Turtle—Terse RDF Triple Language,” W3C Team Submission, Jan. 14, 2008, Retrieved from the Internet URL: https://www.w3.org/TeamSubmission/2008/SUBM-turtle-20080114/ [retrieved Mar. 7, 2019]. |
Beckett, D., Broekstra, J., “SPARQL Query Results XML Format,” W3C Recommendation, Jan. 15, 2008, Retrieved from the Internet URL: https://www.w3.org/TR/2008/REC-rdf-sparql/XMLres-20080115/ [retrieved Mar. 7, 2019]. |
Beckett, Dave, “RDF/XML Syntax Specification (Revised),” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-rdf-syntax-grammar-20040210/ [retrieved Mar. 7, 2019]. |
Berners-Lee, Tim, “Notation 3,” 2006, Retrieved from the Internet; URL: https://www.w3.org/DesignIssues/Notation3.html [retrieved on Mar. 7, 2019]. |
Berners-Lee, Tim, “Linked Data,” 2009, Retrieved from the Internet; URL: https://www.w3.org/DesignIssues/LinkedData.html [retrieved on Mar. 7, 2019]. |
Boutros et al., “Computerized Tools To Develop and Manage Data-Driven Projects Collaboratively Via a Networked Computing Platform and Collaborative Datasets,” U.S. Appl. No. 15/985,702, filed May 22, 2018. |
Boutros et al., “Computerized Tools To Facilitate Data Project Development Via Data Access Layering Logic in a Networked Computing Platform Including Collaborative Datasets,” U.S. Appl. No. 15/985,704, filed May 22, 2018. |
Boutros et al., “Dynamic Composite Data Dictionary To Facilitate Data Operations Via Computerized Tools Configured To Access Collaborative Datasets in a Networked Computing Platform,” U.S. Appl. No. 15/985,705, filed May 22, 2018. |
Boutros et al., “Graphical User Interface for a Display Screen or Portion Thereof,” U.S. Appl. No. 29/648,465, filed May 22, 2018. |
Boutros et al., “Graphical User Interface for a Display Screen or Portion Thereof,” U.S. Appl. No. 29/648,466, filed May 22, 2018. |
Boutros et al., “Graphical User Interface for a Display Screen or Portion Thereof,” U.S. Appl. No. 29/648,467, filed May 22, 2018. |
Brener et al., “Computerized Tools Configured To Determine Subsets of Graph Data Arrangements for Linking Relevant Data To Enrich Datasets Associated With a Data-Driven Collaborative Dataset Platform,” U.S. Appl. No. 16/395,036, filed Apr. 25, 2019. |
Brickley, D., Guha, R.V., “RDF Vocabulary Description Language 1.0: RDF Schema,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-rdf-schema-2004/0210/ [retrieved Mar. 7, 2019]. |
Buche et al., “Flexible SPARQL Querying of Web Data Tables Driven by an Ontology,” FQAS 2009, LNAI 5822, Springer, 2009, pp. 345-357. |
Bullock, Joshua, Final Office Action dated Jan. 22, 2019 for U.S. Appl. No. 15/439,908. |
Bullock, Joshua, Final Office Action dated Jan. 22, 2019 for U.S. Appl. No. 15/439,911. |
Bullock, Joshua, Final Office Action dated Oct. 30, 2018 for U.S. Appl. No. 15/186,517. |
Bullock, Joshua, Non-Final Office Action dated Dec. 20, 2021 for U.S. Appl. No. 16/457,759. |
Bullock, Joshua, Non-Final Office Action dated Dec. 7, 2021 for U.S. Appl. No. 16/457,750. |
Bullock, Joshua, Non-Final Office Action dated Jul. 12, 2018 for U.S. Appl. No. 15/186,517. |
Bullock, Joshua, Non-Final Office Action dated Jun. 28, 2018 for U.S. Appl. No. 15/439,908. |
Bullock, Joshua, Non-Final Office Action dated Jun. 28, 2018 for U.S. Appl. No. 15/439,911. |
Bullock, Joshua, Notice of Allowance and Fee(s) Due dated Dec. 22, 2021 for U.S. Appl. No. 16/395,049. |
Bullock, Joshua, Notice of Allowance and Fee(s) Due dated Feb. 23, 2022 for U.S. Appl. No. 16/457,750. |
Caiado, Antonio J., Non-Final Office Action dated Sep. 16, 2022 for U.S. Appl. No. 17/365,214. |
Clark, K., Feigenbaum, L., Torres, E., “SPARQL Protocol for RDF,” W3C Recommendation, Jan. 15, 2008, Retrieved from the Internet; URL: https://www.w3.org/TR/2008/REC-rdf-sparql-protocol-20080115/ [retrieved Mar. 7, 2019]. |
Copenheaver, Blaine R., Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration dated Jul. 5, 2017 for International Patent Application No. PCT/US2017/030474. |
Czajkowski, K., et al., “Grid Information Services for Distributed Resource Sharing,” 10th IEEE International Symposium on High Performance Distributed Computing, pp. 181-184. IEEE Press, New York (2001). |
Dean, M., Schreiber, G., “Owl Web Ontology Language Reference,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-owl-ref-20040210/ [retrieved Mar. 7, 2019]. |
Doung, Hien, Non-Final Office Action dated Dec. 9, 2020 for U.S. Appl. No. 16/899,544. |
Duong, Hien Luongvan, Non-Final Office Action dated May 5, 2022 for U.S. Appl. No. 17/185,917. |
Duong, Hien, Notice of Allowance and Fee(s) Due dated Oct. 27, 2022 for U.S. Appl. No. 17/185,917. |
Dwivedi, Mahesh H., Non-Final Office Action dated Jan. 30, 2020 for U.S. Appl. No. 15/454,955. |
Ellis, Matthew J., Non-Final Office Action dated Sep. 25, 2020 for U.S. Appl. No. 16/139,374. |
European Patent Office, Extended European Search Report for European Patent Application No. 18757122.9 dated Oct. 15, 2020. |
European Patent Office, Extended European Search Report for European Patent Application No. 18763855.6 dated Sep. 28, 2020. |
Feigenbaum, L., et al., “Semantic Web in Action,” Scientific American, pp. 90-97, Dec. 2007. |
Fernandez, J., et al., “Lightweighting the Web of Data through Compact RDF/HDT,” Lozano J.A., Moreno J.A. (eds) Advances in Artificial Intelligence. CAEPIA 2011. Lecture Notes in Computer Science, vol. 7023. Springer, Berlin, Hidelberg. |
Foster, I., Kesselman, C., “The Grid: Blueprint for a New Computing Infrastructure,” Morgan Kaufmann, San Francisco (1999). |
Foster, I., Kesselman, C., Nick, J., Tuecke, S., “The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration,” Technical Report, Global Grid Forum (2002). |
Ganti et al., U.S. Appl. No. 61/802,743, filed Mar. 18, 2013 and entitled, “Creating a Data Catalog By Mining Queries.” |
Ganti et al., U.S. Appl. No. 61/802,744, filed Mar. 18, 2013 and entitled, “Auto-Completion of Queries With Data Object Names and Data Profiles.” |
Garay, Peter, Examination Report No. 1 for Standard Patent Application for Australia Patent Application No. 2017282656 dated Jul. 21, 2021, Intellectual Property Office of Australia. |
Garcia-Molina, H., Ullman, J., Widom, J., Database Systems: The Complete Book. Editorial Pearson Prentice Hall. Second Edition. Published Jan. 11, 2011. (Year: 2011). |
Gawinecki, Maciej, “How schema mapping can help in data integration?—integrating the relational databases with ontologies,” ITC School, Computer Science, XXIII Cycle DII, University of Modena and Reggio Emilia, Italy, 2008. |
Gillin, Paul, “Neo4j Connector Integrates Graph Data With Business Intelligence Tools,” SiliconANGLE, Published Mar. 24, 2020, Retrieved from https://siliconangle.com/2020/03/24/neo4j-connector-integrates-graph-data-business-intelligence-tools/ on Mar. 25, 2020. |
Girma, Anteneh B., Final Office Action for U.S. Appl. No. 13/278,907, dated Apr. 18, 2013. |
Girma, Anteneh B., Non-Final Office Action for U.S. Appl. No. 13/278,907, dated Jul. 25, 2012. |
Grant, J., Beckett, D., “RDF Test Cases,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-rdf-testcases-20040210/ [retrieved Mar. 7, 2019]. |
Griffith et al., “Aggregation of Ancillary Data Associated With Source Data in a System of Networked Collaborative Datasets,” U.S. Appl. No. 15/927,006, filed Mar. 20, 2018. |
Griffith et al., “Data Ingestion To Generate Layered Dataset Interrelations To Form a System of Networked Collaborative Datasets,” U.S. Appl. No. 15/926,999, filed Mar. 20, 2018. |
Griffith et al., “Extended Computerized Query Language Syntax for Analyzing Multiple Tabular Data Arrangements in Data-Driven Collaborative Projects,” U.S. Appl. No. 16/036,834, filed Jul. 16, 2018. |
Griffith et al., “Layered Data Generation and Data Remediation To Facilitate Formation of Interrelated Data in a System of Networked Collaborative Datasets,” U.S. Appl. No. 15/927,004, filed Mar. 20, 2018. |
Griffith et al., “Link-Formative Auxiliary Queries Applied At Data Ingestion To Facilitate Data Operations in a System of Networked Collaborative Datasets,” U.S. Appl. No. 15/943,633, filed Apr. 2, 2018. |
Griffith et al., “Localized Link Formation To Perform Implicitly Federated Queries Using Extended Computerized Query Language Syntax, ” U.S. Appl. No. 16/036,836, filed Jul. 16, 2018. |
Griffith et al., “Transmuting Data Associations Among Data Arrangements To Facilitate Data Operations in a System of Networked Collaborative Datasets,” U.S. Appl. No. 15/943,629, filed Apr. 2, 2018. |
Griffith, David Lee, “Determining a Degree of Similarity of a Subset of Tabular Data Arrangements To Subsets of Graph Data Arrangements At Ingestion Into a Data-Driven Collaborative Dataset Platform,” U.S. Appl. No. 16/137,297, filed Sep. 20, 2018. |
Griffith, David Lee, “Matching Subsets of Tabular Data Arrangements To Subsets of Graphical Data Arrangements At Ingestion Into Data Driven Collaborative Datasets,” U.S. Appl. No. 16/137,292, filed Sep. 20, 2018. |
Griffith, David Lee, “Predictive Determination of Constraint Data for Application With Linked Data in Graph-Based Datasets Associated With a Data-Driven Collaborative Dataset Platform,” U.S. Appl. No. 16/139,374, filed Sep. 24, 2018. |
Haveliwala et al., “Evaluating Strategies for Similarity Search on the Web,” Proceedings of the 11th international conference on World Wide Web, May 7-11, 2002, Honolulu, Hawaii, USA (ACM), p. 432-442. |
Hayes, Patrick, “RDF Semantics,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-rdf-mt-20040210/ [retrieved Mar. 7, 2019]. |
Heflin, J., “Owl Web Ontology Language Use Cases and Requirements,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-webnot-req-20040210 [retrieved Mar. 7, 2019]. |
Henry, Jerome William, U.S. Appl. No. 61/515,305, filed Aug. 4, 2011 entitled, “Apparatus and Method for Supplying Search Results With a Knowledge Card.” |
Hoang, Hau Hai, Final Office Action dated Jul. 30, 2019 for U.S. Appl. No. 15/186,515. |
Hoang, Hau Hai, Final Office Action dated Nov. 26, 2018 for U.S. Appl. No. 15/186,515. |
Hoang, Hau Hai, Non-Final Office Action dated Apr. 16, 2019 for U.S. Appl. No. 15/186,515. |
Hoang, Hau Hai, Non-Final Office Action dated May 3, 2018 for U.S. Appl. No. 15/186,515. |
Hoang, Hau Hai, Notice of Allowance and Fee(s) Due dated Aug. 19, 2021 for U.S. Appl. No. 16/697,132. |
Htay, Lin Lin M., Non-Final Office Action dated Sep. 14, 2018 for U.S. Appl. No. 15/186,516. |
Htay, Lin Lin M., Notice of Allowance and Fee(s) Due and Notice of Allowability for U.S. Appl. No. 15/186,516, dated Jan. 25, 2019. |
Hu, Xiaoqin, Final Office Action dated Apr. 5, 2019 for U.S. Appl. No. 15/454,969. |
Hu, Xiaoqin, Final Office Action dated Apr. 5, 2019 for U.S. Appl. No. 15/454,981. |
Hu, Xiaoqin, Final Office Action dated Oct. 31, 2019 for U.S. Appl. No. 15/454,969. |
Hu, Xiaoqin, Final Office Action dated Sep. 24, 2019 for U.S. Appl. No. 15/454,981. |
Hu, Xiaoqin, Non-Final Office Action for U.S. Appl. No. 15/454,969 dated Dec. 7, 2018. |
Hu, Xiaoqin, Non-Final Office Action for U.S. Appl. No. 15/454,981 dated Dec. 12, 2018. |
Hu, Xiaoqin, Non-Final Office Action dated Aug. 1, 2019 for U.S. Appl. No. 15/454,981. |
Hu, Xiaoqin, Non-Final Office Action dated Jul. 26, 2019 for U.S. Appl. No. 15/454,969. |
Hu, Xiaoqin, Non-Final Office Action dated Jul. 30, 2021 for U.S. Appl. No. 16/732,261. |
Hu, Xiaoqin, Non-Final Office Action dated Sep. 2, 2021 for U.S. Appl. No. 16/732,263. |
J. Perez, M. Arenas, C. Gutierrez, “Semantics and Complexity of SPARQL,” ACM Transactions on Database Systems (TODS), Vo. 34, No. 3, Article 16, Publication Date: Aug. 2009. |
Jacob et al., “Collaborative Dataset Consolidation Via Distributed Computer Networks,” U.S. Appl. No. 16/120,057, filed Aug. 31, 2018. |
Jacob et al., “Collaborative Dataset Consolidation Via Distributed Computer Networks,” U.S. Appl. No. 16/287,967, filed Feb. 27, 2019. |
Jacob et al., “Dataset Analysis and Dataset Attribute Inferencing To Form Collaborative Datasets,” U.S. Appl. No. 16/271,263, filed Feb. 8, 2019. |
Joshi, Amit Krishna et al., “Alignment-based Querying of Linked Open Data,” Lecture Notes in Computer Science, 7566, 807-824, 2012. |
Kahn, Yasar et al., “SAFE: Policy Aware SPARQL Query Federation Over RDF Data Cubes,” Proceedings of the 7th International Workshop on Semantic Web Applications and Tools for Life Sciences, Berlin, Germany, Dec. 9-11, 2014. |
Khong, Alexander, Non-Final Office Action for U.S. Appl. No. 15/165,775, dated Jun. 14, 2018. |
Kim, Harry C., Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, dated Sep. 28, 2021 for International Application No. PCT/US2021/036880. |
Klyne, G., Carroll, J., “Resource Description Framework (RDF): Concepts and Abstract Syntax,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-rdf-concepts-20040210 [retrieved Mar. 7, 2019]. |
Konda et al., Magellan: Toward Building Entity Matching Management Systems over Data Science Stacks, Proceedings of the VLDB Endowment, vol. 9, No. 13, (2016), pp. 1581-1584; URL: http://cpcp.wisc.edu/images/ resources/magellan-vldb16.pdf, Date retrieved: Aug. 30, 2021. |
Konda, Pradap, Magellan: Toward Building Entity Matching Management Systems, Presentation dated Feb. 27, 2018. |
Krishnan et al., U.S. Appl. No. 15/583,966, filed May 1, 2017 and titled “Automatic Generation of Structured Data from Semi-Structured Data.” |
Langedgger, Andreas, “XL Wrap—Spreadsheet-to-RDF Wrapper,” 2009, Retrieved from the Internet URL: http://xlwrap.sourceforge.net [retrieved Mar. 7, 2019]. |
Lee, Mark B., Non-Final Office Action for U.S. Appl. No. 13/180,444 dated Jul. 2, 2012. |
Lenz, H.J., Shoshani, A., “Summarizability in OLAP and Statistical Data Bases,” Proceedings of the Ninth International Conference on Scientific and Statistical Database Management, 1997. |
Manola, F., Miller, E., “RDF Primer,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-rdf-primer-20040210/ [retrieved Mar. 7, 2019]. |
Martin et al., U.S. Appl. No. 13/457,925, filed Apr. 27, 2012 and titled “Incremental Deployment of Computer Software Program Logic.” |
Martin et al., U.S. Appl. No. 61/479,621, filed Apr. 27, 2011 and titled “Incremental Deployment of Computer Software Program Logic.” |
May, P., Ehrlich, H.C., Steinke, T., “ZIB Structure Prediction Pipeline: Composing a Complex Biological Workflow through Web Services,” In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 1148-1158. Springer, Heidelberg (2006). |
McGuiness, D., Van Harmelen, F., “Owl Web Ontology Language Overview,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-owl-features-20040210/ [retrieved Mar. 7, 2019]. |
Mian, Muhammad U., Notice of Allowance and Fee(s) Due dated Jun. 6, 2022 for U.S. Appl. No. 17/246,359. |
Mian, Umar, Non-Final Office Action dated Apr. 8, 2022 for U.S. Appl. No. 17/246,359. |
Miranker, Daniel Paul, “Accessing Relational Databases as Resource Description Framework Databases,” U.S. Appl. No. 61/406,021, filed Oct. 22, 2010. |
Miranker, Daniel Paul, “Automatic Synthesis and Presentation of OLAP Cubes from Semantically Enriched Data Sources,” U.S. Appl. No. 61/362,781, filed Jul. 9, 2010. |
National Center for Biotechnology Information, Website, Retrieved from the Internet; URL: https://www.ncbi.nlm.nih.gov/ [retrieved Mar. 7, 2019]. |
Nguyen, Bao-Yen Thi, Restriction Requirement dated Jun. 29, 2021 for Design U.S. Appl. No. 29/648,466. |
Nguyen, Kim T., Non-Final Office Action dated Apr. 25, 2022 for U.S. Appl. No. 17/163,287. |
Nguyen, Kim T., Non-Final Office Action dated Aug. 31, 2021 for U.S. Appl. No. 16/899,549. |
Nguyen, Kim T., Non-Final Office Action dated Aug. 31, 2022 for U.S. Appl. No. 17/332,354. |
Nguyen, Kim T., Non-Final Office Action dated Aug. 31, 2022 for U.S. Appl. No. 17/333,914. |
Nguyen, Kim T., Non-Final Office Action dated Dec. 10, 2020 for U.S. Appl. No. 16/137,297. |
Nguyen, Kim T., Non-Final Office Action dated Dec. 8, 2020 for U.S. Appl. No. 15/985,704. |
Nguyen, Kim T., Non-Final Office Action dated Jun. 14, 2018 for U.S. Appl. No. 15/186,514. |
Nguyen, Kim T., Non-Final Office Action dated Jun. 7, 2021 for U.S. Appl. No. 16/457,766. |
Nguyen, Kim T., Non-Final Office Action dated Mar. 20, 2019 for U.S. Appl. No. 15/454,923. |
Nguyen, Kim T., Non-Final Office Action dated May 11, 2021 for U.S. Appl. No. 16/395,036. |
Nguyen, Kim T., Non-Final Office Action dated Nov. 24, 2020 for U.S. Appl. No. 16/036,834. |
Nguyen, Kim T., Non-Final Office Action dated Nov. 24, 2020 for U.S. Appl. No. 16/036,836. |
Nguyen, Kim T., Non-Final Office Action dated Nov. 27, 2020 for U.S. Appl. No. 15/985,705. |
Nguyen, Kim T., Non-Final Office Action dated Oct. 14, 2020 for U.S. Appl. No. 15/943,629. |
Nguyen, Kim T., Non-Final Office Action dated Oct. 14, 2020 for U.S. Appl. No. 15/943,633. |
Nguyen, Kim T., Non-Final Office Action dated Oct. 27, 2020 for U.S. Appl. No. 15/985,702. |
Nguyen, Kim T., Non-Final Office Action dated Oct. 5, 2020 for U.S. Appl. No. 15/927,004. |
Nguyen, Kim T., Non-Final Office Action dated Oct. 5, 2020 for U.S. Appl. No. 15/927,006. |
Nguyen, Kim T., Non-Final Office Action dated Sep. 21, 2020 for U.S. Appl. No. 15/926,999. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Nov. 21, 2022 for U.S. Appl. No. 17/332,354. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Apr. 14, 2022 for U.S. Appl. No. 17/037,005. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Aug. 17, 2021 for U.S. Appl. No. 16/428,915. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Sep. 28, 2022 for U.S. Appl. No. 17/163,287. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due, dated May 15, 2019 for U.S. Appl. No. 15/454,923. |
Niinimaki et al., “An ETL Process for OLAP Using RDF/OWL Ontologies,” Journal on Data Semantics XIII, LNCS 5530, Springer, pp. 97-119, Aug. 12, 2009. |
Noy et al., “Tracking Changes During Ontology Evolution.” International Semantic Web Conference. Springer, Berlin, Heidelberg, 2004 (Year: 2004). |
Pandit et al., “Using Ontology Design Patterns To Define SHACL Shapes,” CEUR Workshop Proceedings, Proceedings of the 9th Workshop on Ontology Design and Patterns (WOP 2018), Monterey, USA, Oct. 9, 2018. |
Parashar et al., U.S. Appl. No. 62/329,982, filed Apr. 29, 2016 and titled “Automatic Parsing of Semi-Structured Data and Identification of Missing Delimiters.” |
Patel-Schneider, P., Hayes, P., Horrocks, I., “OWL Web Ontology Language Semantics and Abstract Syntax,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-owl-semantics-20040210 [retrieved Mar. 7, 2019]. |
Perez, J., Arenas, M., Gutierrez, C., “Semantics and Complexity of SPARQL,” In Proceedings of the International Semantic Web Conference (ISWC2006). 2006. |
Prud'hommeaux, E., Seaborne, A., “SPARQL Query Language for RDF,” W3C Recommendation, Jan. 15, 2008, Retrieved from the Internet; URL: https://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115/ [retrieved Mar. 7, 2019]. |
Raab, Christopher J., Non-Final Office Action dated Jul. 24, 2020 for U.S. Appl. No. 16/271,687. |
Raab, Christopher J., Non-Final Office Action dated Jun. 28, 2018 for U.S. Appl. No. 15/186,520. |
Raab, Christopher J., Non-Final Office Action dated Oct. 16, 2020 for U.S. Appl. No. 16/287,967. |
Raab, Christopher J., Notice of Allowance and Fee(s) Due and Notice of Allowability for U.S. Appl. No. 15/186,520, dated Jan. 2, 2019. |
Rachapalli et al., “RETRO: A Framework for Semantics Preserving SQL-to-SPARQL Translation,” The University of Texas at Dallas; Sep. 18, 2011, XP055737294, Retrieved from internet: http://iswc2011.semanticweb.org/fileadmin/iswc/Papers/Workshope/EvoDyn/evodyn_3.pdf. Retrieved on Oct. 6, 2020. |
RDB2RDF Working Group Charter, Sep. 2009, Retrieved from the Internet; URL: https://www.w3.org/2009/08/rdb2rdf-charter [retrieved Mar. 7, 2019]. |
Reynolds et al., “Computerized Tool Implementation of Layered Data Files To Discover, Form, or Analyze Dataset Interrelations of Networked Collaborative Datasets,” U.S. Appl. No. 15/454,981, filed Mar. 9, 2017. |
Reynolds et al., “Computerized Tools To Discover, Form, and Analyze Dataset Interrelations Among a System of Networked Collaborative Datasets,” International Patent Application No. PCT/US2018/020812 filed with the Receiving Office of the USPTO on Mar. 3, 2018. |
Reynolds et al., “Interactive Interfaces To Present Data Arrangement Overviews and Summarized Dataset Attributes for Collaborative Datasets,” U.S. Appl. No. 15/454,969, filed Mar. 9, 2017. |
Sahoo, S., et al., “A Survey of Current Approaches for Mapping of Relational Databases to RDF,” W3C RDB2RDF XG Report, Incubator Group, URL: http://www.w3.org/2005/Incubator/rdb2rdf/RDB2RDF_Survey_Report_01082009.pdf; Published Jan. 8, 2009. |
Sequeda, J., Depena, R., Miranker. D., “Ultrawrap: Using SQL Views for RDB2RDF,” Poster in the 8th International Semantic Web Conference (ISWC2009), Washington DC, US, 2009. |
Sequeda, J., et al., “Direct Mapping SQL Databases to the Semantic Web,” Technical Report 09-04. The University of Texas at Austin, Department of Computer Sciences. 2009. |
Sequeda, J., et al., “Ultrawrap: SPARQL Execution on Relational Data,” Technical Report. The University of Texas at Austin, Department of Computer Sciences. 2012. |
Sequeda, J., Tirmizi, S., Miranker, D., “SQL Databases are a Moving Target,” Position Paper for W3C Workshop on RDF Access to Relational Databases, Cambridge, MA, USA, 2007. |
Skevakis, Giannis et al., Metadata management, interoperability and Linked Data publishing support for Natural History Museums, Int J Digit Libr (2014), published online: Apr. 11, 2014; Springer-Verlag Berlin Heidelberg. |
Slawski, Bill, Google Knowledge Cards Improve Search Engine Experiences, SEO by the Sea, Published Mar. 18, 2015, URL: https://www.seobythesea.com/2015/03/googles-knowledge-cards/, Retrieved Sep. 15, 2021. |
Smith, M., Welty, C., McGuiness, D., “OWL Web Ontology Language Guide,” W3C Recommendation, Feb. 10, 2004, Retrieved from the Internet; URL: https://www.w3.org/TR/2004/REC-owl-guide-20040210/ [retrieved Mar. 7, 2019]. |
Smith, T.F., Waterman, M.S., “Identification of Common Molecular Subsequences,” J. Mol. Biol. 147, 195-197 (1981). |
Spieler, William, Advisory Action dated Nov. 22, 2021 for U.S. Appl. No. 16/435,196. |
Spieler, William, Final Office Action dated Mar. 15, 2021 for U.S. Appl. No. 16/435,196. |
Spieler, William, Non-Final Office Action dated Dec. 31, 2020 for U.S. Appl. No. 16/435,196. |
Spieler, William, Non-Final Office Action dated Feb. 25, 2021 for U.S. Appl. No. 16/558,076. |
Spieler, William, Non-Final Office Action dated Jul. 9, 2021 for U.S. Appl. No. 16/435,196. |
Tirmizi, S., Sequeda, J., Miranker, D., “Translating SQL Applications to the Semantic Web,” In Proceedings of the 19th International Databases and Expert Systems Application Conference (DEXA2008). Turin, Italy. 2008. |
U.S. Appl. No. 16/251,408, filed Jan. 18, 2019. |
Uddin, MD I, Non-Final Office Action dated May 13, 2021 for U.S. Appl. No. 16/404,113. |
Uddin, MD I., Final Office Action dated Jan. 1, 2021 for U.S. Appl. No. 16/404,113. |
Uddin, MD I., Non-Final Office Action dated Oct. 6, 2020 for U.S. Appl. No. 16/404,113. |
Ultrawrap Mapper, U.S. Appl. No. 62/169,268, filed Jun. 1, 2015 (Expired). |
Vu, Bai Duc, Notice of Allowance and Fee(s) Due dated Aug. 22, 2022 for U.S. Appl. No. 16/899,551. |
Vy, Hung T., Final Office Action for U.S. Appl. No. 13/180,444 dated Dec. 3, 2014. |
Vy, Hung T., Final Office Action for U.S. Appl. No. 13/180,444 dated Dec. 9, 2015. |
Vy, Hung T., Final Office Action for U.S. Appl. No. 13/180,444 dated Feb. 22, 2013. |
Vy, Hung T., Non-Final Office Action for U.S. Appl. No. 13/180,444 dated Jun. 18, 2015. |
Vy, Hung T., Non-Final Office Action for U.S. Appl. No. 13/180,444 dated Mar. 26, 2014. |
Yen, Syling, Final Office Action dated Apr. 10, 2019 for U.S. Appl. No. 15/186,519. |
Yen, Syling, Final Office Action dated Oct. 25, 2019 for U.S. Appl. No. 15/186,519. |
Yen, Syling, Non-Final Office Action dated Feb. 8, 2019 for U.S. Appl. No. 15/186,519. |
Yen, Syling, Non-Final Office Action dated Sep. 12, 2019 for U.S. Appl. No. 15/186,519. |
Yotova, Polina, European Patent Office Examination Report, Communication Pursuant to Article 94(3) EPC for European Patent Application No. 17815970.3 dated Oct. 5, 2021. |
Yotova, Polina, Supplementary European Search Report and Examiner Search Opinion for European Patent Application No. 17815970.3, dated Feb. 21, 2020. |
Young, Lee W., International Searching Authority, Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2017/037846, dated Nov. 9, 2017. |
Young, Lee W., International Searching Authority, Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2018/020812, dated Aug. 8, 2018. |
Young, Lee W., Invitation to Pay Additional Fees And, Where Applicable, Protest Fee, dated Jun. 14, 2018 for International Application No. PCT/US2018/020812. |
Young, Lee W., Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration dated May 29, 2018 for International Patent Application No. PCT/US2018/018906. |
Young, Lee W., Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2011/057334, dated Mar. 22, 2012. |
Ganti et al., U.S. Appl. No. 14/058,184, filed Oct. 18, 2013 and entitled, “Assisted Query Formation, Validation, and Result Previewing in a Database Having a Complex Schema.” |
Ganti et al., U.S. Appl. No. 14/058,189, filed Oct. 18, 2013 and entitled, “Assisted Query Formation, Validation, and Result Previewing in a Database Having a Complex Schema.” |
Ganti et al., U.S. Appl. No. 14/058,206, filed Oct. 18, 2013 and entitled, “Curated Answers Community Automatically Populated Through User Query Monitoring.” |
Ganti et al., U.S. Appl. No. 14/058,208, filed Oct. 18, 2013 and entitled, “Editable and Searchable Markup Pages Automatically Populated Through User Query Monitoring.” |
Ganti et al., U.S. Appl. No. 61/802,716, filed Mar. 17, 2013 and entitled, “Data Profile Driven Query Builder.” |
Ganti et al., U.S. Appl. No. 61/802,742, filed Mar. 18, 2013 and entitled, “Developing a Social Data Catalog By Crowd-Sourcing.” |
Jacob et al., “Dataset Analysis and Dataset Attribute Inferencing To Form Collaborative Datasets,” U.S. Appl. No. 16/292,120, filed Mar. 4, 2019. |
Jacob et al., “Management of Collaborative Datasets Via Distributed Computer Networks,” U. S. U.S. Appl. No. 16/271,687, filed Feb. 8, 2019. |
Jacob et al., “Management of Collaborative Datasets Via Distributed Computer Networks,” U.S. Appl. No. 16/292,135, filed Mar. 4, 2019. |
Jacob et al., “Query Generation for Collaborative Datasets,” U.S. Appl. No. 16/395,043, filed Apr. 25, 2019. |
Jacob et al., “Query Generation for Collaborative Datasets,” U.S. Appl. No. 16/395,049, filed Apr. 25, 2019. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Aug. 3, 2021 for U.S. Appl. No. 16/457,766. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Jul. 11, 2022 for U.S. Appl. No. 17/332,368. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Mar. 16, 2021 for U.S. Appl. No. 15/985,702. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Mar. 16, 2021 for U.S. Appl. No. 16/137,297. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Mar. 17, 2021 for U.S. Appl. No. 15/985,704. |
Nguyen, Kim T., Notice of Allowance and Fee(s) Due dated Mar. 31, 2021 for U.S. Appl. No. 15/985,705. |
Vy, Hung T., Non-Final Office Action for U.S. Appl. No. 15/273,930 dated Dec. 20, 2017. |
Willis, Amanda Lynn, Final Office Action dated Apr. 18, 2022 for U.S. Appl. No. 16/899,547. |
Willis, Amanda Lynn, Non-Final Office Action dated Feb. 8, 2022 for U.S. Appl. No. 16/899,547. |
Willis, Amanda Lynn, Non-Final Office Action dated Sep. 8, 2022 for U.S. Appl. No. 16/899,547. |
Woo, Isaac M., Non-Final Office Action dated Jul. 28, 2022 for U.S. Appl. No. 17/004,570. |
Woo, Isaac M., Non-Final Office Action dated May 5, 2020 for U.S. Appl. No. 16/137,292. |
Number | Date | Country | |
---|---|---|---|
20230127572 A1 | Apr 2023 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16457759 | Jun 2019 | US |
Child | 17854686 | US | |
Parent | 16428456 | May 2019 | US |
Child | 16457759 | US | |
Parent | 15439911 | Feb 2017 | US |
Child | 15454981 | US | |
Parent | 15439911 | Feb 2017 | US |
Child | 16428456 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15454955 | Mar 2017 | US |
Child | 16428456 | US | |
Parent | 15454969 | Mar 2017 | US |
Child | 15454955 | US | |
Parent | 15454923 | Mar 2017 | US |
Child | 15454969 | US | |
Parent | 15454981 | Mar 2017 | US |
Child | 15454923 | US | |
Parent | 15186520 | Jun 2016 | US |
Child | 16457759 | US | |
Parent | 15186516 | Jun 2016 | US |
Child | 15186520 | US | |
Parent | 15186515 | Jun 2016 | US |
Child | 15439911 | US | |
Parent | 15186520 | Jun 2016 | US |
Child | 15186515 | US | |
Parent | 15186516 | Jun 2016 | US |
Child | 15186520 | US | |
Parent | 15186517 | Jun 2016 | US |
Child | 16457759 | US | |
Parent | 15186517 | Jun 2016 | US |
Child | 15439911 | US | |
Parent | 15186515 | Jun 2016 | US |
Child | 16457759 | US | |
Parent | 15186514 | Jun 2016 | US |
Child | 15186515 | US | |
Parent | 15186514 | Jun 2016 | US |
Child | 15439911 | US | |
Parent | 15186519 | Jun 2016 | US |
Child | 15186514 | US | |
Parent | 15186519 | Jun 2016 | US |
Child | 16457759 | US |