Abstract: Partition-aware calculation of a window operator can be supported. Different nodes can calculate window function sub-results on database partitions locally, in parallel and independently. Recognition of scenarios in which such parallelism is permissible can be performed. Overall superior performance can result.

Abstract: Systems and methods for receiving cellular network data including a plurality of device identifiers and, for each of the plurality of device identifiers, determining a first cell border crossing associated with a device identifier, determining a second cell border crossing associated with the device identifier, determining a speed of movement of the device associated with the device identifier between the first cell border crossing and the second cell border crossing, determining, based on the speed of movement of the device, that a movement transition for the device associated with the device identifier has occurred between a first movement category and a second movement category, and storing movement data related to the movement transition and associated with a location of the device associated with the device identifier.

Abstract: A method and system for efficient allocation of numbers in a non-contiguous list using gap values are disclosed. A server system receives a request for one or more numbers. The server system loads an original list of previously allocated numbers into an indexed data structure. The server system generates gap values for the original list of previously allocated numbers in the indexed data structure. The server system uses the original list of previously allocated numbers as an initial current number list and determines whether there are one or more available numbers between a lowest number in the current number list and a highest number in the current number list based on the gap value. The server system then transmits one or more identified available numbers to the requesting system.

Abstract: A computer implemented method may include requesting details of an object and attachments associated with the object. The attachment details for each attachment may include an attachment name and an attachment ID. In response to a selection of an attachment associated with the object, a determination may be made as to whether a cache already includes the selected attachment. If the cache includes the selected attachment, the selected attachment may be retrieved from the attachment cache. If the cache does not include the selected attachment, the attachment may be downloaded using an attachment URL. The attachment URL may be requested and generated based on the attachment ID. The downloaded attachment may also be stored in the attachment cache.

Abstract: Various embodiments herein each include at least one of systems, methods, and software for server-side path reference. One server-side path reference embodiment in the form of a method includes receiving a request for a specific content item, such as a user interface or document, via a network interface device from a requestor. This method may then retrieve, from a navigation history data store, path reference recommendation data with regard to the specific content item. The retrieved path reference recommendation data typically identifies at least one destination most commonly navigated to from the specific content item within web application sessions. The method then transmits the retrieved path reference recommendation data with data of the specific content item to the requestor.

Abstract: A session transfer request is received from a cloud operating system, the session transfer request identifying a first active session and a second enhanced application server of a plurality of enhanced application servers. Then it is verified that cross user data containing information used by a plurality of sessions, including the first active session, is mapped to a first work process in a process pool of the cloud computing environment. Then a central dispatcher on the second enhanced application server is triggered to create a virtual context and a virtual machine corresponding to the first client device. When a subsequent user request is received from a first client device, the subsequent user request is sent to the central dispatcher of the second enhanced application server and the central dispatcher of the second enhanced application server is caused to roll-in the virtual context by attaching it to a free work process.

Abstract: Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance.

Abstract: Disclosed is a mechanism to process business object IDs in inbound and outbound processing. The mechanism takes into account a mapping table, matching capabilities, number ranges, inbound error and conflict handling, inbound processing, outbound processing, initial load, and data migration.

Abstract: A join operation between split data tables includes providing value IDs. For each of the value IDs, a unique global ID may be associated with the value ID when the actual value represented by the value ID occurs among actual values comprising the second attribute of the second partition. For each identified unique global ID, the identified unique global ID may be paired with a document ID of a data record contained in a second partition stored at the second server in which the actual value in the data record is represented by the value ID associated with the identified unique global ID.

Abstract: According to an aspect, a database system for integrating calculation models into execution plans includes a first engine configured to parse a query to be applied on a database. The first engine is configured to invoke a second engine during query compilation. The second engine is configured to instantiate a calculation model based on the query, and the second engine is configured to derive a converted calculation model by converting the calculation model into a format compatible with the first engine. The first engine is configured to incorporate the converted calculation model into an execution plan during the query compilation and execute the query on the database according to execution plan.

Abstract: The present disclosure relates to computer-implemented methods and computer systems for providing user-friendly and understandable presentations of Open Data (OData) Protocol resources through an automatic translation and modification process. The present disclosure provides a user interface tool for presenting and browsing OData fees that can provide a visualization of an OData feed structure to users in an otherwise unavailable format. In particular, developers can view and modify resources outside of the underlying format in which such OData feeds are traditionally presented. The user interface tool can provide an out-of-box user interface with which a developer can view and modify resources associated with a feed, browse related entity sets, set filters, and perform other operations. In essence, the user interface tool can decrease user's efforts and difficult in understanding particular OData feeds and the entities associated therewith.

Abstract: Technologies for performing garbage collection in database systems, such as multi-version concurrency control (MVCC) database systems, are described. For example, different garbage collection techniques can be used separately or in various combinations, including interval garbage collection, group garbage collection, table garbage collection, and combinations. For example, a particular type of combination, called hybrid garbage collection, uses technique from interval garbage collection and group garbage collection, or from interval, group, and table garbage collection.

Abstract: Technologies for performing garbage collection in database systems, such as multi-version concurrency control (MVCC) database systems, are described. For example, different garbage collection techniques can be used separately or in various combinations, including interval garbage collection, group garbage collection, table garbage collection, and combinations. For example, a particular type of combination, called hybrid garbage collection, uses technique from interval garbage collection and group garbage collection, or from interval, group, and table garbage collection.

Abstract: Technologies for performing garbage collection in database systems, such as multi-version concurrency control (MVCC) database systems, are described. For example, different garbage collection techniques can be used separately or in various combinations, including interval garbage collection, group garbage collection, table garbage collection, and combinations. For example, a particular type of combination, called hybrid garbage collection, uses technique from interval garbage collection and group garbage collection, or from interval, group, and table garbage collection.

Abstract: A target application loads target application's user interface (UI) after an initial preoperational task is completed. A task for visualizing a progress status for the target application is delegated to a source application that is used for launching the target application in a new window. The source application creates a shared object and assigns a unique identifier (ID) to the shared object. The unique ID of the shared object is passed to the target application, when the target application is launched from the source application. The shared object is accessed by the target application during the performance of the initial preoperational task. The target application stores progress status of the initial preoperational task in the shared object. The source application monitors the progress status stored in the shared object and presents it continuously on source application's user interface.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for receiving source code of an application, providing intermediate code based on the source code, the intermediate code including at least one instruction for profiling at least one object of the application, providing a statistics file by processing the intermediate code based on a memory profiling library, processing the statistics file based on a plurality of models to provide a list of objects, the list of objects identifying types of memory respective objects should be stored to in a hybrid main memory system, and storing modified source code that is provided based on the source code and the list of objects.

Abstract: A central processing unit (CPU) forming part of a computing device, initiates execution of code associated with each of a plurality of objects used by a worker thread. The CPU has an associated cache that is split into a plurality of slices. It is determined, by a cache slice allocation algorithm for each object, whether any of the slices will be exclusive to or shared by the object. Thereafter, for each object, any slices determined to be exclusive to the object are activated such that the object exclusively uses such slices and any slices determined to be shared by the object are activated such that the object shares or is configured to share such slices.

Abstract: Disclosed herein are technologies for implementing a Flexible Fare Bus framework to reduce bus bunching Particularly, the Flexible Fare Bus framework focuses on fixing a demand of passengers from passenger's side by dynamically adjusting a pre-determined headway-threshold throughout a pre-defined bus route. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: Particular embodiments provide a system that analyzes and optimizes roles and authorizations for users of a customer. The system determines which executables have been used by users in the system over a certain time period. Thereafter, the system analyzes and optimizes authorizations within the assigned roles for the users. The authorizations for the roles assigned to the user are then analyzed. The vendor roles typically have redundant authorizations, some of which may be used and some not used. The system can then generate a new customer role for the user with the used authorizations combined into the new role. For example, the authorizations used by the user are combined into the new customer role. This reduces the number of roles the user has assigned to him/her, and also the number of authorizations. Also, the new customer role may be added to other users with the same role at the customer.

Abstract: The present invention includes a database with a semantic layer for performing standard SQL and complex operations custom to one or more application. In one embodiment the present invention includes receiving a data request from an application in a database, the data request specifying standard SQL operations and custom application operations to be performed for said application. The data request is processed in a semantic layer of the database. The semantic layer processes the standard SQL operations and the custom application operations and generates a logical execution plan comprising the standard SQL operations and the custom application operations. The logical execution plan is converted into a physical execution plan, which is executed by the database to generate a data result. The data result may be sent back to the application.