Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for building reports. One of the methods includes creating a model based on relational structured data, the structured data including data structures, each data structure having data elements, each data element having fields, each field having a name. The method includes generating a hierarchy of objects in model, the hierarchy organizing objects the with respect to a starting object according to relationship fields on the objects. The method includes generating a user interface including elements for one or more of the objects in the hierarchy, wherein the user interface enables a user to create a report and filter the report using the new name. The method includes receiving a user selection of an element from the elements. The method also includes generating a report.

Abstract: Techniques for augmenting relational databases with graph database capabilities are described. A graph database query requesting data from a graph database is received. The graph database includes a plurality of vertices and a plurality of edges. The graph database query is translated into a relational database query using one or more computer processors. The relational database query references a vertex table and an edge table in a relational database. Result data corresponding with the graph database query is retrieved from the relational database by executing the relational database query against the relational database.

Abstract: A merge join method by a merge join system including a database is provided. The merge join system unequally divides data after a current position of a join column participating in merge join in the database into K partitions, K being greater than 2, and compares the first value of each of remaining partitions excluding the first partition from the K partitions with a value to be searched for the merge join, in order to check whether the first value and the value to be searched satisfy a specific condition. Further, the merge join system determines a partition in which the value to be searched is expected to exist based on a comparison result, and applies a k-ary search to the determined partition.

Abstract: Methods, systems, and computer program products are provided for generating and utilizing materialized graph views. A system according to one embodiment includes a graph database including a graph and schema, a workload analyzer, a view enumerator, a query rewriter and an execution engine. The workload analyzer is configured to receive and analyze queries in a query workload. The view enumerator is configured to use an inference engine to operate on facts derived from the graph and a query, and view templates comprising inference rules to enumerate candidate views. The workload analyzer is further configured to selects a candidate view to materialize, provide the selected view to the execution engine that is configured to generate the materialized view. The workload analyzer may select the at least one candidate view based on factors such as query evaluation cost estimates, candidate view performance improvement estimates, view size estimates and view creation cost estimates.

Abstract: Application behavior is analyzed to determine relationships between data. Database objects accessed by an application are identified. Then, one or more relationships between the identified database objects are determined based on one or more from a group comprising statements of the application referring to the identified database objects and sets of the identified database objects accessed by different modules of the application.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for dynamic partition selection. One of the methods includes receiving a representation of a query plan generated for a query, wherein the query plan includes a dynamic scan operator that represents a first computing node obtaining tuples of one or more partitions of a table from storage and transferring the tuples to a second computing node that executes a parent operator of the dynamic scan operator. A partition selector operator is generated corresponding to the dynamic scan operator. A location in the query plan is determined for the partition selector operator. A modified query plan is generated having the partition selector operator at the determined location.

Abstract: Algebraic operations are applied to change result sets for source tables to update a materialized view of a database incrementally. A procedure is determined for updating a materialized view that generates result sets for changes to source tables for a materialized view. The procedure performs one or more operations to update the materialized view using the result sets as operands in a relational algebra operator in the procedure to include the changes in the result sets in the materialized view.

Abstract: An index update method, including: receiving an index update request, where the index update request is used to instruct to create or delete a target index that is associated with a field in a logic table of a tenant; updating metadata information of the logic table in a database in response to the index update request; notifying a coordination service, where the coordination service is used to notify a second data access node to perform a local synchronization update; and after all second data access nodes finish local synchronization updates, performing a data asynchronization update. After the metadata information is updated in the database, an index is updated in two steps. In a first step, a local synchronization update is performed. In a second step, after all data access nodes finish local synchronization updates, a data asynchronization update is performed.

Abstract: A secure equijoin technique of generating one table from two tables while curbing the volume of communications traffic is provided. The technique includes: a first permutation generating means 110 that generates a permutation <?> from an element sequence which is generated from the first column of a table L and the first column of a table R; a first column generating means 120 that generates, for j=2, . . . , a, by using the permutation <?>, a prefix sum, and an inverse permutation <??1>, the j-th column of a table J from an element sequence which is generated from the to j-th column of the table L; a join-result element sequence generating means 130 that generates a join-result element sequence from an element sequence ([[1]], . . . , [[1]], [[0]], . . . , [[0]], [[?1]], . . . , [[?1]]) by using the permutation <?>, the prefix sum, and the inverse permutation <??1>; a second column generating means 140 that generates, for j=a+1, . . .

Abstract: An indication of an action is received through and application program interface (API) provided by one or more hardware processing devices. The action corresponds to communication with a specified party. Multiple disparate tables stored in at least one database of a of a database environment associated with the one or more hardware processing devices are searched for records having the field property corresponding to the specified party. The field property from the corresponding multiple disparate tables are evaluated. A unified field property is determined based on the evaluation of the field property from the corresponding multiple disparate tables. The unified field property is returned through the API.

Abstract: A relational database system for performing a join operation between a first table and a second table may include a query analyzer and an optimization engine. The query analyzer may compare predicates of a join operation query for an American National Standards Institute (ANSI) compliant database. The optimization engine, based upon comparison of the predicates, is to bypass a scan of the second table as part of outputting semantically correct results for the join operation.

Abstract: Disclosed herein are systems and methods for implementing multidimensional two-sided interval joins on a distributed hash-based-equality-join infrastructure. In an embodiment, a data platform receives, for a query on a database, query instructions that include a two-sided N-dimensional interval join of a first input relation and a second input relation, where N is an integer greater than 1. The two-sided N-dimensional interval join has an interval-join predicate that, in each of N dimensions, compares an interval determined from the first input relation with an interval determined from the second input relation. The data platform generates a query-execution plan that implements the two-sided N-dimensional interval join as a query-plan section that includes an N-dimensional band join followed by a filter that applies the interval-join predicate to a band-join output of the N-dimensional band join. The data platform obtains results of the query at least in part by executing the query-execution plan.

Abstract: At least one database table of denormalized values corresponding to selected values of field properties in records across multiple disparate tables of the database environment is maintained. A structured query is received through a structured query language application program interface (API). The structured query to request a listing of records across the multiple disparate tables of the database environment. The database table is searched for indications corresponding to records across the multiple disparate tables of the database environment corresponding to the selected values indicating communication with a specified party. A listing of records from across the multiple disparate tables that satisfy the selected values is returned through the structured query language API.

Abstract: Disclosed herein are systems and methods for multidimensional and multi-relation sampling for implementing multidimensional two-sided interval joins. In an embodiment, a data platform receives query instructions for a two-sided N dimensional interval join, where N is an integer greater than 1. The two-sided N dimensional interval join has an interval-join predicate that compares intervals determined from the input relations in each of N dimensions. The data platform samples interval sizes in one or more input relations, and demarcates an N dimensional input domain based on the sampling. The data platform implements the two-sided N dimensional interval join using an N dimensional band join followed by a filter that applies the interval-join predicate. The N dimensional band join includes a hash join keyed to N dimensional domain cells overlapped at least in part by intervals in the input relations in each of the N dimensions.

Abstract: An object encoding and computation method in a database system, where a global object sample space is constituted based on correlation between a plurality of object sample spaces in a database. A global dictionary table is created in the global object sample space to provide a globally unique encoding value for each object, set the encoding value as an object identifier (ID) of the object, and ensure that the object ID and object description information are in a one-to-one mapping relationship. The database object is encoded and compressed based on the global dictionary table. Further, the object ID is directly used for database query computation.

Abstract: Embodiments for managing feature engineering with relational data are provided. A graphical user interface (GUI) that provides a user with the ability to upload a plurality of tables, select joins between the plurality of tables, and select keys for the joins is provided. Responsive to receiving user input indicative of selecting joins between the plurality of tables and selecting keys for the joins utilizing the GUI, the user selections are automatically validated and actions associated with at least some of the plurality of tables are dynamically performed based on the user selections. Information associated with the user selections and the validating is provided. The information includes a recommendation to link a third key in the at least some of the plurality of tables to a fourth key in the at least some of the plurality of tables.

Abstract: The disclosed embodiments include a method performed by a data intake and query system. The method includes ingesting each metric including at least one key value and a measured value taken of a computing resource, and storing each metric in an index of a metrics store, where the index defines at least one dimension populated with the at least one key value and a measure populated with the measured value. The method further includes cataloging metadata in a metrics catalog, where the metadata is related to the metrics stored in the metrics store, performing an analysis of metrics data included in the metrics store and/or the metrics catalog to obtain results, and causing display of the results or an indication of the results on a display device.

Abstract: Techniques are provided for storing generic time series data using a dynamic schema. One method comprises receiving a request to store a data point into a time series, wherein the data point comprises a key-value pair; in response to the received request, (i) evaluating whether a current dynamic schema supports the data point, and (ii) updating the current dynamic schema to support the data point responsive to the current dynamic schema not supporting the data point, wherein the current dynamic schema supports a plurality of data types; encoding the data point using an encoding technique that depends on the data type of at least one key-value pair of the data point; and storing the data point in a time series storage buffer.

Abstract: Systems, methods, and devices for querying over an external table are disclosed. A method includes connecting a database platform to an external table such that the database platform has read access for the external table and does not have write access for the external table. The method includes receiving a query comprising a predicate, the query directed at least to data in the external table. The method includes determining, based on metadata, one or more partitions in the external table comprising data satisfying the predicate. The method includes pruning, based on the metadata, all partitions in the external table that do not comprise any data satisfying the predicate. The method includes generating a query plan comprising a plurality of discrete subtasks. The method includes assigning, based on the metadata, the plurality of discrete subtasks to one or more nodes in an execution platform.

Abstract: A computer-implemented method for joining two data tables on a join attribute, where the data tables have at least a first and a second attribute and the second attribute is the join attribute. The method provides a function for associating a computing node to a given record. The function may be used to determine the associated computing node. The records of the two data tables may be distributed to the respective determined computing nodes. The relationship between the values of the first and second attributes may be modelled using a predefined dataset. For each record of the two data tables the values of the first attribute may be re-determined using the corresponding values of the second attribute. The function may be used to re-determine the associated computing node.

Abstract: A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/Furthermore, the device processes the set of queries using the updated set of processors.

Abstract: Context-based multi-granularity intent discovery, in relation to determining the intent of a user-problem associated with one of a plurality of products, includes identifying each of the plurality of products in a base intent level of a hierarchical intent data structure, creating a first granularity level below the base intent level, and creating a subsequent granularity level. The first granularity level includes groupings of the plurality of user-problems created according to a first common intent feature; the common intent feature is related to a respective one of the plurality of products. The subsequent granularity level includes sub-groupings of the user-problems of a respective grouping with each sub-grouping created according to a second common intent feature. The second common intent feature of each sub-grouping is determined without consideration of the first common intent feature.

Abstract: Disclosed is a computer program stored in a computer-readable medium according to an exemplary embodiment of the present disclosure. When the computer program is executed by one or more processors, the computer program allows the following operations for data caching to be performed and the operations may include an operation of generating a cache, an operation of caching at least some of the segments and at least one of records to the cache, an operation of reading the cache when receiving an inquiry request from a client, an operation of determining to read a cursor based on whether there is a segment or record corresponding to the inquiry request in the cache; and an operation of determining whether a query for at least one of a relational database and a hierarchical database is generated based on whether there is the segment or record in the cursor.

Abstract: A method for performing analysis may use a minimal set of indices for an input query including identifying the input query including primitive searches that are accelerated using indices, computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm, and performing relational data analysis using the minimal set of indices for input queries.

Abstract: Managed materialized views may be generated from across heterogeneous data sources. A request to create a materialized view may be received and performed by a materialized view management platform, which may obtain and generate the materialized view from different data sources and store the materialized view in a target system. Changes to the data sources may be obtained at the materialized view management platform and updates to the materialized view may be determined. The materialized view in the target system may be updated.

Abstract: Techniques are provided for merging (a) statistics associated with data added to a table in a bulk load operation with (b) statistics associated with data that existed in the table before the bulk load operation. The statistics associated with the bulk load data are generated on-the-fly during the bulk load, and are merged with the pre-existing statistics as part of the same transaction that is used to perform the bulk load operation. Consequently, execution plans for queries that are assigned snapshot times after the commit time of the bulk load transaction will be selected based on the new statistics, while execution plans for queries that are assigned snapshot times before the commit time of the bulk load transaction will be selected based on the pre-existing statistics.

Abstract: Example implementations described herein are directed to systems and methods for managing a relationship between real-time analysis processes and applications, where each of the applications are configured to utilize output from one or more of the corresponding real-time analysis processes. In an example implementation, resource adjustment is applied to the real-time analysis process based on a determined priority.

Abstract: A computer system receives an input corresponding to one or more data pipeline metrics and generates a first plurality of data windows from a first portion of a plurality of streaming data, the first plurality of data windows corresponding to a first data pipeline metric. The computer system generates a first plurality of data aggregations corresponding to the first plurality of data windows, wherein generating the first plurality of data aggregations includes aggregating a data associated with each of the first plurality of windows based on the first data pipeline metric. The computer system accesses a database to determine a first set of reference data aggregations that corresponds to a first data aggregation of the first plurality of data aggregations and determines whether the first data aggregation corresponds to an anomaly based on utilizing a model to compare the first set of reference data aggregations to the first data aggregation.

Abstract: Various examples are directed to systems and methods for utilizing local identifiers in a distributed database system. A database management system server may receive first execution unit data describing a first execution unit of a first database query. The first execution unit data may comprise first operand data describing a set of operands for the first execution unit. The database management system server may determine that the first operand data describes at least one operand from a first partition and at least one operand from a second partition. The database management system server may generate a first set of local identifiers describing rows at the first partition and a first set of local identifiers describing rows at the second partition. The database management system server may execute the first execution unit based at least in part on the first set of local identifiers describing rows at the first partition and the first set of local identifiers describing rows at the second partition.

Abstract: A non-transitory storage medium having stored thereon logic is disclosed. The logic is executable by one or more processors to perform operations including: determining, according to first user input received via a user interface (UI), a type of sampling to be performed, and generating (i) a randomized sampling plan for a substance stored in a first container, and (ii) a corresponding data object representing a three-dimensional (3D) model of the first container, wherein the 3D model includes a plurality of increments, wherein a subset of the plurality of increments to be sampled includes a visual indicator. A first type of sampling to be performed includes bulk sampling, and a second type of sampling to be performed includes packaged sampling. The logic, when executed by the one or more processors, may perform further operations including receiving additional user input, via the UI, corresponding to information pertaining to sampling environment conditions.

Abstract: A query comprising a graph pattern comprising a plurality of graph triples of node-edge-node is received. A graph database comprising a plurality of graph patterns is accessed and a plurality of graph patterns in the graph database that match the received query are identified. An inverse frequency for each graph triple of the received query in the accessed graph database is calculated and from this a score for each graph pattern in the graph database that matches the received query is also calculated, the score comprising a sum of the inverse frequencies for each graph triple contained within the respective graph pattern. The plurality of graph patterns in the graph database that match the received query are then ranked according to their respective calculated scores.

Abstract: A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provision a set of processors from a first plurality of processors, where the set of processors to process the set of queries and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates an amount of the processor resources in the set of processors provisioned based on the utilization. Furthermore, the device processes the set of queries using the updated set of processors.

Abstract: A data store system includes an array of persistent storage devices configured to store a plurality of data store tables. The data store system includes a processor in communication with the storage device. The processor may receive a query comprising an aggregate function and identify structure of an argument of the aggregate function. The subset of data store tables may be associated with the argument. The processor may partially-execute the aggregate function on each data store table in the subset involved in the argument of the aggregate function to create partially-executed results for each data store table of the subset of data store tables. The processor may join the partially-executed results based on join conditions contained in the aggregate function. The processor may complete execution of the aggregate function on the partially-executed results to generate a final result of the aggregate function. A method and computer-readable medium are also disclosed.

Abstract: A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/Furthermore, the device processes the set of queries using the updated set of processors.

Abstract: A method, system, and computer program product for graph-based searching for one or more data streams is disclosed. A computer-implemented method comprises extracting a plurality of tuples from one or more data streams. The method further comprises generating a graph for the plurality of tuples in which a node represents a tuple of the plurality of tuples and an edge represents a correlation between the node and another node, and the edge is generated based at least partly on one or more predetermined queries for the one or more data streams. The method further comprises traversing the graph based on the one or more predetermined queries. Accordingly, embodiments of the present disclosure can improve the search speed by use of the graph-based searching for one or more data streams.

Abstract: In some implementations, there is provided an apparatus having at least one data processor and at least one memory storing instructions which, when executed by the at least one data processor, cause executing at least a portion of a query execution plan; determining, at an edge including an intermediate result, a cardinality; proceeding with the execution of the query execution plan, when the determined cardinality is within an optimality range associated with the edge; and selecting an alternative query execution plan for execution, when the determined cardinality is outside the optimality range associated with the edge. Related systems and articles of manufacture are also provided.

Abstract: A system includes reception of a first query including a first temporary materialized view, where the first temporary materialized view associated with a first view and a first temporary table. The first temporary table is refreshed if it is determined that the first temporary materialized view is stale, and the first query is executed using a result set cached in the first temporary table. The first temporary table caches the result set for the remainder of the current database session.

Abstract: A relational database storage method according to one embodiment generates a join graph including tables and edges based on either a database schema including referential constraints among database tables or a query workload containing a set of join predicates, classifies the type of tables based on the cost of a join operation between the tables included in the join graph, classifies the type of edges in the join graph on the basis of the type of the tables connected to each other by the edge, adds a virtual edge between two tables satisfying the indirect join condition, and generates a database partitioning scheme for the join graph based on the set of tables in the join graph and their type, the set of edges in the join graph and their type, and virtual edges.

Abstract: A method is executed at a computer system to retrieve data from a database. Upon receiving a database query, a database engine of the computer system parses the query to form an operator tree including a plurality of join operators. For each of the plurality of clauses, the database engine adds to the operator tree a respective node that specifies a mark join operator, a single join operator, an inner join operator, or an outer join operator. Specifically, the database engine adds the mark join operator when the respective clause includes one of a predetermined set of predicate subqueries, and adds the single join operator when the respective clause includes a scalar subquery. The database engine performs one or more optimization passes on the operator tree to form an optimized execution plan, and executes the optimized execution plan to retrieve a result set from the database.

Abstract: A database engine receives a database query that specifies retrieving data from a data source. The database engine parses the query to build an operator tree that includes a TableScan operator configured to scan a table from the data source to produce outputs corresponding to a single data field from the table, and includes a GroupBy operator that groups rows of the table according to the data field. The database engine generates and executes code corresponding to the operator tree to retrieve a result set. When the TableScan operator is a child of the GroupBy operator and the outputs are independent of duplicate input rows from the table, execution of the TableScan operator comprises, for each storage block of rows from the table: determining a storage compression scheme for encoding the data field and, for certain encodings, using the encoding to produce the outputs without duplication of rows.

Abstract: A method includes: obtaining, by an inner table node that stores a portion of an inner table, a portion of an outer table from each of outer table nodes, and wherein a size of the outer table is less than a size of the inner table; reading, by the inner table node, the outer table by table joining threads or table joining processes of the inner table node; matching, by the table joining threads or the table joining processes, the outer table with the portion of the inner table stored at the inner table node; and outputting, by the inner table node, data from the outer table and the portion of the inner table that matches with each other.

Abstract: Techniques for efficient execution of queries. A query plan generated for the query is optimized and rewritten as an enhanced query plan, which when executed, uses fewer CPU cycles and thus executes faster than the original query plan. The query for which the enhanced query plan is generated thus executes faster without compromising the results obtained or the data being queried. Optimization includes identifying a set of one or more fact scan operations in the original query plan and then, in the rewritten enhanced query plan, associating one or more dimension context predicate conditions with one or more of the set of fact scan operations. This reduces the overall cost of scanning and/or processing fact records in the enhanced query plan compared to the original query plan and makes the enhanced query plan execute faster than the original query plan.

Abstract: A user selects a data source, and a computer displays a data visualization in a data visualization user interface according to the data source. The data visualization includes visual data marks representing data from the data source. The user selects a subset of the visual data marks. In response, the computer displaying a view data window having a summary of the selected data marks. The computer obtains a data model encoding the data source as a tree of logical tables, each including one or more logical fields. Each logical field corresponds to either a data field or a calculation that spans one or more logical tables. Each edge of the tree connects two logical tables that are related. The computer identifies aggregate measures corresponding to the selected data marks, and displays each aggregate measure in the view data window.

Abstract: A computer-implemented method includes: receiving, by a computer device, a database query of a database from a database client; determining, by the computer device and based on the database query, a to-be-masked portion of data; sending, by the computer device, the database query to a federated database system for the to-be-masked portion of the data; receiving, by the computer device and in response to the sending, masked resultant data from the federated database system; and forwarding, by the computer device, the masked resultant data to the database client. The to-be-masked portion of the data is masked in at least one view of the database residing on the federated database system.

Abstract: Systems, methods, and devices for incrementally refreshing a materialized view are disclosed. A method includes generating a materialized view based on a source table. The method includes merging the source table and the materialized view to generate a merged table to identify whether an update has been executed on the source table that is not reflected in the materialized view. The method includes, in response to detecting an update made to the source table that is not reflected in the materialized view, applying the update to the materialized view.

Abstract: Harmonization of failure domains in a distributed system is provided herein. A data storage system as described herein can include a memory that stores computer executable components and a processor that executes computer executable components stored in the memory. The computer executable components can include a node assignment component that assigns computing nodes in the data storage system to respective failure domains of a set of data failure domains, a hashing component that generates hashing information associated with respective computing nodes of the computing nodes assigned to a selected failure domain of the set of failure domains, and a group update component that designates at least one computing node of the computing nodes in the selected data failure domain to perform an operation associated with the hashing information.

Abstract: A system has a distributed database with database partitions distributed across worker nodes connected by a network. An analytical view recommendation engine defines an analytical view comprising attributes and measures defined prior to the receipt of a query. The analytical view is maintained as a data unit separate from the distributed database. The analytical view recommendation engine includes instructions executed by a processor to identify a poorly performing report, evaluate queries associated with the poorly performing report, create a recommended analytical view to enhance the performance of the poorly performing report, and deploy the recommended analytical view.

Abstract: A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/Furthermore, the device processes the set of queries using the updated set of processors.

Abstract: Embodiments relate to efficiently performing an inner join on segments from a data source, where the segments have wildcards in join columns. An algorithm for an inner segment join operator may build a location map that describes locations, by segment and column, of values in the join columns of rows in the segments. A map of wildcard locations, by segment and column, may also be constructed. The location map may be supplemented with information from the wildcard map. The data source is scanned and contents of rows in the data source are queried against the location map to join rows with segments that match due to either matching values or wildcard presence. A user interface may be provided to facilitate construction of joins using the inner segment join operator.

Abstract: In a method for caching a generated query plan for time series data, a query plan for time series data is generated based on a query comprising an expression, the query plan including a path of execution for resolving the query. The path of execution of the query plan to resolve the query is executed. A result of the path of execution is returned as a response to the query. The query plan is cached for retrieval and execution responsive to receiving another query that matches the query, such that the query plan can be used to resolve the another query.