Abstract: A pruning index is generated for a source table organized into a set of batch units. The source table comprises a column of semi-structured data. The pruning index comprises a set of filters that index distinct values in each column of the source table. Rather than reassembling an entire tree structure of the semi-structured data prior to indexing, the generating of the pruning index comprises traversing a reassembly hook object that represents a first portion of the semi-structured data that is subcolumnarized and traversing a residual object that represents a second portion of the semi-structured data that is not subcolumnarized. The reassembly hook object is traversed to identify values corresponding to the first portion of the semi-structured data and the residual object is traversed to identify values corresponding to the second portion. The pruning index is stored with an association with the source table.

Abstract: Adapting database queries from a common interface into conditions specific to database storage formats, optimization of a data model, and virtualization of query results from combined databases.

Abstract: A computer-based system and method for optimizing execution of regular expression rules, each including one or more sub-rules, may include: testing, by a processor, the sub-rules against a data sample; measuring, by a processor and based on the testing, the probability for every sub-rule that it appears in the data sample, and the processing time of each sub-rule; and finding, by a processor, an order of execution of at least a subset of the sub-rules to shorten the total execution time of validating the regular expression rules, based to the probability and the execution time of each of the sub-rules.

Abstract: One or more table partitions may communicate with an index partition that may be a master of a replication group. A communications channel may exist between table partitions and the index partition. Upon splitting the index partition, communications between the table partitions and the index partition may be suspended. Upon completion of the split, communications may be reestablished between the table partitions and a partition, of the replication group of index partitions, designated to be a master following the split. Messages accumulated by the table partitions during the split may be sent to the index partition upon reestablishing communications.

Abstract: A multi-index method and a multi-index apparatus for a cloud database, a cloud system, and a computer-readable storage medium are provided. The cloud database includes an index unit, and the multi-index method includes: storing multiple data values in a storage unit and acquiring storage address information of each of the data values in the storage unit; and storing a value of each of multiple index keywords corresponding to each data value in the index unit in association with the storage address information of the data value, so that the cloud database is indexed according to at least two of the multiple index keywords.

Abstract: Methods for automatic selection of degrees of parallelism for efficient execution of queries in a database system are performed by systems and devices. An incoming query associated with a query system is received and features of the incoming query are determined. A system state of the query system and a set of executing queries are also determined, along with a query state of each executing query in the set. At runtime of the incoming query, allocation of a degree of parallelism for executing the query is determined by calculating different possible execution times for the incoming query at least partially concurrently with the set of executing queries. Execution times are calculated for different parallel thread options and based on query features, system state, or query states of executing queries. The execution of the incoming query is initialized with the parallel thread option corresponding to a specific execution completion time.

Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.

Abstract: A method, system and computer program product includes receiving and parsing an SQL query, identifying at least one common sub expression, or sub-query, or combination thereof, used multiple times within the SQL query, constructing for the at least one common sub expression, or sub-query, or combination thereof, a query execution plan that maintains as part of an initial result set a bit vector for a fact table, storing a result bit vector and an indicator that tracks a last valid tuple processed to produce the result bit vector when a TEMP operation is indicated in the query execution plan, reassessing a TEMP result in other portions of the query execution plan, priming a list of tuples using the TEMP result, and retrieving respective columns for further processing in the query execution plan.

Abstract: Trace data is received for a first execution of a first query on first tables having first data values. Second data values are generated for second tables from the trace data and without accessing the first data values. The second data values are configured to reproduce, by a second execution of a second query, the evaluation states from the first execution. Evaluation states from the first execution are reproduced without accessing the first data values by performing the second execution of the second query on the second data values. The first execution evaluates only a first subset of the first data values and the generating the second data values from the trace data generates second data values corresponding to the first subset. The second execution only evaluates ones of the second data values that correspond to data values of the first subset.

Abstract: Trace data is received that was captured for an execution of a query on first tables when execution trouble occurs during an execution of the query on the first tables. Trace data includes counts of evaluation states caused by the execution and includes identifications of portions of the query that reference variables of the first tables and that correspond with the evaluation states. Second tables are generated from the evaluation state counts and the identifications of the trace data without accessing data values of the first tables, so that the first tables are kept private. Evaluation states are reproduced from the execution of the query on the first tables by executing the query on the second tables without accessing the data values of the first tables.

Abstract: With exponential growth in virtualized traffic within physical data centers, many end users (e.g., individuals and enterprises) have begun moving work processes and data to cloud computing platforms. A visibility platform can be used to monitor virtualized traffic traversing a cloud computing platform, such as Amazon Web Services, VMware, or OpenStack. But it can be difficult to manage how the visibility platform handles incoming virtualized traffic. Introduced here, therefore, are graphs that visually represent the network fabric of a visibility platform. When the network fabric of the visibility platform is represented as a graph, an end user can easily modify the network fabric, for example, by adding, removing, or modifying nodes that represent network objects, adding, removing, or modifying connections between pairs of nodes that represent traffic flows between pairs of network objects, etc.

Abstract: Systems, apparatuses, and methods for dynamically optimizing memory traffic in multi-client systems are disclosed. A system includes a plurality of client devices, a memory subsystem, and a communication fabric coupled to the client devices and the memory subsystem. The system includes a first client which generates memory access requests targeting the memory subsystem. Prior to sending a given memory access request to the fabric, the first client analyzes metadata associated with data targeted by the given memory access request. If the metadata indicates the targeted data is the same as or is able to be derived from previously retrieved data, the first client prevents the request from being sent out on the fabric on the data path to memory subsystem. This helps to reduce memory bandwidth consumption and allows the fabric and the memory subsystem to stay in a low-power state for longer periods of time.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes, receiving a query from a client, based on the received query, analyzing a catalog for location information, based on the analysis, determining a first storage system, an associated first file system and an associated first protocol, using the associated first protocol to communicate with the first storage system, and performing at least a portion of the query on the first storage system.

Abstract: A system may store data in a shared table of a distributed database based on generating a tenant-specific partition key. The system may receive a message from a first tenant that indicates certain data to be written to or retrieved from a shared table (e.g., shared between multiple tenants). The system may then identify a data key, a tenant identifier, and a data type identifier associated with the data and generate a partition key that includes the data key, tenant identifier, and data type identifier. The system may then transmit the partition key to the shared table, and data may be written to or retrieved from the table based on the tenant-specific partition key.

Abstract: In an example, a database system may be configured to validate relational database instructions using a plurality of validators. In some examples, validation may be pre-production for relational database instructions based on simulated user inputs and/or file, such as plan files (e.g., PL/SQL (procedural language/structured query language) files). In some examples, validation may be in production for relational database instructions based on system views of a database engine.

Abstract: The disclosed embodiments provide a system that describes a semi-structured document for the purpose of acquiring a set of data elements from the semi-structured document. During operation, the system obtains a physics model of a semi-structured document, wherein the physics model includes a set of relationships represented by physical objects that describe relative positions of a set of data elements in the semi-structured document. Next, the system applies the physics model to a representation of the semi-structured document to automatically extract a set of data from the representation. The system then provides the extracted set of data for use with one or more applications without requiring manual input of the data into the one or more applications.

Abstract: A data-serialization system initially uses a recursive serialization algorithm to serialize a hierarchy of nested data objects by translating those objects into a serial stream of data. The system determines that a stack-overflow error is likely to occur whenever the number of objects serialized by the system exceeds a threshold value, or whenever the stack has reached an unacceptable level of utilization. When the system determines that a stack-overflow error is likely or if the system detects that a stack-overflow error will definitely occur if another object is serialized, the system either transfers control to a nonrecursive algorithm that does not require a stack data structure or reduces stack utilization by transferring contents of the stack to a variable-size queue-like data structure.

Abstract: Techniques for searching a character string involve: determining a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string; and generating a third set of documents based on the first and second sets of documents, in the third set of documents: i) a document being included in the first and second sets of documents, and ii) a distance between the first and second tokens in the document being equal to a distance between the first and second tokens in the character string.

Abstract: The present disclosure provides systems and methods for in-database generation of generalized linear models within a relational database. Generalized linear models form the basis of many machine learning algorithms and applications. In particular, in some implementations, the database commands that enable generation and use of the models include only pure SQL queries, thereby eliminating the need for user defined aggregates (UDAs), which are not offered by many cloud database service providers. For example, a set of client-side driver scripts can implement respective sets of pure SQL queries to import training data, generate and train the generalized linear model, and employ the model to generate inferences.

Abstract: A multi-column index is generated based on an interleaving of data bits for selectivity for efficient processing of data in a relational database system. Two or more columns may be identified for inclusion in the multi-column index for a relational database table. Based, at least in part, on the interleaving of data bits for selectivity from the identified columns, a multi-column index is generated for the relational database table that provides a respective index value for each entry in the relational database table. The entries of the relational database table may then be stored according to the index values of the multi-column index.

Abstract: Methods and systems of the present disclosure provide techniques to improve the display of and merge the results of one or more searches of a computer document in a simple, user-controlled manner. One method involves receiving a query, and searching files to identify any matches to the query. Another method involves visually marking the matches on the display so that the matches can be easily compared to the matches of subsequent queries. A method is also provided in which a user can pin the results of one query to a viewing pane of the display so that the results can be easily compared to the results of subsequent queries.

Abstract: Trace data is received that was captured for an execution of a first query on first input data. The trace data associates clauses of the first query with respective evaluation states that arise during the execution. Second input data is generated from the trace data without accessing the first input data. An execution of a second query is performed on the second input data, wherein performing the execution of the second query on the second input data reproduces evaluation states from the execution of the first query on the first input data.

Abstract: A storage system includes a distributed file system. An attribute of a particular entity in the file system relates to a snapshot. In response to an operation in the storage system, it is determined whether the snapshot attribute is to be propagated to another entity of the file system.

Abstract: A computer-implemented method for providing performance indicators of destination documents includes identifying a referral document to a destination document, where the referral document comprising a source of at least one visitor to the destination document. The method also includes extracting referral keywords from content of the referral document, the referral keywords corresponding to a referral context of the referral document. The method further includes determining a degree of correlation between the referral document and the destination document based on a comparison between the referral keywords and destination keywords, the destination keywords corresponding to destination context of the destination document.

Abstract: The disclosure relates to technology for facilitating query optimization in a distributed data processing system to efficiently and precisely compute predicate push down and partition pruning A query operation is performed to locate data in the data processing system, thereby generating a predicate. Critical points of the predicate are determined based on data stored in the system, and critical point ranges are formed from a sorted sequence of each of the critical points. The predicate is evaluated using the critical points to qualify the critical point ranges, and a reduction is applied to the predicate during partial evaluation to produce reduced predicates on the qualified critical point ranges. The qualified critical point ranges are compared and matched to range partitions of data stored in the distributed system to qualify the range partitions. The reduced predicate is processed against the data in the qualified range partitions to obtain a query result.

Abstract: The disclosed embodiments provide a system that describes a semi-structured document for the purpose of acquiring a set of data elements from the semi-structured document. During operation, the system obtains a physics model of a semi-structured document, wherein the physics model includes a set of relationships represented by physical objects that describe relative positions of a set of data elements in the semi-structured document. Next, the system applies the physics model to a representation of the semi-structured document to automatically extract a set of data from the representation. The system then provides the extracted set of data for use with one or more applications without requiring manual input of the data into the one or more applications.

Abstract: The technology disclosed relates to sub-clustering within service clusters in real-time. In particular, it relates to accessing a network topology that records node data and connection data including processes running on numerous hosts grouped into local services on the hosts, the local services running on multiple hosts grouped into service clusters and sub-clusters of service clusters, and network connections used by the service clusters to connect the hosts grouped into service connections, wherein the node data includes software versions of the processes and process data with configuration files and clustering the multiple hosts with the service clusters into the sub-clusters based at least in part on the software versions.

Abstract: The invention relates to a computer-implemented method for processing a query in a database, the query comprising a search value. The database comprises a plurality of datasets the datasets comprising entries, wherein distance statistics are assigned to the datasets. The distance statistics describe the minimum and maximum distance between the values of the entries of a dataset of the plurality of datasets and a reference value. The method comprises determining the distance between the search value and the reference value, said determination resulting in a search distance, determining a subset of datasets from the plurality of datasets for which the search distance is within the limits given by the minimum and maximum distances described by the respective distance statistics, and searching for the search value in the subset of datasets.

Abstract: A pair of records is tokenized to form a normalized representation of an entity represented by each record. The tokens are correlated to a machine learning system by determining whether a learned resolution already exists for the two entities. If not, the normalized records are compared to generate a comparison measure to determine whether the records match. The normalized records can also be used to perform a web search and web search results can be normalized and used as additional records for matching. When a match is found, the records are updated to indicate that they match, and the match is provided to the machine learning system to update the learned resolutions.

Abstract: Methods and systems are provided for determining the intent of a recommendation made by a user of a mobile application where the application includes a plurality of separable components, any one or more of which the recommendation can apply to. An application in which a user recommendation control is provided for presentation to a user also includes a tag indicating how a recommendation of the application should be interpreted with respect to the components included therein. The tag can be set by the application developer and can be in the form of text (e.g., a keyword or term) or a uniform resource locator (URL). Where a tag references multiple components of an application, a recommending user can be presented with a recommendation intent query. The recommendation intent query allows a user to designate one or more components of the application to which the user's recommendation should be attributed.

Abstract: A method and system for forecasting a histogram in a database system is provided. The method includes determining that database table statistics and historical statistical histograms associated with specified subject matter have been previously retrieved. The database table statistics and historical statistical histograms are retrieved and determined to be frequency based histograms. Historical target values associated with the historical statistical histograms are identified and new target values associated with the historical target values are identified. A value identifying a number of occurrences for identified target values comprising the new target values and the historical target values is forecast and database table histograms comprising the identified target values are stored.

Abstract: A system includes reception of a request conforming to a modeled query and join filter criteria, the request comprising a first subrequest associated with a search attribute view and a second subrequest associated with an analytical view, definition of a join between the search attribute view and the analytical view based on one or more view attributes of the search attribute view, and filtering of a result set associated with the first subrequest based on the join and on the join filter criteria.

Abstract: The invention allows end users to obtain immediate, accurate information from structured databases without writing complex database query commands. The invention allows two different, but synchronized, methods of end user information requests: Spoken or typed Natural Language requests, and a Visual Request Specification method. Furthermore, the invention provides a user the means of “teaching the system the correct interpretation” when an information request was misunderstood by the invention's Natural Language Understanding module.

Abstract: A dynamically evolving cognitive architecture system based on a natural language intent interpreter is described. A system forms an intent based on a user input, and creates a plan based on the intent. The plan includes a first action object that transforms a first concept object associated with the intent into a second concept object and also includes a second action object that transforms the second concept object into a third concept object associated with a goal of the intent. The first action object and the second action object are selected from multiple action objects. The system executes the plan, and outputs a value associated with the third concept object.

Abstract: A method and an electronic device for determining the reliability of a Uniform Resource Locator (URL) is provided. The method includes receiving a selection of a displayed URL, detecting a reliability of the selected URL, and providing a safety level of the URL based on the detected reliability.

Abstract: A dynamically evolving cognitive architecture system based on training by third-party developers is described. A system forms an intent based on a user input, and creates a plan based on the intent. The plan includes a first action object that transforms a first concept object associated with the intent into a second concept object and also includes a second action object that transforms the second concept object into a third concept object associated with a goal of the intent. The first action object and the second action object are selected from multiple action objects. The system executes the plan, and outputs a value associated with the third concept object.

Abstract: A query plan for executing a query within a relational database system including at least one non-relational data source is generated by analyzing expressions that reference a non-relational data source within a query for the database system via an interface for that non-relational data source, determining for each analyzed expression at least one of the database system and interface capable of processing that analyzed expression for executing the query, providing an indicator for each of the analyzed expressions that indicates at least one of the database system and interface determined to process that analyzed expression, and generating the query plan for execution of the query, via the database system, based on the indicators for the expressions of the query.

Abstract: Identifying symbolic links in network file systems is provided. An absolute path may be determined at a network file server. This may include determining a complete client path from an initial client path and combining the complete client path with a server export path. Once the absolute path is determined, it may be traversed using a file descriptor of each file in the absolute path to identify a symbolic link.

Abstract: The disclosure relates to of generating a data structure stored in a computer memory for use in performing a search query to determine a separation between nodes in a network of interconnected nodes, wherein the method comprises: selecting a set of landmark nodes from the network; and for at least two of the landmark nodes in the set; generating a path tree for each landmark node that indicates a separation between the landmark node and each of a plurality of nodes; wherein the generating is configured to limit the number of path trees each of said plurality of nodes may appear in to no more than a predetermined number of path trees. A method of processing a data structure is also disclosed.

Abstract: The various embodiments herein provide a method for representing OLAP (Online Analytical Processing) queries in a data grid in real time. The method comprises of providing a new OLAP query, building a directed acyclic graph structure for the OLAP query, initializing the graph structure by generating signals for one or more business entities, processing the generated signals of one or more entities, linking entities based on matching of query filter parameters specified in the OLAP query and calculating aggregate values at one or more nodes. The nodes in the directed acyclic graph comprises: a plurality of blue nodes adapted to maintain links to one or more business entities stored in a datagrid and to hold the aggregate values and a plurality of grey nodes adapted to hold the calculated aggregate values. The aggregate values comprise at least one of SUM, ACCOUNT and AVG.

Abstract: A robust tenant placement and migration system, a process, and a respective controller for database-as-a-service environments are disclosed. Multiple tenants (T) are allocated on a set of in-memory database servers (S), such that workload changes depending on the tenants' behavior are considered, while maintaining strict service level objectives. The placement and migration are based on a migration command which, in turn, is based on an interleaved placement by interleaving tenants (T) across servers.

Abstract: A dynamically evolving cognitive architecture system based on third-party developers is described. A system forms an intent based on a user input, and creates a plan based on the intent. The plan includes a first action object that transforms a first concept object associated with the intent into a second concept object and also includes a second action object that transforms the second concept object into a third concept object associated with a goal of the intent. The first action object and the second action object are selected from multiple action objects. The system executes the plan, and outputs a value associated with the third concept object.

Abstract: A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request.

Abstract: A database back end system includes a monitoring server operable to poll a first database for a first query running on the first database and add the first query to a query list in a second database, and a reporting server operable to normalize the first query, analyze the second database to find a second query in the query list, wherein the second query is found based upon the normalized first query, and report the second query to a user, wherein the reporting is based upon the analyzing of the second database to find the second query.

Abstract: Techniques are disclosed for retrieving both data stored in relational form and data stored in XML form responsive to a single XQuery query. The techniques allow applications to retrieve relational data residing in various relational database management systems by using XQuery and XQuery for Java. In one such embodiment, an embeddable serverless computer component implements the techniques, and includes a combination of one or more relational adaptors and a mediator to access relational data and transform it into appropriate XML. The techniques are embeddable, and can be standards-based, database-independent, and operating-system independent. Optimized performance and scalability from desktop to enterprise applications are enabled as the number of users and/or database size increases.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to portions of the text query, accessing a context-free grammar model, identifying query tokens from the grammar model that correspond to the identified nodes and edges, selecting grammars having query tokens that corresponding to each of the identified nodes and edges, and generating structured queries based on the selected grammars, where the structure queries are based on strings generated by the grammars.

Abstract: There is provided a computer-implemented method of determining an execution ordering. An exemplary method comprises generating a directed graph based on a hierarchy. The hierarchy includes a plurality of pattern queries. The method also includes determining a minimum spanning tree of the directed graph. The method further includes determining an execution order of the pattern queries based on the minimum spanning tree.

Abstract: Aggregation of an in-memory database includes receiving, by at least one processor having a plurality of threads, input having records stored in random access memory, distributing, by the at least one processor, the input into portions, one of the plurality of threads having an assigned portion, aggregating, by the at least one processor, the records in the assigned portion based on locality of keys in the records and outputting, by the at least one processor, the aggregated records into a global hash table.

Abstract: Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.

Abstract: Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.