Abstract: A processing module of a database system is operable to determining a query for execution. A plurality of row sets are processed over a temporal period in conjunction with execution of the query based on automatically selecting a requested number of rows to be included in each row set based on row scheduling parameters, generating a scheduling request for the requested number of rows, and receiving each row set for processing in response to the scheduling request via access to one segment of a set of segments required for execution of the query. A query resultant for the query is generated based on processing of the plurality of row sets, and further based on processing of an additional plurality of rows included in the set of segments via a set of other processing modules implemented in parallel with the processing module.

Abstract: A method for optimizing a database query includes receiving a database query from a user requesting a database to conditionally return one or more rows stored at the database and characterizing one or more user filters. Each user filter filters rows from the database. The method includes determining that a security filter restricts the user from accessing one or more rows of the database. For each respective user filter, the method includes classifying the respective user filter as a safe user filter incapable of reporting an error or an unsafe user filter capable of reporting an error. The method also includes determining a filter execution order of the one or more user filters and the security filter based on the classified one or more user filters and executing, using the determined filter execution order, the one or more user filters and the security filter.

Abstract: Remote grouping operations may be used to perform queries for distinct values. A query may be received at a query engine that includes a request for distinct items from a data set stored in a data store. To perform the query, a request may be made to the data store to group items from the data set by value when returned from the data store to the query engine. The query engine may then evaluate the items grouped by value that are returned from the data store to determine distinct items as part of performing the query.

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: Exemplary embodiments include tracking processing time metrics of multiple server queries. A processing time per query type is estimated using the tracked processing time metrics. A current queue wait time is estimated based on a number of queries currently in the queue and the estimated processing times of query types for each of the queries currently in the queue. Upon receiving a current server query from a client, the current query type is mapped to an estimated processing time determined using the tracked processing time metrics. An estimated response time is determined using the current queue wait time and the estimated processing time. The server query is rejected from being added to the queue in response to determining the estimated response time does not satisfy a service level objective and an error message is sent to the client indicating the rejection of the server query.

Abstract: A system and method whereby a group of people can privately, or in an online location with a singular purpose, share a website, social network, or other communications for a particular event. A personalized social network can be generated for the group to enhance privacy, security, and ease of interaction. The personalized social network can be associated with a place, time, or other conditions, such that the social network can effectively address a singular purpose, such as a wedding, and all group members can easily communicate information relative to the event.

Abstract: A method, a computer program product, and a system for scheduling a first query execution plan for executing a first query for accessing first data sets of data of a relational database system (RDBS) and a second query execution plan for executing a second query for accessing second data sets of the data. The data is divided into data blocks of data sets of the data, wherein metadata of the RDBS comprises respective information about at least one property of the data sets of a respective data block of the data blocks. The scheduling may be performed on the basis of an examination if there is a common partition between a first partition of data blocks which may fulfill a first condition according to the first query and a second partition of data blocks which may fulfill a second condition according to the second query.

Abstract: Techniques for simultaneously displaying a list of items and content associated with a selected item are described herein. The disclosed techniques include detecting a selection of an item among a plurality of items; obtaining webpage content associated with a selected item; converting a display mode of the list of search results to a single-column mode; determining items to be displayed among the plurality of items based at least in part on a position of the selected item in the plurality of items; and displaying a list of the determined items and the webpage content associated with the selected item on the same screen.

Abstract: Techniques for implementing a vector database in a multi-tenant environment are described. A system creates an index of a tenant that scales efficiently in a multi-tenant environment. The index is created by clustering the plurality of vectors into a set of clusters. The created index forms a hierarchical index including plurality of layers and is stored in a primary data storage unit. The system includes an intermediate data storage unit to store new vectors and to avoid re-indexing every time a new vector with an associated operation such as insert, update, and delete, is added. Further, the system provides reliable nearest neighbor vectors from the created index of the tenant. Read operation is performed over the quick-retrieval data, primary data, and intermediate to determine the nearest neighbor vectors.

Abstract: Disclosed herein provides enhancements for operating a data access system for large data processing environments. In one implementation, a method provides for maintaining a data structure comprising a plurality of customized code configurations each associated with a data request rule for each of the multiple application services. A code configuration query from a user is then received indicating a data request rule. The code configuration query requests code configurations for data retrieval from at least one of the multiple storage services over the data access system. The data structure is queried for one or more customized code configurations for each of the multiple application services associated with the indicated data request rule. The user is then provided with the one or more customized code configurations for each of the multiple application services associated with the indicated data request rule.

Abstract: Disclosed are methods and computer systems to generate, update, traverse, and analyze a nodal data structure based on data associated with an entity. The methods and systems disclosed herein describe a server that can generate and link various nodes in a nodal network and parse data into unique domain tables. When the server receives a request to analyze the data, the server executes clustering algorithms to identify preferred nodes that correspond to one or more attributes within the received request. The server then executes one or more analytical protocols using the preferred nodes and displays the results.

Abstract: A method for querying in a candidate vector set candidate vectors similar to object vectors is disclosed, wherein the candidate vector set comprises a plurality of candidate vectors each being quantized as having a central vector portion and a residual vector portion, the method comprising: querying, a first number of candidate vector subsets that are closest to the object vector; generating and storing a plurality of common calculation results based on a set of central vector portions and a set of residual vector portions of candidate vectors of the first number of candidate vector subsets; generating and storing pre-calculation results based on the set of object vectors and the set of residual vector portion; and determining, a second number of candidate vectors that are similar to each object vector in the corresponding first number of candidate vector subsets based on the stored pre-calculation results and common calculation results.

Abstract: The present disclosure relates to a data management method and apparatus, a storage medium, and an electronic device. The method comprises: obtaining a data access request sent by an engine side, the data access request being used for requesting to perform an access operation on first target data in a data lake; determining, according to the data access request, target metadata corresponding to the first target data from a metadata storage module, the metadata storage module storing metadata of the data lake in different storage modes, respectively, and the metadata stored in the different storage modes having at least one type of the same information; and sending the first target data corresponding to the target metadata in the data lake to the engine side. By constructing a data lake metadata unified service view that meets various engine requirements, metadata intercommunication between different engines is realized.

Abstract: A determination is made as to whether a workload associated with a collection of data items satisfies a first condition. If the first condition is satisfied, a determination is made as to whether a metric of dirty records to which delete operations have been directed within a portion of a data item satisfies a second condition. If the second condition is also satisfied, a cleanup operation may be initiated so that data blocks storing the portion of the data item do not include the deleted record.

Abstract: Systems, methods, and other embodiments associated with managing query loads are described. In one embodiment, a system is configured to define a fingerprint for received queries that are requested for execution on a database system and determine whether the defined fingerprint matches or does not match an existing fingerprint. For queries having a fingerprint that does not match an existing fingerprint: the system executes the query to completion and sets a classification for the fingerprint indicating the query (i) is flagged for evaluation or (ii) is permissible. For queries having a fingerprint that matches an existing fingerprint: determine whether the fingerprint was previously flagged and evaluate statistics for the fingerprint to determine whether execution will cause a negative impact on the system. The classification of the fingerprint is modified accordingly. The system controls execution of the query based on the classification of the fingerprint.

Abstract: Systems, devices, and techniques are disclosed for multi-threaded dynamic queries on an unpartitioned database. An instruction to perform a database operation on rows of a database may be received. Processing threads may be generated by generating three random numbers. A starting point of a processing thread may be set to a first random number, an offset may be set to a second random number, and an order may be based on a third random number. The processing threads may each generate a dynamic query. A dynamic query generated by a processing thread may include an instruction to perform the database operation on rows of the database based on the offset, starting point, and order for the processing thread. Each dynamic query may be run against the database to perform the database operation.

Abstract: A property display device includes: a search content acquirer that acquires search variables and search data; a property value acquirer that acquires property values of a compound corresponding to the search data; a priority setter that sets a priority of the search variables; a display format determiner that determines a display format of the property of the compound by assigning search variables of high priority to coordinate axes A1 and A2 of color maps Ma and assigning search variables of lower priority than the search variables of high priority to array direction axes A3 and A4 of a first array map Mb1; and an image processor that generates at least one first array map Mb1 as a single image on the basis of the search data, the property values, and the display format.

Abstract: External functions can provide users of a database system the ability to invoke external services while operating from inside the database system. The techniques described herein address may detect throttling by the external system and automatically adjust or modify a request rate accordingly. Also, the techniques described herein may increase the request rate to optimize the use of the resources provided by the external system. These techniques allow the database system to improve efficiency when working with external services, which may or may not be elastic or scalable. Moreover, these techniques can decrease query execution times and reduce costs.

Abstract: Various approaches for identifying possible unsecured devices on a network as set forth. In some cases, approaches discussed relate to systems and methods for identifying possible unsecured devices based upon a host name for each of the discovered devices.

Abstract: A method of finding online relevant conversing posts, comprises receiving, by a web server serving an online forum, a query post from an inquirer using the online forum, computing a contextual similarity score between each conversing post of a set of conversing posts with a query post, wherein the contextual similarity score is computed between the body of each of conversing posts and of the query post, wherein N1 conversing posts with a highest contextual similarity score are selected; computing a fine grained similarity score between the subject of the query post and of each of the N1 conversing posts, wherein N2 conversing posts with a highest fine grained similarity score are selected; and boosting the fine grained similarity score of the N2 conversing posts based on relevance metrics, wherein N3 highest ranked conversing posts are selected as a list of conversing posts most relevant to the query post.