Abstract: In one embodiment, a first selection of a data item in an interactive table is received. Further, one or more data items related to the first selected data item in the interactive table are identified. The interactive table is modified to render the data items identified as related to the first selected data item. Furthermore, a second selection of a data item within the data items identified as related to the first selected data item is received and one or more data items related to the second selected data item within the data items identified as related to the first selected data item are identified. Further, the previously modified interactive table is again modified to render the data items identified as related to the second selected data item.

Abstract: At runtime first and second cost functions associated with a request for a merge of a main partition of a table with a delta partition of the table can be calculated. The first and second cost functions can respectively quantify an urgency of the merge relative to availability of system resources required to perform the merge and an urgency of the merge relative to other merges. Determining whether the merge should occur can include comparing the calculated first and second cost functions with calculations of other first and second cost functions for other merge requests of one or more other tables. If the merge should occur, a merge thread can be assigned to execute the merge, and execution of the merge by the merge thread can be commenced if at least one merge token representing system resources usable for merge operations is available.

Abstract: In some example implementations, there is provided a method. The method may include generating a first page for presentation at a user interface, wherein the first page further comprises a first portion presenting one or more lines of code being developed and a toolbar portion, wherein the toolbar portion includes a comment element configured to generate a comment window and a propose change element configured to generate a change window; and receiving, in response to the generated first page, metadata including at least one of a comment and a proposed change associated with the one or more lines of code. Related systems, methods, and articles of manufacture are also provided.

Abstract: An extension node can be defined in a second layer of a software architecture for a first business object existing in a first layer and originally having an association with a second business object that is also in the first layer. The extension node can be defined to have an association with the second business object existing in a second layer of the software architecture. The association of the second business object can be altered from the first business object to the extension node so that at run time, metadata defining one or more nodes of the first business object and the extension node can be read from a metadata repository and a run time version of the first business object can be constructed at run time in a run time business object load based on the metadata.

Abstract: A system may include identification of a relation between a standards-compliant groupware object and one or more sequentially-updated content items, and creation of the groupware object. The groupware object may include a first Uniform Resource Identifier for subscribing a feed reader of a client device to a channel including the one or more sequentially-updated content items, and a second Uniform Resource Identifier to access a copy of the one or more sequentially-updated content items stored on the client device.

Abstract: First k log buffers, in a data storage application including a plurality of log buffers are each loaded with exactly one transaction. Each log buffer is written to one of a plurality of log partitions. Thereafter, each of the log buffers is sent to an input/output (I/O) subsystem when they are respectively loaded with a single transaction. Transactions are subsequently accumulated in respective new current log buffers after sending the k log buffers to the I/O subsystem. The accumulated transactions are sent to the I/O subsystem when the earlier occurs of (i) the respective current log buffer being full or (ii) a number of incomplete input/output requests handled by the I/O subsystem falls below k. Related apparatus, systems, techniques and articles are also described.

Abstract: Methods and systems for managing large write-once tables are described. In some embodiments, a relational database management system includes a space allocation module that utilizes both a logical space allocation scheme, as well as a physical space allocation scheme, to allocate space in units (e.g., pages) having two different sizes—small pages and big pages. For instance, small pages are logically allocated with a conventional converter module, which manages a converter table for mapping logical pages to physical pages, while big pages are physically allocated with an object directory manager, which manages big objects comprised of big pages.

Abstract: A downtime calculator for a computer network system has a downtime request module, a user activity computation engine, and a downtime computation engine. The downtime request module receives attributes of a downtime request for the computer network system. The user activity computation engine determines activities of the computer network system based on geographic regions and local times of users accessing the computer network system. The downtime computation engine calculates a recommended downtime of the computer network system based on the attributes of the downtime request and user activities on the computer network system.

Abstract: A scheduler may receive a plurality of jobs for scheduling of execution thereof on a plurality of computing nodes. An evaluation module may provide a common interface for each of a plurality of scheduling algorithms. An algorithm selector may utilize the evaluation module in conjunction with benchmark data for a plurality of jobs of varying types to associate one of the plurality of scheduling algorithms with each job type. A job comparator may compare a current job for scheduling against the benchmark data to determine a current job type of the current job. The evaluation module may further schedule the current job for execution on the plurality of computing nodes, based on the current job type and the associated scheduling algorithm.

Abstract: Techniques for systems, methods, and devices for providing on-demand enrichment data are disclosed. In response to user input, a client computing device executing a client application and plug-in for communicating with a data enrichment service, can generate a data enrichment command. The command can include selected report data from one or more reports or summaries displayed to a user on the client computing device. The command can also include information about the context in which data enrichment was requested. Using the information included in the command, an enrichment data service can determine the type of enrichment data that may be useful and the sources from which to request the enrichment data. The enrichment data can then be retrieved from one or more enrichment data sources and sent to the requesting client computing device to be displayed to the user in a manner that enriches the original reporting data.

Abstract: Copying data in a table from a source database to a target database is performed by copying the table into a conflicts schema. A first INSERT/SELECT statement is executed to copy data from the table. Then, in response to a determination that the table definition for the table in a source database dictionary is not compatible with a table definition for the table in a target database dictionary, the INSERT/SELECT statement execution is rolled back in response to a determination that the data from the first INSERT/SELECT statement did not fit in a table in the target schema of the target database. A second INSERT/SELECT statement is executed including a WHERE clause to copy data from the table to the target schema of the target database. In response to a determination that the second INSERT/SELECT statement did not copy data from the table to the target schema of the target database, a third INSERT/SELECT statement is executed forcing the data to fit.

Abstract: A multi-dimensional analytical view (MDAV) calculation can be enhanced by use of an in-memory MDAV runtime at a search engine server. The in-memory MDAV runtime can perform all or some of the processing required to respond to a data request that requires some analytical processing.

Abstract: A computer system including a database having a database table for storing records including first columns for storing data values, and at least one second column for storing keys identifying records stored in the database. The computer system also including a set of index tables with each having assigned thereto an index table identifier, an arrangement for receiving a query an arrangement for storing a predefined ordered sequence of index table identifiers, and an arrangement for processing the query by checking each one of the index tables for being relevant for the execution of the query, storing the index table identifier for each relevant index table in a query execution table, sorting the query execution table in accordance with the predefined ordered sequence, and executing the query using the index tables identified in the query execution table in the order given by the sorting of the query execution table.

Abstract: Runtime performance of report generation and other response to query requests can be improve using a report analyzer that can parse the query request and distribute the necessary analytical task among two or more analytical engines of varying levels of complexity.

Abstract: According to some embodiments, a system and method for a parallel join of relational data tables may be provided by calculating, by a plurality of concurrently executing execution threads, hash values for join columns of a first input table and a second input table; storing the calculated hash values in a set of disjoint thread-local hash maps for each of the first input table and the second input table; merging the set of thread-local hash maps of the first input table, by a second plurality of execution threads operating concurrently, to produce a set of merged hash maps; comparing each entry of the merged hash maps to each entry of the set of thread-local hash maps for the second input table to determine whether there is a match, according to a join type; and generating an output table including matches as determined by the comparing.

Abstract: A semantic layer (universe), which is created on a source database (DB), is migrated to a target DB. The migration includes pre-migration steps, actual migration and post-migration steps. The pre-migration steps prepare the target DB for the actual migration by configuring the target DB and determining the differences between the source DB and the target DB. During the actual migration, data, tables and views are migrated to the target DB conforming to the target database structure, functions and configuration. A new universe is created on the target database and all consumers of the source universe such as created reports are changed to refer to the new universe.

Abstract: Systems and methods are disclosed for developing a user interface. The method may include receiving a software development framework-independent data processing application of a consumption layer. A software development framework type may be received out of a plurality of supported software development framework types of a model layer. A plurality of object models adhering to the selected software development framework type may be displayed. A particular object model out of the plurality of object models may be received. A plurality of elements from the particular object model may be displayed for incorporation into the user interface. A selection of elements out of the plurality of elements may be received. The user interface may be generated, where the generating includes incorporating the selected elements for the software development framework-independent data processing application according to the particular object model of the selected software development framework type.

Abstract: A database language is extended to define constraints on a data model (e.g., entity-relationship model) rather than the concrete database. The constraints can be declarative (e.g., constraints that are defined using expressions of the database language) or programmatic (e.g., constraints that are defined as a stored procedure implemented in a domain specific language). By storing the constraints at a higher level than the database level, the constraints can be performed without changing the persistency of the database. Also disclosed are techniques for handling of constraints on partially loaded entities.

Abstract: Techniques for replicating data to a database include determining a change to at least one database value in a database table on a source repository; updating, based on the change to the at least one database value, a snapshot value associated with the change to the at least one database value stored in a log table; incrementing a commit value associated with the snapshot value stored in a commit table, the commit table comprising a plurality of commit values associated with a plurality of corresponding snapshot values; initiating replication of the database from the source repository to a target repository; determining a maximum commit value of the plurality of commit values; and replicating the database value in the database table from the source repository to the target repository based on the commit value associated with the snapshot value being less than or equal to the maximum commit value.

Abstract: Methods, systems, and computer-readable storage media for extending a knowledge base, implementations including receiving an enterprise service signature (ESS) associated with an enterprise service (ES), the ESS being stored in a computer-readable repository, segmenting the ESS to provide a segmented ESS, identifying one or more unknown terms from the segmented ESS, determining that at least one unknown term of the one or more unknown terms comprises at least one of a specialization and a new entity, and extending the knowledge base in view of the at least one of the specialization and the new entity.