Abstract: The present disclosure is directed to systems and methods including providing a data structure stored in computer-readable memory at a first location, monitoring a first work surface provided at the first location, determining that a first physical medium has been manipulated on the first work surface, and, in response, generating a first operation based on a manipulation of the first physical medium, applying the first operation to the data structure. Systems and methods can further include receiving operation and object data from a server system, the operation and object data corresponding to a second operation generated in response to manipulation of a second physical medium on a second work surface provided at a second location, applying the second operation to the data structure, processing the object data, and projecting a first virtual medium on the first work surface, the first virtual medium corresponding to the second physical medium.

Abstract: Methods, systems and computer-readable storage mediums encoded with computer programs executed by one or more processors for providing a compressed representation of a transaction token are disclosed. In an embodiment, a transaction token maintains statues of transaction to a database in a first data structure and a second data structure. The first data structure includes a plurality of identifiers respectively corresponding to the transactions to the database and a corresponding status of each identifier indicating whether a given transaction is open or closed, wherein the plurality of identifiers is maintained below a threshold number of identifiers. The second data structure includes a plurality of identifiers of transactions to the database beyond the threshold and whose status is open.

Abstract: Systems and methods are disclosed for accessing information content in a database environment using metadata. The method may include receiving search criteria for searching a plurality of database connections. Each of the plurality of database connections may be associated with analytics metadata. At least one of the plurality of database connections may be identified. The analytics metadata associated with the at least one of the plurality of database connections may meet the search criteria. The identified at least one of the plurality of database connections may be rated. The search criteria may include a keyword, and each of the plurality of database connections may include a database, a database query, or a data cube. The analytics metadata may include metadata associated with the database, the database query, the data cube, or an analytics report accessible using at least one of the plurality of database connections.

Abstract: Methods, systems and computer-readable storage mediums encoded with computer programs executed by one or more processors for providing a compressed representation of a transaction token are disclosed. In an embodiment, upon a receipt of a request for a write transaction at a slave server it is determined whether there exists an unassigned transaction identifier (TID) stored locally at the slave server as provided by a master server to the slave server prior to the receipt of the write request by the slave server. If there exists an unassigned TID at the slave server, the slave server is configured to assign the unassigned TID to the write transaction, otherwise the slave server is configured to request a plurality of unassigned TIDs from the master server, receive the plurality of unassigned TIDs, and assign one of the received unassigned TIDs to the write transaction. The write transaction is processed.

Abstract: A system, computer-implemented method, and a computer-readable storage medium for a traversal of a property graph, are provided. The edge table of the property graph is divided into a plurality of fragments. A first fragment is selected for traversal using a set of selected vertices, where the traversal identifies a set of edges. Based on the set of edges, a set of adjacent vertices is determined during the traversal. A set of discovered vertices in the property graph is determined based on the set of selected vertices and the set of adjacent vertices.

Abstract: Systems, methods and computer program product embodiments for providing a locking protocol for partitioned and distributed database tables are disclosed herein. A locking method includes executing, by at least one processor, a first database transaction on a second node, attempting to acquire and acquiring a lock on the second node in intentional exclusive mode, executing, by the at least one processor, a second database transaction on a first node, acquiring a lock on the first node in exclusive mode and waiting to acquire a lock on the second node in exclusive mode, routing, by the at least one processor, the first database transaction to the first node and unsuccessfully trying to acquire a lock on the first node and committing, by the at least one processor, the first database transaction.

Abstract: Disclosed herein are system, method, and computer program product embodiments for transforming data from a first version, for example an initial version of a database, to a second version, for example a subsequent version of a database. An embodiment operates by modifying the metadata of the data to include transformational clauses, each of which describes how a portion of the data in the first version is transformed to data required by the second version.

Abstract: System, method, and computer program product embodiments transform data from a first version, for example an initial version of a database, to a second version, for example a subsequent version of a database. An embodiment includes modifying the metadata of the data to include transformational clauses, each of which describes how a portion of the data in the first version is transformed to data in the second version. Another exemplary embodiment includes differentiating between rename and add/delete operations to reduce the amount of transformational clauses included in the metadata. For example, rename operations can be identified by ignoring commonly-named columns between two versions, and identifying columns where the name has changed between the two versions while the data type has not changed.

Abstract: Data replication in a database includes identifying a source database system. The source database includes a main index file and a delta log file. To create a replica, one or more symbolic links to the source database system are generated. The symbolic links identify a path to a physical location of the source database. A replica of the source database is generated based on the symbolic links. The replica includes a copy of the main index file and delta log file. Information associated with the replica and the symbolic links is stored in a recovery log. Replica are provided transparently to most database engine components by re-using partitioning infrastructure. Components “see” replica as tables with a single partition; that partition is a local replica.

Abstract: A system, computer-implemented method, and a computer-readable medium for determining why a query returns a null set in a database management system. When the database management system receives a query graph, database management system compares the query graph to the data graph. Based on the comparison, database management system identifies a discovered component of the query graph and a missing component of the query graph, wherein the missing query component indicates a reason for the null set.

Abstract: According to some embodiments, a method and apparatus are provided to receive a first application archive, create a generic view model based on the first application archive, and create a second application archive based on the generic view model.

Abstract: Disclosed herein are system, method, and computer program product embodiments for generating an optimal development infrastructure. An embodiment operates by decomposing a development process into one or more functional requirements, mapping each functional requirement of the decomposed development process to the one or more corresponding functional capabilities, and selecting one or more services operable to implement each mapped functional capability, wherein each service comprises one or more functional capabilities.

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: Aggregation of an in-memory database includes receiving, by at least one processor having a plurality of threads, input having records stored in random access memory, distributing, by the at least one processor, the input into portions, one of the plurality of threads having an assigned portion, aggregating, by the at least one processor, the records in the assigned portion based on locality of keys in the records and outputting, by the at least one processor, the aggregated records into a global hash table.

Abstract: A technique is described that simplifies the process for applying predictive analysis to a dataset. The technique can recommend multiple templates to a user. Each recommend template contains algorithms which can be applied to the dataset. When a template is selected, the technique can rank the available algorithms of the selected template based on factors such as values in the dataset, characteristics of the dataset, and the usage history of the dataset or the algorithms in prior instances. The technique can automatically select the highest ranked algorithm and apply it to the dataset. In some examples, input parameters used to configure the algorithm can also be automatically selected.

Abstract: A multi-tenant environment can support field extensibility via extension tables. An in-memory, columnar database can store a core table being extended as well as the corresponding extension table. Transactional and analytical processing can be performed on the extension fields. A business-objects-based system can take advantage of the technologies to provide greater flexibility, security, and performance improvements.

Abstract: The systems, methods and articles described herein are directed to a cloud based server which can access and retrieve data for dynamically calculating and generating information relating to an earthquake (or other hazard event), including damage and injury caused by the earthquake. In addition, the information relating to the earthquake can be distributed to one or more cloud connected vehicles and external sources, such as for either providing early warning or assistance with emergency response. Related apparatus, systems, techniques and articles are also described.

Abstract: Embodiments relate to view caching techniques that cache for a limited time, some of the (intermediate) results of a previous query execution, in order to avoid expensive re-computation of query results. Particular embodiments may utilize a cache manager to determine whether information relevant to a subsequent user request can be satisfied by an existing cache instance or view, or whether creation of an additional cache instance is appropriate. At design time, cache defining columns of a view are defined, with user input parameters automatically being cache defining. Cache instances are created for each tuple of literals for the cache defining columns, and for each explicit or implicit group by clause. Certain embodiments may feature enhanced reuse between cache instances, in order to limit memory footprint. Over time a cache instances may be evicted from memory based upon implementation of a policy such as a Least Recently Used (LRU) strategy.

Abstract: Disclosed herein are system, method, and computer program product embodiments for the auditable abrogation of columnar in-memory databases. An embodiment operates by retrieving column-oriented data of a column-oriented database associated with an auditing request to access the column-oriented data. The column-oriented data is transformed into corresponding row-oriented data and stored in a row-oriented database independent of the column-oriented database. A response to the auditing request is processed based on the row-oriented data, wherein the processing is performed independent of the column-oriented database, and the response is provided to the auditing request.

Abstract: Database data is unmasked in order to facilitate its efficient handling by a database engine. In response to a request for data of a masked table including a masked element, an engine identifies a mask interval, and then performs a first join with unmasked elements sharing a common key. The table resulting from this first join is then grouped according to a highest level location of the mask. A second join is then performed between the results of this grouping and the mask interval, to produce a corresponding unmasked table including a plurality of unmasked elements corresponding to the masked element. Unmasking according to embodiments may be particularly useful in leveraging processing power of an in-memory database engine, allowing it to efficiently perform batch processing of requests for masked data received from software of an overlying application layer.