Abstract: Automated validation of the creation of indices in an environment that include multiple and potential many databases, such as perhaps a cloud computing environment. A validation module validates index impact of a created index by using a validation data store that contains validation data originating from a database collection. Index impact may be estimated by evaluating validation data generated prior to and after the creation of the index to thereby determine whether the created index results in overall improved query performance on the database collection for those queries that target the newly indexed database entity. Such validation data need not even contain private data that was contained within the query itself, and might be, for instance, query performance data, or execution plans associated with the query, with private data redacted.

Abstract: A method and system, the system including a plurality of machines each having a processor and a main memory component; a shared distributed storage facility storing a set of data and accessible by the plurality of machines over a communication network; a controller to select, in response to a state of a query execution plan comprising a plurality of executable jobs for the set of data, which one of a set of scheduling algorithms to execute; an execution engine to execute the selected scheduling algorithm to determine, for each job in the plurality of jobs, which server to schedule to execute the respective job; and providing an indication of the scheduling of the servers determined to be schedules for the execution of the jobs.

Abstract: According to one embodiment of the present invention, a system for processes a query for accessing data within one or more database objects stores an element of a database object among a plurality of different storage regions. Each storage region is associated with first and second range values indicating a value range for element values within that storage region. The system examines the first and second range values for the storage regions of each database object element and determines an effectiveness value representing a degree of overlap between the storage regions of that database object element. The system determines a selectivity model for the storage regions for each database object utilizing the effectiveness value, determines a query plan based on the selectivity model, and executes the query plan. Embodiments of the present invention further include a method and computer program product for processing a query in substantially the same manners.

Abstract: According to one embodiment of the present invention, a system for processes a query for accessing data within one or more database objects stores an element of a database object among a plurality of different storage regions. Each storage region is associated with first and second range values indicating a value range for element values within that storage region. The system examines the first and second range values for the storage regions of each database object element and determines an effectiveness value representing a degree of overlap between the storage regions of that database object element. The system determines a selectivity model for the storage regions for each database object utilizing the effectiveness value, determines a query plan based on the selectivity model, and executes the query plan. Embodiments of the present invention further include a method and computer program product for processing a query in substantially the same manners.

Abstract: Techniques for managing configurable data windows for streams and/or archived relations are provided. In some examples, a query that identifies at least a data stream or an archived relation may be identified. Additionally, a configurable window size may be identified. In some instances, the query may be initialized with at least a portion of the historical data based at least in part on the window size. Further, the query may be evaluated based at least in part on the data stream and the portion of the historical data.

Abstract: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

Abstract: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

Abstract: Techniques for managing continuous queries that include subqueries are provided. In some examples, a continuous query that includes at least a subquery may be identified. Additionally, the subquery may be processed to obtain a first result or generate a logical subquery plan. Further, in some instances, the continuous query may then be processed based at least in part on the first result from the subquery or by merging a logical continuous query plan with the logical subquery plan. This may result in obtaining a second result via querying a data source with the continuous query that is based at least in part on the first result from the subquery and/or the merged plans.

Abstract: The resources available for performing computing tasks or functions on a mobile device may be dynamically expanded by wirelessly linking the mobile device with other devices over a network, such as a Bluetooth® network. Where the mobile device is charged with performing tasks or functions that would exceed its available resources, the mobile device may allocate the performance of those tasks or functions to other devices on the network. Conversely, where a local device on a network has available, unused computing resources, the local device may permit other devices on the network to utilize its computing resources for the performance of other tasks or functions.

Abstract: A system executes a query associated with an application against a graph database by providing, to a first shard of the graph database, the query and a first query header that specifies the first shard. The query includes a subject, a predicate and an object, and the graph database stores a graph that includes nodes, edges between the nodes, and predicates to represent and store data. In response to the query, the system receives results and associated result headers from the first shard and a second shard, where the result headers specify that the results are partial results that are particular fractions of a total result. Furthermore, a combination of the partial results provides the total result to the query that includes a subset of the graph. Note that the subset of the graph may include desired information expressed within an associated structure of the graph.

Abstract: In one embodiment, a method for improving cardinality estimation of a join predicate between a fact table and an overloaded dimension table is provided. The method includes receiving a dimension table and a fact table in a join predicate of one or more SQL statements. The method further includes identifying a majority of records in the fact table that refer to a subset of records in the dimension table. The method further includes computing a filter factor of the join predicate between the dimension table and the fact table. The method further includes creating a statistical view using one or more relevant portions of the dimension table that are referred to by the fact table.

Abstract: Jumbo query plans are generated by applying at least one sharing technique and combining at least two of the pattern queries. Costs of the jumbo query plans may then be estimated and used to search for an optimal query plan. The optimal query plan may then be executed on an input data stream to generate an output data stream.

Abstract: A method may include receiving a continuous query identified by an archived relation associated with an application. The method may also include generating a physical query plan. Additionally, the method may include constructing a structured query language (SQL) equivalent expression corresponding to an attribute utilized by the operator and/or constructing an output SQL expression for the identified operator based at least in part on the SQL equivalent expression. Additionally, the method may include constructing the archiver query for the identified operator based at least in part on the output SQL expression. Further, the method may include executing the archiver query to obtain a result set of data records related to the application and/or generating a snapshot output of one or more data values related to the application based at least in part on the result set of data records.

Abstract: Pixel values that were computed in a previous frame may be reused for the current frame, operating in a sort-middle architecture. A hash or some other compact representation of all the data used in a tile, including all triangles, uniforms, textures, shaders, etc. is computed and stored for each tile. When rendering the next frame, that compact representation is once again computed for each tile. In a sort-middle architecture, there is a natural break point just before rasterization. At this break point, the compact representation may be compared to the compact representation computed in the previous frame for the same tile. If those compact representations are the same, then there is no need to render anything for this tile. Instead, the contents of the color buffer or other buffers of the previous frame of the tile may be moved to the same buffer of the tile for the current frame.

Abstract: A computer-implemented method for securely detecting data similarities may include (1) identifying a private data object subject to comparison to determine a similarity with at least one potentially similar data object, (2) establishing a connection between a client system and a server that is not authorized to access the private data object, (3) generating a summary of the private data object by applying a summary generation protocol between the client system and the server to the private data object without exposing plaintext from the private data object to the server and without exposing a parameter of the summary generation protocol to the client system, and (4) computing the similarity between the private data object and the potentially similar data object by using the summary of the private data object and a summary of the potentially similar data object. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A system and method for performing distributed execution of database queries includes a query server that receives a query to be executed on a database, forms a query plan based on the query, assigns tasks to task slots on a plurality of worker nodes in a cluster, and, upon receipt of a notification that a task has completed on a worker node, immediately assigns an unassigned task to a free task slot on that worker node, such that the task may begin executing on that worker node substantially immediately thereafter. The task slots on worker nodes include pools of resources that run tasks without start-up overhead.

Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.

Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.

Abstract: Methods for non-exclusionary searching within clustered in-memory databases are disclosed. The non-exclusionary search methods may allow the execution of searches where the results may include records where fields specified in the query are not populated or defined. The disclosed methods include the application of fuzzy matching and scoring algorithms, which enables the system to search, score and compare records with different schemata. This may significantly improve the recall of relevant records.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (RID) results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: A system and method for tagging place names with geographic location coordinates, the place names associated with a collection of objects in a memory of a computer system. The system and method process a text string within an object stored in memory to identify a first potential place name. The system and method determine whether geographic location coordinates are known for the first potential place name. The system and method identify the first potential place name associated with an object in the memory as a place name. The system and method tag the first identified place name associated with an object in the memory with its geographic location coordinates, when the geographic location coordinates for the first identified place name are known. The system and method disambiguate place names when multiple place names are found.

Abstract: Total global minimum costs can be determined for multiple sub-plans for completing a multi-operation database process to be performed in a distributed database management system that includes a plurality of nodes. The multiple sub-plans can include different distributions of node locations of a plurality of operators among the plurality of nodes. An optimal plan having a lowest total minimum global cost can be selected from the multiple sub-plans.

Abstract: An index shared between a plurality of tables is used to access a data sharing space (DSS) storing a set of rows from a base table having a plurality of rows with stored data. First data values of the index are identified in response to a query for a table. A subset of rows is then retrieved from the DSS using the index elements corresponding to the first data values. Second data values and some of the first data values are then identified in response to a second query for a table. A second subset of rows are then retrieved from the DSS using the index elements corresponding to the second data values and some of the first data values and the query is then applied to the subset of rows.

Abstract: The present disclosure involves systems, software, and computer-implemented methods for merging object hierarchies. An example method includes identifying a first object hierarchy including one or more objects, each of the one or more objects representing a query associated with a data set; identifying a second object hierarchy including one or more objects; and generating a merged object hierarchy including the one or more objects from the first object hierarchy and the one or more objects from second object hierarchy, the merged hierarchy combining objects from the first and second object hierarchies that match and share a common parent object, and separately maintaining objects from the first and second object hierarchies that match and do not share a common parent object.

Abstract: A system includes a first non-transitory computer-readable storage medium and a second non-transitory computer-readable storage medium each having stored thereon computer executable program code which, when executed on a computer system, causes the computer system to perform steps. The steps associated with the first non-transitory computer readable medium include generating a Service Adaptation Definition Language (SADL) definition for each of a plurality of business entity types, the SADL definition being based on an intermediate representation of each of the plurality of business entities, and publishing the SADL definition as a service of a SADL engine. The steps associated with the second non-transitory computer-readable storage include discovering the SADL definition and displaying, on a user interface, a representation of the SADL definition, the user interface configured to enable selection of two or more business entity types each associated with a different model layer framework.

Abstract: An electronic medical record employs a hybrid search engine which can perform structured queries for comprehensive search results and text searches for rapid identification of relevant information. A standard structured database of medical data is rendered accessible to text searches by generating pseudo-documents from the database that can then be subjected to standard information retrieval pre-processing.

Abstract: A method, system, and computer program product for accessing a SPARQL endpoint that is specified from within a SQL database query language statement. A method embodiment receives a SQL database query language statement that is then parsed in order to identify the locations of one or more SPARQL endpoints to be accessed. The database query language statement comprises operations and/or queries (e.g., SPARQL queries) to be performed over at least some linked data (e.g., queries over named RDF graphs) found at the one or more SPARQL endpoints. The database query language statement can also specify relational operations such as a relational database table operation, and/or a view operation, and/or other relational database functions that operate in conjunction with retrieved linked data.

Abstract: A method and system that organizes and transmits data between systems is provided. The system and method also includes monitoring, using the monitoring data of a configuration data object, an identified monitoring location to detect a presence of at least one image file received from an image processing device and detecting, at the monitoring location, a presence of a metadata file associated with the at least one image file and determining if a sufficient amount of metadata is included in the metadata file. In response to detecting a sufficient amount of metadata is included in the metadata file, automatically transmitting the at least one image file and metadata file to the destination location identified in the destination data and creating a table in a database based on the structure data and storing the at least one type of metadata therein.

Abstract: A query is executed in a massively parallel processing data storage system comprising a master node communicating with a cluster of multiple segments that access data in distributed storage by producing a self-described query plan at the master node that incorporates changeable metadata and information needed to execute the self-described query plan on the segments, and that incorporates references to obtain static metadata and information for functions and operators of the query plan from metadata stores on the segments. The distributed storage may be the Hadoop distributed file system, and the query plan may be a full function SQL query plan.

Abstract: A system and method for rearranging search operators of a search query are disclosed. In some example embodiments, a first initial search query is received from a first user. The first initial search query comprises at least one search operator and at least one search term. A first rewritten search query is generated based on the first initial search query. The generating of the first rewritten search query comprises rewriting at least one optional search operator in the first initial search query using at least one required search operator and at least one exclusion search operator in response to a determination that the first initial search query comprises the at least one optional search operator and does not comprise any required search operators. A first set of search results is generated for the first rewritten search query and caused to be presented to the first user.

Abstract: A cost estimator may estimate execution costs for execution of at least one query against a database, using at least one existing index, if any, and based on estimation criteria determined from analyzing the query execution. A candidate index provider may provide candidate indexes, based on the estimation criteria, and re-estimate the execution costs to obtain updated execution costs, using the candidate indexes. An index recommender may recommend a recommended index, based on the updated execution costs.

Abstract: Techniques and architectures for workload management. A stream of messages is received with servers coupled to provide access to shared system resources. The servers are organized as at least two groups with a first group providing message queuing services and a second group providing message queuing services under first conditions and modified message queuing services under second conditions. Message queuing services are provided with the first group by treating all jobs as equal, processing jobs asynchronously and processing jobs in the background to defer to foreground, non-message queuing services, jobs. Message queuing services are provided with the second group by treating all jobs as equal, processing jobs asynchronously and processing jobs in the background to defer to foreground, non-message queuing services, jobs under the first conditions. Modified message queuing services are provided with the second group by shortest-slack-first scheduling under the second conditions.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: An index shared between a plurality of tables is used to access a data sharing space (DSS) storing a set of rows from a base table having a plurality of rows with stored data. First data values of the index are identified in response to a query for a table. A subset of rows is then retrieved from the DSS using the index elements corresponding to the first data values. Second data values and some of the first data values are then identified in response to a second query for a table. A second subset of rows are then retrieved from the DSS using the index elements corresponding to the second data values and some of the first data values and the query is then applied to the subset of rows.

Abstract: Systems and methods are disclosed for query processing in a big data analytics platform by enumerating plans for a current query using a processor; building a dominance graph for the current query; for each plan, determining a regret value and a score for the plan based on the regret value and cost; and selecting query plans in an online fashion for query processing in big data analytics platforms where intermediate results are materialized and can be reused later.

Abstract: Disclosed here are methods, systems, paradigms and structures for predicting queries, creating tables to store data for the predicted queries, and selecting a particular table to obtain the data from in response to a query. The methods include determining various combinations of a finite set of columns users may query on, based on (i) a list of columns users are interested in obtaining data for, and (ii) cardinality information of a column or combinations of columns in the list of columns. The methods further includes creating various tables based on the determined combinations of the columns using a meta query language. A query is responded to by selecting a table that has least number of rows, among the tables that satisfy query parameters. The methods include selecting a table that has a longest sequence of columns matching with a portion of the query parameters.

Abstract: High-risk database statements are identified. A DBMS performs a series of experiments by generating sets of statistics describing data over which particular database statements run. The DBMS submits each of these sets of statistics to a query optimizer, which returns information for an execution plan that the optimizer would use to implement the statements given the submitted set of data statistics. If the DBMS determines that the optimizer changes the established execution plan for the database statements for any of the submitted sets of statistics, the DBMS performs one or more actions to mitigate the risk of changing execution plans, such as automatically tuning the database statements or the entire workload, and/or sending information about the database statements to a database administrator. Techniques are also described for calculating diagnostic values based on the results of such experiments, which quantify the sensitivity of the execution plans to changes in data statistics.

Abstract: Techniques for delivering video content are provided. A video distribution service maintains associations of viewer devices that have portions of specific items of video content. As new viewer devices, which lack the specific video content, make requests for the specific items of video content from the video distribution system, the video distribution system identifies a viewer device from which a portion of the item of video content may be acquired. Viewer devices having the requested content are identified by comparing distances between the locations of the requestor device and the other viewer devices of the plurality of viewers to a distance threshold. The first portion of a first item of video content is obtained from a source viewer device and a second portion of the first item of video content is obtained from the video distribution system. Other embodiments are disclosed.

Abstract: A method, apparatus, and system for a multi-instance database scan server is provided to process data scan operations for segments within in-memory stores, such as in-memory columnar (IMC) stores. The scan server uses a client/server based model, wherein each database instance in the database management system (“DBMS”) is associated with a client-side scan server and a server-side scan server. The client-side scan server can reside in the data and/or index layer of the DBMS, receiving requests for scan operations on in-memory segments. After receiving a data scan request from an IMC client, the client-side scan server can create several independently executable scanning tasks to process the request. The scanning tasks are each assigned to a particular server-side scan server for processing based on one or more factors, which may include a load balancing component. Additional factors to be considered may include instance affinity and/or NUMA (Non-Uniform Memory Access) affinity.

Abstract: A method and apparatus for recommending multimedia content in a communication system are provided. The method includes generating recommendation information for recommending content, and transmitting a message including the recommendation information, wherein the recommendation information includes information necessary for joining a session carrying the recommended content. The apparatus includes a control unit configured to generate recommendation information for recommending content; and a communication unit configured to transmit a message including the recommendation information, wherein the recommendation information includes information for joining a session carrying the content.

Abstract: A database system optimizes database queries that comprise subqueries. The database system factors out computation from two or more subqueries to a reusable subquery. The reusable subquery returns a result set. The subqueries are rewritten to use the result set and the database query modified to use the rewritten subqueries. The modified database query performs efficiently since the result set is computed only once for each subquery that uses the reusable query. The database system also composes nested subqueries that compute aggregate values. The database system identifies an inner subquery nested within an outer subquery, each subquery computing an aggregate value. The database system determines a new aggregate function corresponding to a composition of aggregate functions of the inner and the outer queries. The database system determines a composed query using the inner query with the outer query. The composed query uses the new aggregate function.

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

Abstract: A processing device to perform operations comprising receive, from a listener of a second node in a data grid system, a filter defined by search criteria of a search query. The operations can include determine, at the first node, that a third node in the data grid has crashed. The operations can further include iterate over backup data of the third node that is stored at a memory of the first node to determine the backup data that matches the filter. The operations can further include communicate, to the listener, the backup data that matches the filter.

Abstract: The invention relates to a method and system that provide a continuous querying mechanism that analyses real-time data streams to generate relevant results. It leverages data grid and event processing technology to provide a high performance and extremely scalable continuous querying solution. An embodiment of the invention provides a flexible querying language and data storage to allow users to register their interest in specific types of data, e.g. processes. The users are notified of matching results using an event-based mechanism. In order to efficiently analyze a large amount of data, the embodiment uses a grid infrastructure that allows storage of the data across many grid nodes and distributes the query execution workload, avoiding the bottleneck represented by constantly querying a database. Continuous queries are stored in a Continuous Query Registry and that Registry is invoked every time an insert or update event occurs on the triple store.

Abstract: A low-latency cloud-scale computation environment includes a query language, optimization, scheduling, fault tolerance and fault recovery. An event model can be used to extend a declarative query language so that temporal analysis of event of an event stream can be performed. Extractors and outputters can be used to define and implement functions that extend the capabilities of the event-based query language. A script written in the extended query language can be translated into an optimal parallel continuous execution plan. Execution of the plan can be orchestrated by a streaming job manager which schedules vertices on available computing machines. The streaming job manager can monitor overall job execution. Fault tolerance can be provided by tracking execution progress and data dependencies in each vertex. In the event of a failure, another instance of the failed vertex can be scheduled. An optimal recovery point can be determined based on checkpoints and data dependencies.

Abstract: A computer-implemented method for optimizing a queue of queries for database efficiency is implemented by a controller computing device coupled to a memory device. The method includes receiving a plurality of database queries at the computing device from at least one host, evaluating the plurality of database queries to determine a resource impact associated with each database query of the plurality of database queries, prioritizing the plurality of database queries based upon a set of prioritization factors and the resource impact associated with each database query, and submitting the prioritized plurality of database queries to a database system for execution. The database system executes the plurality of database queries in order of priority.

Abstract: A database management system (DBMS) generates a query execution plan including information representing one or more database (DB) operations necessary for executing a query, and executes the query in accordance with the query execution plan. In the execution of the query, the DBMS dynamically generates tasks for executing the DB operations and executes the dynamically generated tasks. The query execution plan includes a plurality of query blocks, which are sets of one or more DB operations. When newly generating a task, the DBMS executes determination processing of simultaneous-task-generation number. The determination processing of simultaneous-task-generation number is to calculate, targeting each of the query blocks, the number of simultaneous task generation, which is the number of tasks simultaneously generatable as tasks for executing the query block. The number of the dynamically generated tasks is equal to or smaller than the number of simultaneous task generation.

Abstract: A query is executed in a massively parallel processing data storage system comprising a master node communicating with a cluster of multiple segments that access data in distributed storage by producing a self-described query plan at the master node that incorporates changeable metadata and information needed to execute the self-described query plan on the segments, and that incorporates references to obtain static metadata and information for functions and operators of the query plan from metadata stores on the segments. The distributed storage may be the Hadoop distributed file system, and the query plan may be a full function SQL query plan.

Abstract: A method for inserting rows into a target table can include receiving a database command, the database command associated with a base table with at least one row to copy to a target table; receiving an indication that use of a BULK insert mode is feasible for the database command; based on the indication, and determining that an insert mode for the database command has been converted from a non-bulk insert mode to the BULK insert mode: reading a row from the base table; building the row read from the base table into an allocated row buffer; inserting the row into the target table in the BULK insert mode; and if it is determined that the allocated row buffer is full, updating at least one index in parallel with the inserting.