Abstract: Implementations generally relate to an editable table in a spreadsheet integrated with a web service. In some implementations, a method includes obtaining web service metadata from a web service. The method further includes determining one or more capabilities of the web service based on the web service metadata. The method further includes configuring a table component in a spreadsheet based on the one or more capabilities and the web service metadata. The method further includes retrieving data from the web service. The method further includes converting the data to a predetermined format. The method further includes tracking data changes in the spreadsheet based on user input. The method further includes sending the data changes from the spreadsheet to the web service.

Abstract: Techniques for managing object pools within computer storage are disclosed. In some embodiments, a runtime environment determines, for a respective object pool allocated in volatile or non-volatile storage of a computing system, whether a new object has been added to the respective object pool within a threshold timeframe. Responsive to determining that a new object has not been added to the respective object pool within the threshold timeframe, the runtime environment removes a subset of one or more objects from the respective object pool. In some embodiments, the runtime environment monitors a set of one or more garbage collection metrics. Responsive to determining that the set of one or more garbage collection metrics have satisfied one or more thresholds, the runtime environment identifies and removes idle objects from at least one object pool.

Abstract: A taint report represents a taint flow from a source value at a source program point to a sink value at a sink program point. Candidate watchpoints that correspond to taint-like values similar to the source value may be inferred from an execution trace. Different subsets of candidate watchpoints represent solutions to the problem of determining an optimal subset of watchpoints contributing to a taint flow. Using a hill-climbing heuristic, incremental improvements are efficiently applied to a solution until no more improvements are found. An objective function may determine whether one solution improves another solution. The objective function may be based on validity, understandability, and performance. Validity favors candidate watchpoints that reduce the edit distance between the source and sink values. Understandability favors candidate watchpoints included in a call chain from the source program point to the sink program point. Performance favors small subsets of candidate watchpoints.

Abstract: A system and associated processes to allocate tenants to platform resources are disclosed. A set of vectors corresponding to a plurality of tenants to be allocated is generated. A target vector establishing a desired value of a sum of vectors allocated to a first platform resource is determined. A first vector included in the set of vectors that satisfies a defined relationship with the target vector is identified, and a tenant corresponding to the first vector is allocated to the platform resource as a result. It is determined whether a second vector satisfies a defined relationship with both the target vector and the first vector exists. If so, a tenant corresponding to the second vector is allocated to the first platform resource. If not, the tenant corresponding to the second vector is allocated to a second platform resource, that is different from the first platform resource.

Abstract: The system obtains a multimodal dataset containing different types of data gathered during operation of the computer system, wherein the multimodal dataset includes time-series data for different variables associated with operation of the computer system. Next, the system forms a set of feature groups from the multimodal dataset, wherein each feature group comprises variables from the multimodal dataset containing the same type of data. The system then computes a tripoint similarity matrix for each feature group, and aggregates the tripoint similarity matrices for the feature groups to produce a crossmodal tripoint similarity matrix. Next, the system uses the crossmodal tripoint similarity matrix to cluster the multimodal dataset to form a model. The system then performs prognostic-surveillance operations on real-time multimodal data received from the computer system, wherein the prognostic-surveillance operations use the model as a classifier to detect anomalies.

Abstract: A method for managing multiple software defined wide area network (SD-WAN) software versions includes providing a controller that defines an overall configuration for an SD-WAN and that creates configuration registries for individual SD-WAN appliances to implement their respective portions of the overall configuration. The controller generates, in an intermediate configuration language registry format, a first and second configuration registry for first and second SD-WAN appliance that respectively execute first and second versions of SD-WAN software. The controller respectively transmits the first and second configuration registries to the first and second SD-WAN appliances, which use the first and second configuration registries to configure themselves. The first and second SD-WAN appliances negotiate with each other for common SD-WAN features usable to implement configurations specified in the first and second configuration registries.

Abstract: Systems and methods for intelligent distribution of integration artifacts and runtime requests across geographic regions. Integration Platforms as a Service (iPaaS) are generally networks that span multiple, distinct geographic regions, where customers or tenants can have provisioned a service instance in one or more of these regions. In order to take advantage of the infrastructure presented in an iPaaS system that spans multiple geographic regions (also referred to herein as “regions”) a connection configured in one service instance can be synchronized among other service instances in different regions.

Abstract: Systems, methods, and other embodiments are disclosed for partitioning models in a database. In one embodiment, a set of training data is parsed into multiple data partitions based on partition keys, where the data partitions are identified by the partition keys and are used for training data mining models. The multiple data partitions are analyzed to generate partition metrics data. Algorithm data, identifying at least one algorithm for processing the multiple data partitions, and resources data, identifying available modeling resources for processing the multiple data partitions, are read. The partition metrics data, the algorithm data, and the resources data are processed to generate an organization data structure. The organization data structure is configured to control distribution and processing of the multiple data partitions across the available modeling resources to generate a composite model object that includes a separately trained data mining model for each partition of the multiple partitions.

Abstract: Techniques are described for performing dependency locking to enable parallel execution of database server processes modifying the same object. In an embodiment, a DBMS receives a request to execute an operation on its managed database. The request may include an object identifier and a version identifier for a version of a database object, which is required for the successful execution of the operation on the database. The required version of the database object may not exist and may be generated only after the execution of another, second, operation on the database. The first database server process initiates execution of the earlier received operation on the database. The first database server process queries the first database for the version of the particular database object and determines that the version of the database object does not exist yet, in one embodiment.

Abstract: Techniques are provided herein for assigning pluggable database connections to thread groups. The techniques involve associating pluggable databases with thread groups. Each thread group is associated with a process running on a NUMA node. When a request for a connection for a pluggable database is received, the system determines which process on which NUMA node to spawn a thread for connecting to the pluggable database.

Abstract: Herein, horizontally scalable techniques efficiently configure machine learning algorithms for optimal accuracy and without informed inputs. In an embodiment, for each particular hyperparameter, and for each epoch, a computer processes the particular hyperparameter. An epoch explores one hyperparameter based on hyperparameter tuples. A respective score is calculated from each tuple. The tuple contains a distinct combination of values, each of which is contained in a value range of a distinct hyperparameter. All values of a tuple that belong to the particular hyperparameter are distinct. All values of a tuple that belong to other hyperparameters are held constant. The value range of the particular hyperparameter is narrowed based on an intersection point of a first line based on the scores and a second line based on the scores. A machine learning algorithm is optimally configured from repeatedly narrowed value ranges of hyperparameters. The configured algorithm is invoked to obtain a result.

Abstract: Systems and methods for supporting inter subnet control plane protocol for consistent multicast membership and connectivity across multiple subnets in a high performance computing environment. In accordance with an embodiment, by associating a multicast group with an inter-subnet partition, and enforcing a dedicated router port for the multicast group, multicast loop avoidance can be provided for between connected subnets. Because only a single router port is selected as being capable of handling the MC packet, no other router port in the subnet can then pass a multicast packet back to the originating subnet.

Abstract: In one approach, a method comprises receiving one or more higher-level instructions specifying to assign a value of a particular value type to a particular container of a plurality of containers, wherein the plurality of containers represent a data structure for maintaining one or more variables during execution of a block of code, wherein at least two containers of the plurality of containers are different sizes; generating one or more lower-level instructions that assign the value to the particular container based on applying one or more assignment rules to the one or more higher-level instructions based on the particular value type and executing the one or more lower-level instructions.

Abstract: Systems, methods, and other embodiments associated with website hosting are described. In one embodiment, a method includes maintaining a plurality of unpublished website versions that are available to assign as a live version of a website. The example method may also include selecting an unpublished website version from the plurality of unpublished website versions based upon an attribute of a request for the live version of the website satisfying a rule specifying that the unpublished website version is to be used as the live version of the website. The example method may also include reassigning the live version of the website from a current website version to the unpublished website version for the request. The example method may also include transmitting the unpublished website version as the live version of the website to the remote device over the network.

Abstract: Techniques are described for parallel processing of database queries with an inverse distribution function by a database management system (DBMS). To improve the execution time of a query with an inverse distribution function, the data set referenced in the inverse distribution function is range distributed among parallel processes that are spawned and managed by a query execution coordinator process (QC), in an embodiment. The parallel executing processes sort each range of the data set in parallel, while the QC determines the location(s) of inverse distribution function values based on the count of values in each range of the data set. The QC requests the parallel processes to produce to the next stage of parallel processes the values at the location(s) in the sorted ranges. The next stage of parallel processes computes the inverse distribution function based on the produced values.

Abstract: The present disclosure describes techniques for adding a marker to a second document, the marker corresponding to a marker in a first document. The process may include identifying a token in a first document associated with a marker based upon a location of the marker in the first document. The process may further include identifying a particular token group that the token belongs to. The particular token group may be identified from a set of token groups for the first document. A particular token group from a set of token groups for the second document is then identified for the particular token group in the first document. A location for placing the marker in the second document is identified based upon the location of the particular token group in the second document. The marker is then placed in the second document at the identified location.

Abstract: The disclosure is directed to approaches for combining server-side decisions based on user attributes and/or demographics with client-side decisions based on expressed or implied user interests determined based on the contents of a web page being visited by the user. A server is responsive to an occurrence of an operation of a client device at the web page. Processing steps determine particular executable web page content to send to the client device (e.g., where the particular executable web page content is determined in response to a particular client-side operation). The web page is rendered with the aforementioned executable web page content. Server-side processing receives messages that are emitted conditionally, based on the occurrence of a user event. An event log message comprises a portion of the web page, such as a string, indicating or implying user interest. A targeted advertisement is presented to the user based on the user interest.

Abstract: Techniques related to relational dictionaries are disclosed. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method involves storing a code dictionary comprising a set of tuples. The code dictionary is a database table defined by a database dictionary and comprises columns that are each defined by the database dictionary. The set of tuples maps a set of codes to a set of tokens. The set of tokens are stored in a column of unencoded database data. The method further involves generating encoded database data based on joining the unencoded database data with the set of tuples. Furthermore, the method involves generating decoding database data based on joining the encoded database data with the set of tuples.

Abstract: Implementations generally relate to initiating processes. In some implementations, a method includes receiving, at a server, an object from a client device. The method further includes determining an instance of a process initiation event, where the process initiation event triggers a process to initiate, and where the process initiation event is based on the object and one or more process initiation policies. The method further includes initiating the process upon the determining of the process initiation event.

Abstract: Techniques for user-assisted plug-in application recipe (PIAR) execution are disclosed. During execution of a PIAR, a PIAR management application applies one or more data values for a plug-in application field to a machine learning model, to obtain: (a) a candidate mapping between one or more sub-values discovered within the data value(s) and another field accepted by an action of another plug-in application, the data value(s) being of a data type different from a reported data type of the other field, and (b) a confidence metric associated with the candidate mapping, based at least in part on whether the sub-value(s) fit(s) one or more stored formats mapped to the other data type. Based on a determination that the confidence metric does not satisfy a threshold confidence criterion, the PIAR management application obtains user input affirming or rejecting the candidate mapping, and applies the user input to execution of the PIAR.

Abstract: Described herein are systems and methods for supporting SQL-based rich queries in a blockchain fabric. In accordance with an embodiment, the systems and methods provided herein provide the ability to execute SQL queries to allow for the creation of complex smart contracts much easier and more maintainable manner. Also, performance is improved both by pushing the data filtering back to the storage engine (rather than happening at the smart contract level), and by being able to rely on relational engines which support concurrent read and write data access. As well, the state of the world database can also provide for concurrent read/write access.

Abstract: Techniques are described herein for analyzing data streams in conjunction with relational database data in a DBMS. A database dictionary defines one or more columns for an external table and a data source for said external table that comprises an external message stream. Executing a query that targets the external table includes generating one or more rows from the external table, each row corresponding to a message in the external message stream that was retrieved from the external message stream after a message stream offset.

Abstract: A data object has a lock and a condition indicator associated with it. Based at least partly on detecting a first setting of the condition indicator, a reader stores an indication that the reader has obtained read access to the data object in an element of a readers structure and reads the data object without acquiring the lock. A writer detects the first setting and replaces it with a second setting, indicating that the lock is to be acquired by readers before reading the data object. Prior to performing a write on the data object, the writer verifies that one or more elements of the readers structure have been cleared.

Abstract: Systems and methods for supporting SMA level abstractions at router ports for inter-subnet exchange of management information in a high performance computing environment. In accordance with an embodiment, a subnet manager in a local subnet is responsible for establishing and configuring a remote attribute a switch having a switch port configured as a router port. This remote attribute can comprise certain information about the local subnet, including connectivity information and port status information. On receiving a query from a remote subnet manager, via a SMP (or a vendor specific SMP), information contained in the remote attribute can be communicated back to the remote subnet manager.

Abstract: Embodiments include systems and methods for cross-domain tracking of online wireless device activity to provide context aware mobile services. A request to access a first website can be received from a wireless device at a web server such that a first product or service is viewed, wherein code that comprises an identifier is stored on the wireless device. A request to access a second website can be received, wherein the wireless device is configured to access the second website in response to a notification from a wireless beacon associated with a physical storefront. The web server can then retrieve the identifier from the wireless device and retrieve an online activity history for the wireless device based on the identifier. Information associated with the storefront and first product or service can be transmitted to the wireless device.

Abstract: Innovative techniques are disclosed for performing a combined sort and aggregation operation involving eagerly performing aggregation while sorting. The techniques described herein enable an aggregation and a group-by operation to be performed using an amount of system memory that is far less than the system memory required to store all the data records being processed while minimizing the need to spill data to disk. This combined sort and aggregation operation has better performance than conventional techniques since system memory is used more efficiently. In certain embodiments, a combined sort and aggregation operation is disclosed that enables the efficient sorting and aggregation of data records when the desired aggregation function is composable (such as SUM, COUNT, MIN and MAX aggregate operations).

Abstract: Techniques for maintaining d-heap property and speeding up retrieval operations, such as top or pop, by vectorizing the d-heap and utilizing horizontal aggregation SIMD instructions across the retrieval operations. A d-heap is vectorized by storing it in a contiguous memory array containing a beginning-most side and end-most side. Horizontal aggregation SIMD instructions are utilized to aggregate the values of the vectorized d-heap. Thus, the number of comparisons required in order to find the maximum or minimum key value within a single node of the d-heap is reduced resulting in faster retrieval operations.

Abstract: In accordance with an embodiment, described herein is a system and method for database replication benchmark testing. The system can include one or more microservices configured to collect performance metrics from a testing environment, and a plurality of workload configurations that define different types of pipelines. Each pipeline can be used to execute a workload, and use different techniques to handle errors during the execution of the pipeline. A pipeline control manager can receive a workload configuration, and identify a pipeline defined therein. The pipeline control manager can invoke the one or more microservices to collect performance metrics from the testing environment, and use the collected performance metrics to validate the testing environment before starting the workload. Performance metrics from each pipeline stage can be consolidated and displayed at a user interface. The system can automatically select a workload configuration based on a replication feature to be tested.

Abstract: A system for simulating a dataset based on sample statistics, and generating pipeline instructions for a database using the simulated dataset, is disclosed. The system may be a cloud-based platform. The system can provide improved performance and security while designing and deploying Extract-Transform-Load (ETL) database pipelines to manage on-premises data. The system receives, from a remote client, sample statistics characterizing a distribution of data corresponding to a column of a database table. The system can generate, based on the received sample statistics, a simulated dataset representing the column of the database table. The simulated dataset may be generated using pseudo-random data values from a distribution with statistics matching the sample statistics. The system can build a simulated database relation based at least in part on the simulated dataset. The system can generate and deploy pipeline instructions using the simulated database relation.

Abstract: A defect level for a software application may be predicted by training a model using aspects of development processes from previous software applications as training data. Aspects of previous software development processes may be aggregated to form signal vectors for each deployed application. Defect scores calculated from actual defects in the deployed software applications may be paired with the corresponding development signal vectors. The signal vectors and calculated defect scores may act as training data and labels for a predictive model that uses lasso regression to generate a predicted defect score during the development process. A signal vector for a current development process may be updated in real time as the software is developed to update a predicted defect score and provide a subset of aspects in the signal vector that contribute most to the score such that actions may be taken to improve the score.

Abstract: Disclosed is a system, method, and computer program product for analyzing sets of data in an efficient manner, such that analytics can be effectively performed over that data. Classification operations can be performed to generate groups of similar log records. This permits classification of the log records in a cohesive and informative manner.

Abstract: The present disclosure describes systems and methods for enhancing the space utilization of storing keys in hierarchical data structures, such as B+Tree leaf blocks, by partially or fully compressing the keys. Partially compressing the keys may include storing certain keys as offsets from a start key. Fully compressing the keys may include setting a “type” value included in the header of the leaf block to a value indicating that the keys are implicitly represented by an ordinal key index, which defines the ordinal arrangement of keys in the leaf block. Partially or fully compressing keys, according to the implementations described herein, reduces the amount of space needed to store keys in a leaf block of a B+Tree.

Abstract: Systems, devices, and methods of the present invention involve discourse trees. In some aspects, a system creates a discourse tree by identifying elementary discourse units in text. The discourse tree includes nodes, each nonterminal node representing a rhetorical relationship between two elementary discourse units and each terminal node associated with an elementary discourse unit. The system identifies, in a reference sentence of the discourse tree, a rhetorical relation of type elaboration or joint. The system selects a candidate sentence having a highest syntactic generalization score of a set of syntactic generalization scores. The system identifies a semantic relation corresponding to the candidate sentence. The semantic relation corresponds to a word in the candidate sentence and defines a role in the candidate sentence.

Abstract: The present disclosure relates to a system and techniques for enabling migration of data between data storage devices without disruption to an application that relies upon the data. In some embodiments, this may involve the insertion of a redirect command into a mutation log. Upon receiving a transaction that relates to a data value, a transactor host may access the mutation log. Upon detecting the redirect command, the transactor host may generate a new mutation log in a second memory location which includes a reference to the mutation log. New mutations generated by the mutation log are then written to the new mutation log.

Abstract: The present disclosure relates to a system and techniques for enabling data to be updated within a data store through concurrent operations. Embodiments of the system enables multiple client applications (e.g., implemented on a cloud platform) to update data concurrently. In some embodiments, operations may be determined to be either client-managed operations or service-managed operations. Client-managed operations may be performed by a client application, whereas the client application may pass service-managed operations to a service application. The service application may put each of the service-managed operations into a commit queue wherein each service-managed operation is committed only after the one put into the queue before it has been committed.

Abstract: An event recommendation system recommends events for a candidate attendee. The system recommends an event based on characteristics of the candidate attendee and characteristics of prior attendees that attended a prior occurrence of the event. A prior attendee may have a positive or negative experience with the prior occurrence of the event. A positive experience may be defined, for example, as enjoying the event, completing the event, or performing well in the event. A negative experience may be defined, for example, as not enjoying the event, not completing the event, or not performing well in the event. An event is recommended to a candidate attendee if the candidate attendee has similar characteristics to a prior attendee that had a positive experience. An event is not recommended to a candidate attendee if the candidate attendee has similar characteristics as a prior attendee that had a negative experience.

Abstract: Implementations include a method and system configured to First information is collected during the processing of a flow process integration in the known environment while applying a stress test to a first service and recording the processing as a data recording. The data recording is analyzed to determine a nodal structure of the flow process integration instance. An updated version of the data recording with a second service that is modified is received. The updated version of the data recording is processed in the known environment. Second information pertaining to errors and anomalies associated with the updated version is collected while traversing the nodal structure during the processing of the updated version of the data recording in the known environment. The first information with the second information are compared to determine whether the errors and the anomalies are within an error threshold.

Abstract: The present disclosure relates to techniques for analysis of data from multiple different data sources to determine similarity amongst the datasets. Determining a similarity between datasets may be useful for downstream processing of those datasets for different uses. A graphical interface may be provided to display detailed results including: a similarity prediction, data similarity prediction, column order similarity prediction, document type similarity prediction, prediction of overlapping or related columns, orphaned column prediction (e.g., a left orphaned column or a right orphaned column).

Abstract: A system and method for facilitating automatically adjusting a user interface display screen or portion thereof. An example method includes determining context information associated with data, wherein the data is maintained in accordance with a data model; generating a signal when the context information changes; and employing the signal to automatically configure one or more characteristics of a user interface architecture, resulting in an adjusted user interface architecture. The context information may include information specifying one or more attributes relating to the data model. Generating may further include analyzing the one or more attributes to determine a modification to be made to the user interface architecture and then rendering a user interface display screen based on a modified user interface architecture.

Abstract: A method may include determining that a source variable in code receives a source value from a source function specified by a target analysis, determining that a source statement in the code writes, using the source variable, the source value to a column in a table, obtaining, for a sink statement in the code, a set of influenced variables influenced by the source variable, determining that the sink statement reads the source value into a sink variable including an identifier of the column, generating a modified set of influenced variables by adding the sink variable to the set of influenced variables, and reporting a defect at the sink statement.

Abstract: Systems and methods that substantially or fully remove a commanding server from a data path (e.g., as part of a data migration, disaster recovery, and/or the like) to improve data movement performance and make additional bandwidth available for other system processes and the like. Broadly, a network interface card (e.g., host bus adapter (HBA)) of a tape drive may be configured in both a target mode to allow the tape drive to be a recipient of control commands from a server to request and/or otherwise obtain data from one or more source tape drives, and in an initiator mode to allow the tape drive to send commands to the one or more tape drives specified in the commands received from the server to request/read data from and/or write data to such one or more tape drives.

Abstract: Embodiments include a multi-tenant cloud system with a first data center and a second remote data center. The first data center authenticates a first client and stores resources that correspond to the first client, and is in communication with the second data center. The second data center authenticates the first client and replicates the resources. The first data center receives a write request for the first client, writes the write request and generates change event messages in a first order. The first data center pushes the change event messages to the second data center via REST API calls. In response to receiving the change event messages, the second data center is configured to write the change event messages in the first order to its local database.

Abstract: A new and improved onboarding process for configuring and activating an email message receiving system (EMRS) to accept and process email messages on behalf of a customer is disclosed. The process comprises generating a customer-account-specific Domain Name Server (DNS) name that identifies a customer of the EMRS and a mail server for accepting and processing email messages for a domain associated with the customer. The process includes providing the customer-account-specific DNS name to the customer, receiving a request to process email messages for the domain associated with the customer and identifying using the customer-account-specific DNS name, the mail server for receiving the email messages for the domain. The process further includes verifying, using the customer-account-specific DNS name, that the customer has permission for receiving the email messages for the domain. The process includes processing the email messages and delivering the messages to a destination system.

Abstract: Techniques for system recovery using a failover processor are disclosed. A first processor, with a first instruction set, is configured to execute operations of a first type; and a second processor, with a second instruction set different from the first instruction set, is configured to execute operations of a second type. A determination is made that the second processor has failed to execute at least one operation of the second type within a particular period of time. Responsive to determining that the second processor has failed to execute at least one operation of the second type within the particular period of time, the first processor is configured to execute both the operations of the first type and the operations of the second type.

Abstract: A distributed computing environment is provided with a system and method for supporting rare copy-on-write data access. The system operates a data structure in a read only pattern suitable for serving a plurality of read requests with reduced overhead. The system, upon receiving a write request, creates a copy of data to execute the write request. The system defers writing the mutated data back to the read-only data structure. The system thus allows for multiple mutations to be made to the copy of the data using a read/write access pattern. After a number of read-only requests are received, the mutated data is written back to the read-only data structure. A monitor counts read and write requests in order to reduce overall read/write overhead and enhance performance of the distributed data grid.

Abstract: Techniques describes herein include using software tools and feature vector comparisons to analyze and recommend images, text content, and other relevant media content from a content repository. A digital content recommendation tool may communicate with a number of back-end services and content repositories to analyze text and/or visual input, extract keywords or topics from the input, classify and tag the input content, and store the classified/tagged content in one or more content repositories. Input text and/or input images may be converted into vectors within a multi-dimensional vector space, and compared to a plurality of feature vectors within a vector space to identify relevant content items within a content repository. Such comparisons may include exhaustive deep searches and/or efficient tag-based filtered searches. Relevant content items (e.g., images, audio and/or video clips, links to related articles, etc.

Abstract: Provided are systems and methods for a cloud security system that learns patterns of user behavior and uses the patterns to detect anomalous behavior in a network. Techniques discussed herein include obtaining activity data from a service provider system. The activity data describes actions performed during use of a cloud service over a period of time. A pattern corresponding to a series of actions performed over a subset of time can be identified. The pattern can be added a model associated with the cloud service. The model represents usage of the cloud service by the one or more users. Additional activity data can be obtained from the service provider system. Using the model, a set of actions can be identified in the additional activity data that do not correspond to the model. The set of actions and an indicator that identifies the set of actions as anomalous can be output.

Abstract: An existing package definition that statically accesses data sources may be used to generate a new definition of the package that dynamically selects between available data sources at runtime. Read-only operations in the new package can be replaced with parameterized views that select between data sources using a session variable. Data manipulation code in the existing package definition can be moved from the package to a new object type. The new definition of the package may keep the same public interface, but the function/procedure definitions can call corresponding functions/procedures in the new object type. Data manipulation code in these functions in the object can be moved to new member functions that separate data manipulation code from data processing code. Child object types can be defined for each data source that override these member functions to access different data sources.

Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.