A system includes an interface and a processor. The interface is configured to receive an indication that a change has occurred to partition data on a first node, wherein the partition data is stored on a partition on the first node. The processor is configured to: determine whether the change to the partition data causes a change to a predetermined partition result of a set of predetermined partition results stored by the partition; and in response to a determination that the change to partition data affects the predetermined partition result stored by the partition: determine a new value for the predetermined partition result; store the new value; and provide an indication to a service node that the new value for the predetermined partition result has been determined, wherein the service node is selected by a client application system to manage execution of a task.

Examples disclosed herein relate to accessing electronic databases. Some examples disclosed herein may include partitioning a computation task into subtasks. A processing node of a computation engine may generate a database query for retrieving an electronic data segment associated with at least one of the subtasks from a database. The database query may include pre-processing instructions for a database management system (DBMS) associated with the database to pre-process the electronic data segment before providing the electronic data segment to the processing node. The pre-processing instructions may include at least one of: filtering, projection, join, aggregation, count, and user-defined instructions. The generated query may be provided to the DBMS.

A system, method, and machine-readable storage medium for maintaining an object storage system data are provided. In some embodiments, an object manager may receive a request to perform an operation on an object. The object storage system includes a first database of a first type and a second database of a second type. The object manager may identify a first record stored in the first database. The first record includes a name marker indicating a range of object names covered by the second database and includes a file handle referencing the second database. The range of object names includes the object name. Additionally, the object manager may identify a second record stored in the second database. The second record includes the object name and includes a file handle referencing the object. The object manager may perform the operation on the object in accordance with the request.

Embodiments of the present disclosure provide a system for accelerated data search of a database storage system. The system includes a host device including a database storage engine; and a memory system including a controller and a memory device, which includes a plurality of pages storing multiple records. The controller includes a page processing accelerator configured to: read, from the plurality of pages, multiple pages in response to a filtered read command; filter particular pages among the multiple pages based on a column full search condition, the filtered pages including entries satisfying the column full search condition; and transfer, to the host device, information regarding the filtered pages.

A search apparatus (1) coupled to a database, the apparatus (1) comprising: a processor configured to execute instructions; a memory storing instructions which, when executed by the processor, cause the processor to: search the database for items containing a search term, wherein items containing the search term are matched items; identify fields corresponding to attributes of the matched items; define a range of values for each field; divide the range of values for each field into a plurality of ranged field buckets; distribute the matched items between the ranged field buckets based on attributes of the matched items that are within the range of values for each ranged field bucket; calculate an effectiveness value for each field based on the number of matched items in each of the ranged field buckets; select one or more top fields, each top field having an effectiveness value that is greater than a predetermined effectiveness value; and provide an effectiveness indicator output which is indicative of the effectiveness of each top field such that a user can use the effectiveness indicator output to select a top field for use as a filter in a further search.

A computing device receives user selection of a data source. The computing device receives a user input to specify a level of detail (LOD) expression, which includes a first keyword, a SORT keyword, and an analytic expression. In response to the user input, the computing device identifies one or more data fields from the data source. The device translates the LOD expression into one or more executable database queries referencing the identified data fields. The computing device executes the queries to retrieve data from the data source. The computing device generates and displays a data visualization using the retrieved data.

A binary relational database model is described whereby application-layer object structures are easily inferred from database query templates. The object structures take the form of acyclic hypergraphs, which are induced from primal graphs representing query templates. Database applications may iterate through the collection of returned object structures, accessing the data in each structure. The returned object structures are not based on a fixed object model, thereby permitting rich structures with greater applicability than traditional ORM systems. A relationship between non-primitive entities may be directly expressed without the need for alternative join tables. Development and maintenance costs are thus substantially reduced, and data is more efficiently stored and manipulated for database applications.

A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

This disclosure relates to increasing database functionality in non-relational databases using an object relational mapper to provide updates to table field values across a plurality of separate tables and provide virtual table functionality through compound search operations and condensed table structures.

A system and method is described for database split generation in a massively parallel or distributed database environment including a plurality of databases and a data warehouse layer providing data summarization and querying functionality. A database table accessor of the system obtains, from an associated client application, a query for data in a table of the data warehouse layer, wherein the query includes a user preference. The system obtains table data representative of properties of the table, and determines a splits generator in accordance with one or more of the user preference or the properties of the table. The system generates, by the selected splits generator, table splits dividing the user query into a plurality of query splits, and outputs the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits against the table.