Abstract: Techniques for managing parameterized continuous query templates are provided. In some examples, a continuous query may be generated based at least in part on one or more selections of one or more business logic templates and business event parameters associated with a user. The continuous query may also be configured to retrieve business event data of the user. In some examples, a service provider may receive selection of one or more business logic templates. The service provider may also receive the business event parameters associated with the user. The business event parameters may be received via the selected template. The continuous query may then be generated using the information received via the template.

Abstract: Aspects of the present disclosure provide a convenient user interface using which a user can identify and view electronic resources of interest. In an embodiment, the user enters a string for identifying a next resource to access. A first set of resource identifiers matching the string are determined, with each resource identifier being present in the content of a corresponding electronic resource previously accessed by said user. The identified first set of resources are listed on a display unit. Upon receiving a selection of one of the displayed electronic resources, the electronic resource is retrieved and the corresponding content is displayed on the display unit. In an embodiment, the user interface is provided as the user enters the search string in an address bar of a browser window. The resources previously accessed by the user using the browser application may also be displayed as a group.

Abstract: Managing versions of an electronic entity comprising many independently managed, but mutually-dependent, subcomponents can be challenging. File management functionality is provided for use with an integrated development environment to produce a visual indication of the relationships among the subcomponents. The approach described herein provides an improvement over source code control systems and backup systems in the ability to revert the state of one or more files as their content existed at an historical time point. The technique does not require a user to predict in advance at which time points the content state of one or more files will be interesting as historical time points for future use.

Abstract: An aspect of the present disclosure facilitates transferring data from multiple data sources to desired data targets. In one embodiment, meta-data specifying multiple use cases is maintained, with each use case indicating an import procedure and a corresponding condition to be satisfied by a set of import parameters such that the import procedure is executed for importing of data upon satisfaction of the corresponding condition. In response to receiving an import connector requesting transfer of data from data sources to data targets, a use case is selected having the condition which is satisfied by the respective values for the corresponding import parameters received in the import connector. The execution of the import procedure indicated by the selected use case is then initiated to import data from the data sources to the data targets.

Abstract: Disclosed are a system, method, and computer program product for a unified system for implementing clones. The unified system includes the appropriate infrastructure to create, maintain, and administer clones and supporting data sources in the computing environment. In addition, a user interface is provided that is capable of visually displaying relationships and lineages of sources and clones in the system. The user interface provides functionality to select any given object, and to trace its parent-child relationships to highlight its related parent and/or child source/clone.

Abstract: A method, system, and computer program product for shipping management. The computer implemented method commences upon identifying a set of orders to be shipped from a source region to a destination region using a transportation network, and determining candidate options for performing stops over possible routes between the source region and the destination region. A clustering analysis process is performed over the candidate options such that the clustering analysis considers many order consolidation possibilities while observing timing constraints. Low-cost options from among the candidate options are considered to identify one or more low-cost options, and a multi-stop route plan is generated to correspond to a selected low-cost option. The orders are shipped in accordance with the multi-stop route plan, and in accordance with the corresponding consolidation of the set of orders.

Abstract: The present disclosure provides a detailed description of techniques used in systems, methods, and in computer program products for building and operating a match cooperative without handling personally identifiable information. The various embodiments address the problem of discovering attributes pertaining to a particular user without sharing personally identifiable information pertaining to that particular user. More specifically, the claimed embodiments are directed to approaches for receiving online and offline PII and NPII associated with various users, obfuscating (e.g., hashing) the PII, and matching the obfuscated PII to the NPII based on various data (e.g., common attributes, etc.) and methods (e.g., deterministic matching, probabilistic matching, etc.). The matched NPII attributes can then be used to target the user associated with the obfuscated PII in online advertising campaigns.

Abstract: A system that directs a user to an object in response to a selection of a deep link uniform resource identifier (“URL”) that includes an identity of a web service, an object type and action, accesses a database table. The system uses the object type and the action as a first index key and a second index key of the database table to generate a query. In response to the query, the system retrieves additional parameters to append to the deep link URL to generate a full URL. The system then directs the user to the object that corresponds to the full URL.

Abstract: NUMA-aware reader-writer locks may leverage lock cohorting techniques that introduce a synthetic level into the lock hierarchy (e.g., one whose nodes do not correspond to the system topology). The synthetic level may include a global reader lock and a global writer lock. A writer thread may acquire a node-level writer lock, then the global writer lock, and then the top-level lock, after which it may access a critical section protected by the lock. The writer may release the lock (if an upper bound on consecutive writers has been met), or may pass the lock to another writer (on the same node or a different node, according to a fairness policy). A reader may acquire the global reader lock (whether or not node-level reader locks are present), and then the top-level lock. However, readers may only hold these locks long enough to increment reader counts associated with them.

Abstract: Techniques for configuring and generating an integrated application interface are disclosed. An interface for generating application metadata associating application components and component behaviors may be displayed to a user. The metadata generation interface accepts user input associating an action with an application component. The system generates application metadata, defining application behavior corresponding to the application component, based on the user input. The system may generate a platform interface that integrates the application behavior into a platform interface, based on the application metadata. The system determines behaviors of components of the application by analyzing the application metadata. Based on the application component behaviors, the system renders platform components of the platform interface to integrate the application behaviors into the platform interface.

Abstract: A method includes receiving a plurality of data sets. Each data set includes a customer identifier field specifying a unique customer identifier associated with each entry in each data set. The plurality of data sets includes a first group of data sets and a second group of data sets. The method further includes storing the plurality of data sets, and generating a key map including the customer identifier field including unique customer identifiers of the first group of data sets of the plurality of data sets, and an anonymous identifier field including unique anonymous identifiers. Each anonymous identifier corresponds to a customer identifier of the key map. The method further includes replacing each unique customer identifier in the second group of data sets with the corresponding anonymous identifier.

Abstract: Techniques are described herein for profiling mutual exclusion locks. In one or more embodiments, a performance profiler identifies a first thread executing an activity within a parallel processing environment. The performance profiler identifies a set of one or more mutual-exclusion locks held by the first thread while the activity is being executed and determines the total number of threads waiting for at least one of the set of mutual-exclusion locks held by the first thread. The performance profiler then determines a total cost associated with execution of the activity based at least on the total number of threads waiting for at least one of the set of mutual-exclusion locks held by the first thread during execution of the activity. In one or more embodiments, the total cost is obtained by multiplying a raw cost with the number of threads waiting.

Abstract: Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected.

Abstract: A method for self-learning adaptive routing can include receiving a contact along with a sequence of events from a customer via a graphical user interface on a web page within a browser window. A universal resource locator (“URL”) of the web page can be captured and mapped with the sequence of events to the contact. A matching routing rule can be used to route the contact to an appropriate customer service queue. An agent associated with the customer service queue can view a co-browsing preview of the customer's desktop, which the agent can use to transfer the contact to a different customer service queue. A machine learning algorithm can create a new routing rule based on the URL of the web page, the sequence of events, the co-browsing preview, the second routing, and the determination that the second agent associated with the second customer service queue resolved the contact.

Abstract: Methods and systems are described for allowing third party developers to add extensions to a cloud service provider's software as a service (SaaS) services by editing an ‘empty’ config file according to a schema provided by the cloud service provider to form a delta file and then merging the delta file with an internal, full version of the config file. The full config file is then used to initialize and instantiate objects upon a restart of the cloud provider's services.

Abstract: In accordance with an embodiment, described herein is a system and method for providing portable partitions in a multitenant application server environment. In accordance with an embodiment, the system enables a partition to be exported from first or source domain (e.g., a test domain), and imported into another second or target domain (e.g., a production domain). During creation or export of a partition archive, the partition archive is created which includes a partition configuration, resource group or resource group template information, and optionally application binaries. The partition archive can also include an interface that allows access to exportable or configurable values associated with the partition. During deployment or import of the partition archive to the target domain, the information in the partition archive, including the exportable or configurable values associated with the partition, are used to configure the partition for use in the target domain.

Abstract: Embodiments are directed to automatic layout organization where various visualizations within a canvas layout can be dynamically rearranged or modified in dimension upon a user specified modification to maximize usability. Some embodiments display a graphical user interface (GUI) including multiple components in a display area, where each component has one or more initial dimensions. In response to an event, embodiments can determine an edge corresponding to the event. Some embodiments determine a box based on the edge, the box enclosing a portion of the display area that is less than the entire display area. Certain embodiments determine a set of components corresponding to the box, the set of components being fewer than all of the components. Embodiments may redraw the GUI such that the set of components is redrawn, where a dimension of each component of the set of components is different from an initial dimension of the component.

Abstract: A method and apparatus are described for summarizing a document. For each node in the document that satisfies a marking criteria, a start and end mark pair is stored in a summary in document order. The start mark specifies a location in the document where the node starts, and the end mark specifies a location in the document where the node ends. When evaluating a query for a hierarchical path, the document is streamed into memory until the mark of a tag matches a start mark in the summary. If that tag does not fit within the path, then streaming of the document may resume at the end mark, thereby skipping the node during streaming evaluation. Translation information may be used to indicate a logical position relative to the marks in the summary when the document is modified.

Abstract: A method is provided for making an embossing drum that is useable to emboss tape media. The method includes assembling together multiple stamper plates that each have embossing features for embossing tape media, and the stamper plates include at least one first plate and at least one second plate. Furthermore, the embossing features of each first plate are inverted with respect to the embossing features of each second plate.

Abstract: In accordance with embodiments of the invention, a set of Microinstructions define a set of primitives or instructions to execute a business process modeling language in accordance with the semantics defined by the language. The Microinstructions define atomic operations that can be executed as part of a running process. The Microinstructions can be combined into Microprograms which map to business processes of the business process modeling language, for example BPMN. The Microprograms can be compiled using a suitable compiler into any execution language. The Microinstructions thereby provide flexibility for executing business process modeling languages in any business process execution language.

Abstract: The concepts described herein include a storage access system including two access paths using different path configurations resulting in the ability to do a two part boot from the same boot memory. The two storage access paths address the boot memory using a globally unique identifier. The first storage path is a slower path that transfers a instructions from the boot memory to configure the second storage path used to transfer the operating system from the boot memory.

Abstract: A power distribution discovery system includes a power distribution unit (power distribution unit) that provides electrical power to a plurality of equipment modules configured in a computing rack. The power distribution unit includes a first communication circuit coupled to a computing system. The first communication circuit communicates with a second communication circuit configured in each of the subset of equipment modules to receive identifying information associated with each of the subset of equipment modules. The computing system communicates with the first communication circuit to receive the identifying information, and outputs a report indicating the subset of equipment modules that receive electrical power from the power distribution unit. The received identifying information indicates those equipment modules that receive electrical power from the power distribution unit.

Abstract: Techniques for visualizing data elements are disclosed. A system presents a first data element profile comprising: a first data element; a second data element; and a first formula used to calculate a value of the first data element using a value of the second data element. The system detects user input selecting the second data element. Based on detecting the user input, the system presents a second data element profile comprising: the second data element; a third data element; and a second formula used to calculate a value of the second data element using a value of the third data element. The system detects user input selecting the third data element. Based on detecting the user input, the system presents a third data element profile comprising the third data element.

Abstract: Techniques for a resource management advice service are provided. In some examples, resource management advice and/or instructions may be provided for use with mobile devices, mobile applications, cloud applications, and/or other web-based applications. For example a mobile client may request to perform one or more resource management operations associated with a service provider. Based at least in part on the requested operation and/or the particular service provider, advice and/or instructions for managing the resource may be provided.

Abstract: A magnetic recording head positioning assembly includes a coarse travel carriage secured to and spaced away from each of a front end assembly and head assembly via sandwiched fine guiding flexures and isolation flexures. The fine guiding flexures permit relative movement between the coarse travel carriage and head assembly. The isolation flexures permit relative movement between the coarse travel carriage and front end assembly. The fine guiding and isolation flexures thus isolate the coarse travel carriage from the front end assembly and head assembly. The assembly further includes dampers sandwiched between the coarse travel carriage and isolation flexures to limit movement of the isolation flexures.

Abstract: A method of quantifying resolution times through external networks includes receiving, from an external network, a transmission indicating an incident. The transmission includes a first time at which an indication of the incident was posted to the external network. The method may also include generating an incident record associated with the incident, submitting the incident record to an incident management process to resolve the incident, and receiving an indication that the incident is resolved. The method may additionally include submitting a request to the external network to post the indication that the incident is resolved, and receiving, from the external network, a second time at which the indication that the incident is resolved was posted by the external network.

Abstract: A method and apparatus for generating logical frames from arbitrating among packets is disclosed. An integrated circuit (IC) includes an arbitration circuit configured to generate a logical frame having a first number of bytes by selecting at least one a plurality of packets received from different functional circuit blocks. At least one of the plurality of packets is of a different data size than at least one other one of the plurality of packets. The arbitration circuit is configured to, when selecting two or more of the plurality of packets, generate the logical frame by concatenating selected packets together. The IC further includes a framing circuit configured to generate, based on the logical frame, a physical frame for an outgoing transmission over a serial communications link, wherein the physical frame comprises a second number of bytes that is less than or equal to the first number of bytes.

Abstract: Utilities (e.g., systems, apparatuses, methods) that reduce robotic assembly contention in media element storage libraries by rotating (e.g., flipping, swinging, etc.) a robot arm of a first robotic assembly mounted over a first of first and second spaced storage arrays in a storage library into a first position between the first storage array and a central reference plane disposed between and parallel to the first and second storage arrays to allow a robot arm of a second robotic assembly to slide or otherwise move past the robot arm of the first robotic assembly (e.g., in a direction along or parallel to an x-axis parallel to the first and second storage arrays), even when the robot arms of the first and second robotic assemblies are disposed at the same height (e.g., along a z-axis that is perpendicular to the x-axis) within the storage library.

Abstract: A method and system for fast file initialization is provided. An initialization request to create or extend a file is received. The initialization request comprises or identifies file template metadata. A set of allocation units are allocated, the set of allocation units comprising at least one allocation unit for the file on a primary storage medium without initializing at least a portion of the file on the primary storage medium. The file template metadata is stored in a cache. The cache resides in at least one of volatile memory and persistent flash storage. A second request is received corresponding to a particular allocation unit of the set of allocation units. Particular file template metadata associated with the particular allocation unit is obtained. In response to the second request, at least a portion of a new allocation unit is generated.

Abstract: A system for atomic file transfer operations over connectionless network protocols includes a processor and a memory coupled to the processor. The memory contains program instructions executable by the processor to implement an operating system including a system call interface for sending one or more data files to another system over a network via a connectionless network protocol. In response to an invocation of the system call by an application, the operating system is configured to send the one or more data files to the other system over the network without the application copying contents of the data files into application address space.

Abstract: A system and method for supporting load balancing in a multi-tenant cluster environment, in accordance with an embodiment. One or more tenants can be supported and each associated with a partition, which are each in turn associated with one or more end nodes. The method can provide a plurality of switches, the plurality of switches comprising a plurality of leaf switches and at least one switch at another level, wherein each of the plurality of switches comprise at least one port. The method can assign each node a weight parameter, and based upon this parameter, the method can route the plurality of end nodes within the multi-tenant cluster environment, wherein the routing attempts to preserve partition isolation.

Abstract: A method for remote authentication dial-in user service (RADIUS) topology hiding includes, at a RADIUS signaling router including at least one message processor, receiving a RADIUS message. The method further includes determining whether RADIUS topology hiding is indicated for the RADIUS message. The method further includes, in response to determining that RADIUS topology hiding is indicated for the message, performing RADIUS topology hiding for the message. The method further includes forwarding the message to an intended recipient.

Abstract: In a technology stack including members provided in communication, a system and method are provided for managing keys for use in encrypting and decrypting data. The system comprises a key manager configured to define a group of members and to create at least one encryption key associated with the defined group, and a communications manager configured to transmit the at least one encryption key associated with the group to members in the group. Data encrypted by a member in the group using the at least one encryption key received by the member from the communications manager is transmitted to another member in the group for decryption using the at least one encryption key received by the another member from the communications manager.

Abstract: A system includes a resource adapter module in the form of executable code by a processor, the resource adapter module to, interact with an application running on an application server by receiving calls from applications, and provide communication between the application and any JMS provider by relaying the calls to the JMS provider.

Abstract: Systems and methods are provided for supporting efficient reconfiguration of an interconnection network having a pre-existing routing comprising. An exemplary method can provide, a plurality of switches, the plurality switches comprising at least one leaf switch, wherein each of the one or more switches comprise a plurality of ports, and a plurality of end nodes, wherein the plurality of end nodes are interconnected via the one or more switches. The method can detect, by a subnet manager, a reconfiguration triggering event. The method can compute, by the subnet manager, a new routing for the interconnection network, wherein the computing by the subnet manager of the new routing for the interconnection network takes into consideration the pre-existing routing and selects the new routing for the interconnection network that is closest to the pre-existing routing. The method can reconfigure the interconnection network according to the new routing.

Abstract: A method and apparatus for logical-physical frame conversion in a serial link application is disclosed. An integrated circuit (IC) includes a serializer-deserializer (SERDES) coupled to a communications link and configured to convert outgoing data transmissions from parallel to serial and convert incoming data transmissions from serial to parallel. A framing unit is coupled to the SERDES and configured to convert data between a logical frame format for parallel transfer and a physical frame format for serial transfer over the communications link. The logical frame has a first number of bytes and the physical frame has a second number of bytes less than or equal to the first number. The first number is variable and the second number is fixed. The framing unit is further configured to convert data between the logical frame format and the physical frame format when the first number is a non-integral power of two.

Abstract: Software such as operating system software, firmware, and other software components may be installed onto target servers in private computer networks. In some embodiments, virtual machines and/or virtual machine images including guest operating systems and automated installation (AI) components, may be generated and configured to perform software installations onto target servers. For example, a virtual machine generator may be configured to create, install, and configure new virtual machines with specifications based on one or more target devices in a private network. An installation device in communication with the private network may store and/or execute the customized virtual machines to perform software installations onto target devices within the private network.

Abstract: Techniques are disclosed for generating a GUI model for an application based upon requirements information for an application. The requirements information may include an image of a GUI screen (or multiple images of multiple screens) included in the GUI for the application. The GUI model generated based upon the input image may include information about the type and placement (layout) of GUI components in the GUI screen, and may also include information indicative of one or more functions to be assigned to one or more of the GUI components in the GUI screen. The GUI model may then be used to generate an implementation of the application GUI, including generating executable code that implements the GUI screen.

Abstract: Techniques are disclosed for automating application development from requirements information for the application. The requirements information may comprise mockup images of GUI screens for the application, text information, and other information. A model is generated based upon the requirements information. The generated model can then subsequently be used to generate one or more implementations of the application. Generation of the model includes processing the requirements information to identify one or more data objects to be mapped or associated with one or more GUI screens of the application, and further determining, for a particular data object mapped to a particular GUI screen, mappings between one or more components of the particular screen to one or more components of the particular data object. The model stores information about the look-and-feel of the GUI screens and about mappings between data objects to screens and screen components to data object components.

Abstract: A virtual storage network may be implemented and exposed as a single virtual namespace, using physical disk storage distributed across multiple computing devices. In various embodiments, each computing device contributing physical disk storage to the virtual storage network may include one or more virtual block devices configured to provide a local interface to the virtual storage network, an application programming interface (API) or other software components to translate the local data access requests into tuple-space operations compatible with the tuple-space data model, and/or a tuple-space storage engine configured to provide access to the data tuple-space of the distributed virtual storage network.

Abstract: A method of executing processor-specific code to include board-specific optimizations in a Unified Extensible Firmware Interface (UEFI) may include executing first instructions that are specific to a processor, where the first instructions may be executed within a UEFI firmware routine. The method may also include detecting a portion of the first instructions that requires information to be processed or provided by second instructions, where the second instructions may be specific to a circuit board on which the processor is installed. The method may further include sending, through an intermediate dispatch function, a request for the information to be processed or provided by the second instructions, where the intermediate dispatch function can decouple the first instructions from the second instructions.

Abstract: In accordance with an embodiment, described herein is a system and method for supporting web services in a multitenant application server environment. The system includes a domain with a plurality of partitions, wherein each partition can include one or more web services, and a web services inspection language (WSIL) application. A partition-aware managed bean server can include managed beans for generating addresses of web services deployed to each partition, wherein the generated addresses can be retrieved by the WSIL application in that partition for use by clients in accessing the web services. The system can further include a web service security manager that can secure web services in each partition, by attaching security policies to each web service endpoint and enforcing the security policies on requests directed to that web service endpoint.

Abstract: A distributed order orchestration is provided. The system comprises a decomposition layer configured to receive an order and determine one or more orchestration services for fulfilling the order. An orchestration layer is configured to receive the one or more orchestration services for the order and orchestration performing of the one or more orchestration services. A task layer is configured to control performing of one or more tasks for the one or more orchestration services being performed. Also, an external interface layer configured to translate and route the one or more tasks to one or more external systems for processing. The external task layer is configured to receive one or more results for performance of the one or more tasks by the one or more external systems where the one or more results used to orchestrate fulfilling the order.

Abstract: A method and apparatus is provided for optimizing queries received by a database system that relies on an intelligent data storage server to manage storage for the database system. Storing compression units in hybrid columnar format, the storage manager evaluates simple predicates and only returns data blocks containing rows that satisfy those predicates. The returned data blocks are not necessarily stored persistently on disk. That is, the storage manager is not limited to returning disc block images. The hybrid columnar format enables optimizations that provide better performance when processing typical database workloads including both fetching rows by identifier and performing table scans.

Abstract: Implementations of the present disclosure involve an apparatus and/or method for an efficient packet queue depth sorting scheme for a ‘longest queue first’ based switch fabric device. In general, the sorting scheme compares a data queue length on an incoming port to a sorted queue of available ports based on longest queue. Based at least on the results of the comparison of the data queue length on the input port, a port designator is inserted into a re-sorted longest queue available port list in the proper position based on the incoming or outgoing port data length. The remaining entries are then sorted around the inserted port designator. Because the comparison and insertion of the port designator can occur in one clock cycle of the switch fabric device, efficiency of the switch is improved.

Abstract: Described herein is a system and method for providing and administering a partitionable environment for operating application software. The environment is provided together with a plurality of deployable resources usable within the environment and one or more resource group templates. Each resource group template defines a grouping of the deployable resources within a domain. An administration console is usable to create and configure one or more partitions within the domain, with each partition providing an administrative and runtime subdivision of the domain. The administration console can be set to display the one or more partitions and enable creation and configuration of specific artifacts within the one or more partitions.

Abstract: Methods, systems, and computer readable media for performing stateful Diameter routing with Diameter routing agents (DRAs) using different mechanisms to achieve stateful routing are disclosed. According to one aspect, a system for performing stateful Diameter routing with DRAs that use different mechanisms to achieve stateful routing includes a set of Diameter signaling routing nodes. Each node has access to at least one database for maintaining state information. The nodes are configured to be members of a first group, where each member of the first group is configured to use a first mechanism to achieve stateful routing with other members of the first group, and to use a second mechanism to achieve stateful routing with nodes that are not members of the first group. Members of the first group include signaling nodes provided by a same vendor, and members not in the group include signaling nodes provided by a different vendor.

Abstract: A method for assigning new Diameter sessions to policy and charging rules functions (PCRFs) may be performed at a Diameter routing agent including at least one processor. The method includes receiving input regarding central processing unit (CPU) and session utilization of each of a plurality of PCRFs. The method further includes receiving Diameter message traffic requiring processing by one of the PCRFs. The method further includes identifying, from the Diameter message traffic, traffic for new sessions that have not been assigned to one of the PCRFs. The method further includes assigning the new sessions to the PCRFs based on the input regarding the CPU and session utilizations of the PCRFs. The method further includes routing the received Diameter message traffic for the new sessions to the PCRFs assigned to the new sessions.

Abstract: A method for managing a distributed cache of a host channel adapter (HCA) that includes receiving a work request including a QP number, determining that a QP state identified by the QP number is not in the distributed cache, retrieving the QP state from main memory, and identifying a first portion and a second portion of the QP state. The method further includes storing the first portion into a first entry of a first sub-cache block associated with the first module, where the first entry is identified by a QP index number, storing the second portion into a second entry of a second sub-cache block associated with the second module, where the second entry is identified by the QP index number; and returning the QP index number of the QP state to the first module and the second module.

Abstract: Techniques are described herein for accurately estimating the cost of performing a join against “mirror format” data that is at least partially located in volatile memory. Mirror format data is a copy of on-disk data (a.k.a. persistent format data) stored in a different format in volatile memory. In the preferred embodiment described herein, the mirror format data is stored in a column-major format, while the persistent format data is stored in a row-major format. The cost of performing a join query with a particular join method against mirror format data is different than the cost of performing the same particular join method against persistent format data. Techniques described herein for estimating the cost of multiple join query execution plans, and selecting the most optimized plan.