Abstract: Aspects of the disclosure generally relate to computing devices and may be generally directed to devices, systems, methods, and/or applications for learning the operation of a computing device or software application, storing this knowledge in a knowledgebase, neural network, or other repository, and enabling autonomous operation of the computing device or software application with partial, minimal, or no user input.

Abstract: Disclosed herein are methods for receiving a command for adding or removing a resource in a database and acquiring an exclusive lock for the database in response the command. In response to obtaining the exclusive lock, the method comprises determining a first number indicating the number of resources currently existing in the database and a second number indicating the number of resources subject to concurrent further commands for adding or removing a resource; comparing the first and the second number for determining whether the received command will remove the last existing resource or add a first resource to the database; and obtaining an exclusive or a shared lock for the received command in dependence on the determination. The method further includes releasing the exclusive lock for the database and adding or removing the resource while holding the lock obtained for the received command.

Abstract: Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region.

Abstract: The system described herein can automatically match, link, or otherwise associate electronic activities with one or more record objects. For an electronic activity that is eligible or qualifies to be matched with one or more record objects, the system can identify one or more set of rules or rule sets. Using the rule sets, the system can identify candidate record objects. The system can then rank the identified candidate record objects to select one or more record objects with which to associate the electronic activity. The system can then store an association between the electronic activity and the selected one or more record objects.

Abstract: The present disclosure relates to a method for processing a data table. The data table is divided into a plurality of data blocks, and a multidimensional data structure for representing the plurality of data blocks is generated. For each data block of at least part of the plurality of data blocks, a respective data element is added into the multidimensional data structure. The data element has multiple values indicative of a first attribute of the data block. The multidimensional data structure is stored for selectively processing a portion of the data blocks using the multidimensional data structure.

Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing read queries latch-free access to an index page. In an embodiment, a processor receives a request from a read query to access one or more records of an index page. The index page includes an update pointer and a slot array. The processor locates one or more updates prepended to the index page by locating a most recently prepended update indicated by the update pointer. Then, the processor generates a local offset table with entries in the slot array and the located one or more updates. The generated local offset table enables the processor to provide the read query access to the one or more records of the index page.

Abstract: A data store system includes a processor that may generate a hash value based on a hash function for each column value in a selected column of a data store table and may select a first domain and a second domain of hash values. The processor may determine a frequency value for each hash value within the first domain, generate a unique identifier for each hash value within the second domain, and determine at least one statistic on the selected column based on the frequency values and the unique identifiers. The processor may store the at least one statistic for use in a query plan. A method and computer-readable medium may also be implemented.

Abstract: A method for propagating a structure query language (SQL) association can include determining, based at least on a syntax of a SQL create view statement, that a SQL association requires propagation to a SQL view associated with the SQL create view statement. The SQL association can combine data from at least a first data model and a second data model at a database. The SQL view can comprise at least a portion of the combined data. An association information data structure can be generated for storing information corresponding to a definition of the SQL association. The SQL create view statement can be executed based on the association information data structure. Related systems and articles of manufacture, including computer program products, are also disclose.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. In response to receiving a first query for a set of data, the program generates a first query execution plan based on the first query. The program further executes the first query execution plan in order to generate a first result set comprising the set of data. The program also stores the first query execution plan in a cache. The program further replaces the first query execution plan in the cache with a second query execution plan. The second query execution plan includes a query hint applied to the first query execution plan. In response to receiving a second query for the set of data, the program also retrieves the second query execution plan from the cache. The program further executes the second query execution plan in order to generate a second result set comprising the set of data.

Abstract: Activity information relating to activities of a respective electronic communication recipient accessing information associated with an electronic communication is received from each of a plurality of electronic communication clients. The activity information received from each of the plurality of electronic communication clients can indicate an amount of time the electronic communication is open in the respective electronic communication client. Based on the received activity information, each of the electronic communication recipients can be rated to generate at least one recommendation as to who is able to provide information pertaining to the electronic communication. The recommendation can be communicated to another electronic communication recipient.

Abstract: Described are methods, systems and computer readable media for query task operations based on memory allocation and performance criteria.

Abstract: An apparatus and techniques for constructing and utilizing a “dynamic dictionary” that is not a compiled dictionary, and therefore does not need to be recompiled in order to be updated. The dynamic dictionary includes respective data structures that represent (i) a management automaton that includes a plurality of management nodes, and (ii) a runtime automaton that is derived from the management automaton and includes a plurality of runtime nodes. The runtime automaton may be used to search input data, such as communication traffic over a network, for keywords of interest, while the management automaton manages the addition of keywords to the dynamic dictionary. Typically, at least two (e.g., exactly two) such dynamic dictionaries are used in combination with a static dictionary.

Abstract: A computer-implemented method for automatically reviewing structured query language (SQL) statements comprises the steps of receiving SQL code from a user seeking to access a database, parsing the SQL code to retrieve SQL keywords, mathematical operators, and logical operators, applying a complexity score calculation algorithm to the parsed code, calculating a complexity score, and executing the SQL code on a computing system which stores the database if the complexity score is less than or equal to a threshold. On the other hand, if the complexity score is greater than the threshold, the SQL code may be flagged to be rewritten.

Abstract: A system for cardinality estimation for database query planning is provided. In some implementations, the system performs operations comprising selecting a subset of data from a set of data on which a database query is to be executed, the set of data including a first quantity of tuples and the subset of data including a second quantity of tuples. The operations can further comprise determining, based on evaluating one or more predicates on the subset, a third quantity of tuples in the subset which satisfy the one or more predicates. The operations can further comprise determining, based on the first quantity, the second quantity, and the third quantity, a range within the subset that comprises estimated cardinalities of the one or more predicates within a predetermined error threshold range. Related systems, methods, and articles of manufacture are also described.

Abstract: A computer server system and method are disclosed for personalization and customizable filtering of network search results and search result rankings, such as for Internet searching. A representative server system comprises: a network interface to receive a query from a respondent or co-respondent; at least one data storage device storing a plurality of return queries; and one or more processors adapted to access the data storage device and using the query, to select the return queries for transmission; to search the data storage device for corresponding pluralities of responses to the return queries from other co-respondents or respondents; to pair-wise score the responses and generate pair-wise alignment scores for respondent and co-respondent combinations; to sort and rank the combinations according to the alignment scores; and to output a listing of the sorted and ranked respondents or co-respondents to form the personalized network search results and search result rankings.

Abstract: Systems and methods for presenting search results from multiple sources by ranking sources that results are received from and not presenting duplicate results from lower ranked sources. For example, results from a first source and a second source may be received. The results from the first source may be presented in a row closer to the top of a screen than the results from the second source in response to the user having a preference for the first source over the second source. If the two results match, the result is only displayed in the row for the higher ranked source and another result is presented in the second row that does not match any of the displayed results in the first row.

Abstract: According to one aspect, a query plan is generated for a newly submitted structured query language (SQL) query received by a relational database management system by reusing at least part of an existing query plan that is being kept in memory after execution.

Abstract: Techniques for managing and discovering data using visual or audible representations may be provided. The data, in some examples, may correspond with individual items, and the system may correlate each item with a representation of the item (e.g., for navigation, for accessibility, etc.). The representations may be provided to allow discovery of the items in response to adjusting the resolution, audibly requesting information, or panning across a display to discover items that are displayed as these representations outside of the original presentation of representations. In some examples, the representation of the item may not be unique to the item or may be represented as a placeholder image or description. The higher the resolution, the more detail about the item may be provided. When an item is selected, item data may be provided that corresponds with the item.

Abstract: Systems, methods and devices to provide recommendation information. A server, server system or server-implemented method can comprise circuitry that collects pieces of information via the Internet, determines recommendation information from the collected pieces of information, and determines an information search degree associated with the recommendation information. Data regarding the recommendation information and data regarding the information search degree can be output to provide an indication of the recommendation information. An apparatus, system or method can control display of recommended information and can comprise or be implemented using circuitry that receives, from a source external to the apparatus or system, data regarding recommended information and data regarding a generated information search degree associated with the recommended information.

Abstract: Managing queries performed on one or more data sources includes: storing at least a first query in a storage medium; selecting the first query for processing; instructing a query engine to process the first query on a first portion of data in the one or more data sources for a first query interval; receiving result data from the query engine based on processing the first query on the first portion of data; saving a state of the first query in the storage medium after the first query interval; instructing the query engine to process a second query during a second query interval after the first query interval; and instructing the query engine to process the first query on a second portion of data in the one or more data sources during a third query interval after the second query interval.

Abstract: Clustering a set of natural language queries NLQs based on a set of significant events retrieved from a corpus stored in a computer system is described. A set of NLQs is used by a search engine for searching a selected corpus to retrieve respective sets of significant events. The set of NLQs is clustered into a plurality of NLQ clusters according to a threshold number of common significant events being returned by the search engine for respective members of an NLQ cluster.

Abstract: Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and/or improving computational efficiency when traversing data stored in a relational graph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.

Abstract: The disclosed computer-implemented method for culling search results in electronic discovery may include (1) identifying a data source that is subject to electronic discovery in connection with a lawsuit, (2) mining metadata of a plurality of files within the data source to generate metadata derivatives that describe non-content-based attributes of the files, (3) creating an index that groups the files into a plurality of categories representative of the metadata derivatives, (4) receiving, from a user involved in the electronic discovery, user input that specifies a subset of the categories within the index and a keyword, (5) searching the subset of categories within the index for a subset of the files whose contents include the keyword, and (6) providing, to the user, a result of the search that identifies the subset of files whose contents include the keyword. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: In one respect, there is provided a method. The method can include identifying, based on a plurality of queries executed at a distributed database, a disjoint table set. The identifying of the disjoint table set can include: identifying a first table that is used in executing a first query; identifying a second query that also uses the first table used in executing the first query; identifying a second table that is used in executing the second query but not in executing the first query; and including, in the disjoint table set, the first table and the second table. The method can further include allocating, based on the disjoint table set, a storage and/or management of the disjoint table set such that subsets of the disjoint table set are stored at and/or managed by different nodes in the distributed database system. Related methods and articles of manufacture are also disclosed.

Abstract: Among other things, we describe a computer-implemented method, performed by a data processing system, of executing a computer program based on a query that is expressed in accordance with a query language applicable to a relational database, the computer program executed based at least in part on data stored in a tangible, non-transitory computer-readable medium, the executing including receiving a SQL query, where the SQL query includes an identifier associated with a resource that is external to the data processing system, generating a computer program based on the SQL query, and executing the computer program, causing transmitting one or more instructions to the resource, the instructions defining operations other than operations of the SQL query, and receiving data from the resource in response to the instructions.

Abstract: Traversing data stored in a relational graph by utilization of probabilistic characteristics associated with the graph nodes is disclosed. When a user submits a request with a graph query, an initial node associated with the graph query is identified. Further, the edge type associated the node is extracted from the graph query. When traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type. If the query for the node is negative, then the edges for the particular node are not enumerated. However, if the query for the node is positive, then the edges for the particular node are enumerated for expanding the subgraph. This process continues until the subgraph is expanded to include all relevant nodes. Thus, the computational efficiency is improved by reducing the number of edges that must be traversed when performing graph queries.

Abstract: A multi-tenant database may maintain a plurality of datasets on a memory device that is subject to degraded operation caused by a subset of possible state transitions within the device's memory cells. A storage engine may identify entropy characteristics of datasets, independently of other datasets hosted on the memory, and use the entropy to construct a symbol table that maps from data within the dataset to symbols that may be stored on the memory device with a minimized number of state transitions.

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: A system and method for receiving a query of a partitioned table, the query including a first index predicate associated with a first partition key column; determining that one or more of the query is missing a second index predicate and the first index predicate is unusable for index probing; responsive to determining that one or more of the query is missing the second index predicate and the first index predicate is unusable for index probing, generating one or more synthesized predicates used to process the query using an index scan.

Abstract: [Object] To provide a device assisting a user to easily generate, in relation to an issue of interest to the user, a question sentence guaranteed to have an answer of a certain accuracy or higher in a question-answering system. [Solution] A question sentence generating device is used with a question-answering system, and it includes: word receiving means for receiving a word 480 as a source for generating a question sentence; and question sentence generating database 502 comprised of a plurality of entries for generating a question sentence. Each of the plurality of entries has a word as a key and includes an answer sentence pattern co-occurring with the word, used in the question-answering system.

Abstract: There is provided an identification apparatus. A storage unit stores an operation history as a history of an operation executed in at least one information processing apparatus. An acquisition unit acquires malware spread information including information indicating malware. An identification unit identifies, based on the operation history, an intrusion route of the malware indicated by the malware spread information acquired by the acquisition unit, generates at least one piece of malware spread information corresponding to at least one operation included in the intrusion route in the operation history, and identifies, in the operation history, for each of the at least one piece of malware spread information, at least one operation of spreading the malware by setting, as a direct or indirect start point, the malware indicated by the malware spread information.

Abstract: Techniques are described for maintaining an expression statistics store that stores and updates metadata values for query expressions based on the occurrence of those query expressions within queries. In an embodiment, a database server instance receives a database query. In response, the database server instance identifies expressions within the database queries. The database server instance then determines whether an expression statistics store includes an entry for the particular expression. Responsive to determining that the expression statistics store includes an entry for the particular expression, the database server instance updates at least one metadata value in the entry based on the occurrence of the particular expression. Responsive to determining that the expression statistics store does not include an entry for the particular expression, the database server instance adds an entry for the particular expression.

Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory.

Abstract: An application complementation module may access application data from an application repository, the application data associated with a first application. The data collections of a data service provider (e.g., OData service) used in the first application and at least one navigation used in the first application to navigate between the data collections are determined based on the application data. Service metadata (e.g., Entity Data Model (EDM)) from the data service provider is searched for new navigations between the used data collections that are different from the navigations used in the first application. An application that is complementary (e.g., provides different or complementary navigations) to the first application may then be generated based on the data collections used in the first application and any new navigations between the data collections discovered from the service metadata. A recommendation regarding the generated application may be provided to a user of the first application.

Abstract: A mechanism is provided in a question answering system for categorizing questions. The mechanism clusters documents from a corpus of documents to form a nested structure of clusters of documents. The mechanism records questions answered by question answering system in a database in association with answers returned and answer confidence values. The mechanism maps the questions to the nested structure of clusters of documents to form a nested structure of clusters of questions. The mechanism presents recommended questions based on the nested structure of clusters of questions in a user interface of the question answering system.

Abstract: Aspects extend to methods, systems, and computer program products for optimally pipelining result sets with fault tolerance in distributed query execution. Distributed computing jobs are optimized by dividing the distributed computing jobs into one or more bubbles for execution. Each bubble can be independently executed, potentially in parallel with other bubbles, when resources to handle the bubble are available. Intra-bubble communication can be streamed between vertices within a bubble. Inter-bubble communication can be stored to durable storage. Bubbles provide a failure boundary for a job graph and re-executing a bubble along with storage of intermediate results in durable storage can be used to recover from failures. When a vertex inside a bubble fails, computation can resume by rescheduling the execution of the failed bubble from the durable inputs for that bubble. Durable storage provides a light-weight failover to handle non-deterministic behavior.

Abstract: A system and computer implemented method for execution of aggregation expressions on a distributed non-relational database system is provided. According to one aspect, an aggregation operation may be provided that permits more complex operations using separate collections. For instance, it may be desirable to create a report from one collection using information grouped according to information stored in another collection. Such a capability may be provided within other conventional database systems, however, in a non-relational database system such as NoSQL, the system is not capable of performing server-side joins, such a capability may not be performed without denormalizing the attributes into each object that references it, or by performing application-level joins which is not efficient and leads to unnecessarily complex code within the application that interfaces with the NoSQL database system.

Abstract: System and method for computing critical data of multiple entities is provided. Elements, from a set of predetermined elements, are assigned to sentences of a first dataset associated with an entity of an industry type. Predetermined elements characterize reputation of entities of various industries. Features determined from sentences of first dataset are categorized into groups. Features of a new dataset of a different entity of said industry type are matched with grouped features and same groups are allotted thereto. Classification rules are applied on matched features. Elements are assigned to sentences of new dataset based on allotted groups, which elements are same as those assigned to first dataset. Reputation scores are generated for said entities by determining positive and negative sentiments from the first and new dataset. Steps of assigning elements and grouping are repeated for datasets associated with entities of different industry types for creating a taxonomy for them.

Abstract: One or more systems and/or methods for determining a query date range and/or searching a content corpus are provided. A set of content items (e.g., digital images, videos, etc.), associated with an event, may be identified from a content corpus. The set of content items may be evaluated to identify temporal features (e.g., digital time stamps) for the set of content items. A query date range for the event may be determined based upon the temporal features (e.g., users may capture photos that are related to Christmas from December 4th to December 27th). In an example, responsive to receiving a search query, associated with the event, the search query may be adjusted based upon the query date range to create an adjusted search query. The content corpus may be searched using the adjusted search query to create search query results for the search query.

Abstract: A social network post subject area of a social network post is identified using text analysis. A longevity of social network posts related to the social network post subject area on each of multiple hosting platforms is determined using monitored multi-platform post-longevity information. A hosting platform with a determined highest longevity of the related social network posts is recommended from among the multiple hosting platforms. Responsive to user approval of the recommended hosting platform, the social network post is posted to the recommended hosting platform with the determined highest longevity of the related social network posts.

Abstract: Methods and systems of providing metadata association with videos on a video hosting system on a computer network are provided. Search records associated with search queries directed to the video hosting system are received. Each search record identifies videos that are search results for a search query and indicates view durations that the videos were viewed responsive to the search query. First and second videos competing for views of users are identified from the received search records. The first and second videos each have metadata respectively describing the first and second videos. Search queries directed to the first video are identified from the search records. Search terms associated with the search queries are further identified and compared to the metadata of the second video. Search terms that are not included in the metadata of the second video are identified as metadata improvements to the second video.

Abstract: A system includes determination of a match between a first table column of a plurality of table columns of database tables and a second table column of the plurality of table columns, determination, based on stored metadata, of a first data dictionary associated with the first table column and a second data dictionary associated with the second table column, merging of the first data dictionary and the second data dictionary to generate a merged data dictionary, and modification of the stored metadata to associate the first data dictionary with the merged data dictionary and to associate the second data dictionary with the merged data dictionary.

Abstract: In a method for determining appropriate runtime environments for execution of a process model, a computer receives a process model. The process model includes a plurality of activities, wherein two activities are linked by a relationship. The computer determines that the two activities linked by a relationship match a process pattern. The computer determines one or more runtime environments for execution of the process model, wherein each of the one or more runtime environments is capable of executing the process pattern.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for allocating computing resources. In one aspect, a method includes receiving intent data specifying one or more computing services to be hosted by a computing network, requested characteristics of computing resources for use in hosting the computing service, and a priority value for each requested characteristic. A budget constraint is identified for each computing service. Available resources data is identified that specifies a set of available computing resources. A resource allocation problem for allocating computing resources for the one or more computing resources is generated based on the intent data, each budget constraint, and the available resources data. At least a portion of the set of computing resources is allocated for the one or more computing services based on results of evaluating the resource allocation problem to meet a particular resource allocation objective.

Abstract: A distributed database system can include a plurality of nodes. In order to execute a query at the distributed database system, one or more of the plurality of nodes can perform operations included in an execution plan for the query. A first node of the plurality of nodes can group the plurality of nodes into at least a first cluster. The first node can further select a second node to act as a gateway node for the first cluster. The first node can determine that at least one recipient node of a message is included in the first cluster and route the message to the recipient node by at least sending the message to the second node. Related methods and articles of manufacture are also disclosed.

Abstract: A computer-implemented method and system for querying a database that comprises 3D modeled objects that represent mechanical parts. The method or system provides a query that includes a likeness criterion relative to the value of a predetermined shape descriptor for an input 3D modeled object. A next step returns, as results of the query, respective 3D modeled objects of the database based on an extent to which the value of the predetermined shape descriptor for the respective 3D modeled object respects the likeness criterion. The value of the predetermined shape descriptor for a respective 3D modeled object includes a set of axis systems that are trihedral. The likeness increasingly depends on an extent to which sets of axis systems match each other modulo a same similarity transformation. Such a method and system improves the querying of a database that comprises 3D modeled objects that represent mechanical parts.

Abstract: According to an aspect, a system for moving a filter in a query model to ensure query semantics includes a query engine configured to obtain a query model for a query to be executed on a database. The query engine includes a query optimizer configured to instantiate the query model by merging the query with the query model. The query optimizer includes a filter mover configured to move a filter to a point within the instantiated query model such that semantics for the query within the instantiated query model is ensured.

Abstract: Performance thresholds are defined for operators in a flow graph for a streaming application. A streams manager deploys the flow graph to one or more virtual machines (VMs). The performance of each portion of the flow graph on each VM is monitored. A VM is selected. When the performance of the portion of the flow graph in the selected VM does not satisfy the defined performance threshold(s), a determination is made regarding whether the portion of the flow graph is underperforming or overperforming. When the portion of the flow graph is underperforming, the portion of the flow graph is split into multiple portions that are implemented on multiple VMs. When the portion of the flow graph is overperforming, a determination is made of whether a neighbor VM is also overperforming. When a neighbor VM is also overperforming, the two VMs may be coalesced into a single VM.

Abstract: According to some embodiments, a database, containing entries, may be stored across first and second storage medium, entries in the second storage medium being default invisible for online transactional processing. A central software layer processor between the database and an application may identify a subset of the entries stored in the first storage medium as being default visible for online transactional processing, wherein entries stored in the first storage medium that are not within the subset are default invisible for online transactional processing. Note that entries in the first storage medium may be accessible by the application more quickly as compared to entries in the second storage medium.