Abstract: This disclosure covers systems and methods that create references for locating a translation of a term expressed within a digital communication. In particular, in certain embodiments, the disclosed systems and methods create a hashkey to identify a translation (or multiple translations) of an initial term from a source language to a target language. By referring to this hashkey corresponding to the initial term, the disclosed systems and methods can identify a translation (or multiple translations) of the same or similar term within a digital communication to translate a digital communication from a source language to a target language.

Abstract: Systems and method for statistical linguistic analysis. According to some embodiments, methods may include evaluating a source text using one or more types of statistical linguistic analysis to determine a translatability of the source text and providing the translatability of the source text to a client node.

Abstract: Dynamic translation of idioms is performed with respect to electronic communications. An electronic communication is observed and movement of indicia proximal to a phrase in the electronic communication is detected. In response to the detection, an idiom search application is activated which identifies an idiom within the phrase and searches a corpus for a translation of the idiom and one or more associated characteristics. In response to detection of the translation in the corpus, profile metadata related to the observed communication is collected and compared to the one or more characteristics. The idiom and the collected profile metadata are stored in a corpus that supports a search of the idiom. In response to absence of the translation in the corpus, the idiom is dynamically translated. The translated idiom is presented proximal to the evaluated expression.

Abstract: Provided is a document management service that accepts a request for sharing a document from a user of client terminal so as to determine whether or not the document to which the sharing request was made has been successfully registered in a document management server as a sharing target among users. If the document has failed to be registered, the document management service posts the document to a microblog service.

Abstract: One embodiment of a method for summarizing an electronic document includes splitting the electronic document into a plurality of terms, wherein each of the plurality of terms is associated with a respective length, a respective informativeness score, and a respective coherence score, automatically selecting a subset of the plurality of terms, such that an aggregate informativeness score of the subset is maximized while an aggregate length of the subset is less than or equal to a maximum length, and arranging the subset as a summary of the electronic document.

Abstract: A data storage system is provided that is configured to achieve end-to-end data protection. The system includes a server running a storage archive manager with a first fixity support module, and the system includes a tape drive running a second fixity support module. During operations, the storage archive manager reads a data file with associated fixity information from a disk storage device, and the storage archive manager builds a set of blocks from the data file for writing to the tape drive. The first fixity support module checks fixity of the set of blocks by processing the fixity information associated with the data file. The processing of the fixity information includes determining whether data in the set of blocks is out of order relative to data in the data file or whether data in the set of blocks is corrupt relative to the data in the data file.

Abstract: Improved techniques are provided for storing bursty data, such as checkpoints, in parallel computing environments. A parallel file system is provided comprising at least first and second storage tiers comprising respective disjoint subsets of storage; and at least one processing device configured to store burst data from a plurality of distributed processes for a given burst operation during the given burst operation on both of the at least first and second storage tiers. The given burst operation comprises a multi-phase input/output (IO) task, such as a checkpoint, having alternating periods of idle time and bursts of write and/or storage activity. A method is also provided for provisioning a parallel file system by obtaining a specification of burst data requirements for the parallel file system and determining an amount of storage required for at least first and second storage tiers comprising respective disjoint subsets of storage to satisfy the burst data requirements.

Abstract: A method includes (a) receiving a command to create an upper-deck filesystem of a specified size, the upper-deck filesystem residing within a logical volume expressed from a container file of a lower-deck filesystem, (b) provisioning a plurality of storage provisioning units (SPUs) from a storage pool of the data storage system to the container file in an order reflecting proximity of the SPUs within storage devices of the data storage system, the plurality of SPUs providing storage for the entire container file, and (c) subsequent to provisioning the plurality of SPUs to the container file, executing a plurality of threads in parallel to write metadata of the upper-deck filesystem to the plurality of SPUs, representing the upper-deck filesystem. Other embodiments are directed to a system, a computerized apparatus, and a computer program product for performing methods similar to that described above.

Abstract: Data including a text file is received. The text file is arranged in an extensible format and includes a plurality of metadata lines, a header line, and a plurality of content lines. Metadata from the metadata lines is mapped to a plurality of metadata tables in a database that are formed according to a relational database schema using prefix parameters from each metadata line. Content from the content lines is mapped to a plurality of content tables in the database that are formed according to the relational database schema using the header line. A first subset of the content tables have a static structure and a second subset of the content tables have a dynamic structure. Related apparatus, systems, techniques and articles are also described.

Abstract: An AND operation is performed for an integrated appearance map of a compression code of character data “”, an integrated appearance map of a compression code of character data “”, and an integrated deletion map for a segment. The AND result is “1100” and it is found that the character data “” and “” are likely to be present in the segments (sg1(1)) and (sg1(2)). Since the segments are specified from the AND result, the AND operations are performed. As a result, the segments are specified and the AND operations are performed. As a result, a file number 3 is specified from the segment (sg0(1)) and a file number 19 is specified from the segment (sg0(5)). Therefore, it is found that both of the character data “” and “” are present in compression files (f3) and (f19).

Abstract: A computer implemented system for comparing at least two visual programming language files, the system comprising an intransient repository, a user interface, an authentication module, a menu driven selector module, an extractor module, a transient repository, a processor and a report generation module. A computer implemented method for comparing at least two visual programming language files, the method comprising the steps of verifying login credentials of a user, identifying a file type, identifying a file format, identifying file path to the files stored in an intransient repository, extracting files from the intransient repository, creating a copy each of the files in a transient repository, carrying out iterations of node-wise comparison between the files using a DOM parser and generating a report in a chosen file format.

Abstract: To provide a shortcut creating apparatus which creates folder shortcuts for a plurality of folders in a single flow without move to a target folder, and stores the created folder shortcuts in a selected folder. The shortcut creating apparatus according to the present invention includes: (1) a one-way shortcut creating unit configured to create a folder shortcut of a reference folder under a related folder, (2) a one-way shortcut creating unit configured to create a folder shortcut of the related folder under the reference folder, (3) a two-way shortcut creating unit configured to create a folder shortcut of the reference folder under the related folder, and create a folder shortcut of the related folder under the reference folder, and (4) a multiple-shortcut creating unit configured to create respective folder shortcuts of the reference folder and the related folders under folders except under the currently selected folder.

Abstract: There are provided methods and systems for transferring requested data over a node chain from a source node to a destination node through at least two intermediate nodes. A method includes identifying, at a file system level, at each of the at least two intermediate nodes, prior data previously sent to or received from a subsequent node in the node chain that matches at least a portion of the requested data. The method also includes transmitting, to the subsequent node, at least one pointer to the prior data and a reconstruction recipe for reconstructing the requested data at the subsequent node based on at least the at least one pointer, when the prior data matches at least the portion of the requested data.

Abstract: An indication to load data into a database table is received. A determination is made whether an existing set of frequency distribution statistics is available. In response to determining that an existing set of frequency distribution statistics is available, the data is loaded into the database table using the existing set of frequency distribution statistics.

Abstract: Compression of data for database movement, includes: selecting a first group of categorical columns for compression; selecting a next group of categorical columns from remaining columns for compression; repeating the selecting of the next group until a predetermined compression threshold is met; creating first compression files comprising compressed representations of the columns in the first group; creating next compression files comprising compressed representations of the columns in each of the next groups; storing initial row sort order, group identity, and column positions corresponding to each of the next groups; and storing any columns not selected for compression in an uncompressed file in the original row sort order. Decompression of the data includes: rebuilding categorical columns in each group of compression files using group identity and column positions corresponding to the group; and sorting rows comprising the rebuilt categorical columns to the initial row sort order.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include configuring a storage system to store multiple storage entities, and defining, in a memory, a lookup table including multiple entries, each of the entries referencing a unique storage entity. Upon receiving a storage entity to be stored on the storage system, a compressibility of the received storage entity is determined upon detecting that the received storage entity is not identical to any of the unique storage entities referenced by the lookup table, and an entry referencing the received storage entity is added to the lookup table upon meeting a duplication condition based on the determined compressibility.

Abstract: Methods, apparatus, and computer-accessible storage media for controlling export of snapshots to external networks in service provider environments. Methods are described that may be used to prevent customers of a service provider from downloading snapshots of volumes, such as boot images created by the service provider or provided by third parties, to which the customer does not have the appropriate rights. A request may be received from a user to access one or more snapshots, for example a request to export the snapshot or a request for a listing of snapshots. For each snapshot, the service provider may determine if the user has rights to the snapshot, for example by checking a manifest for the snapshot to see if entries in the snapshot manifest belong to an account other than the customer's. If the user has rights to the snapshot, the request is granted; otherwise, the request is not granted.

Abstract: Techniques to enforce policies with respect to managed files and/or endpoints are disclosed. A policy to be applied with respect to one or more files included in a synchronization set and/or an endpoint associated with the synchronization set is received. Compliance with the policy is ensured across a plurality of heterogeneous endpoints associated with the synchronization set.

Abstract: When a WORM cartridge is formatted for Tape File System (LTFS) in advance, such as prior to shipment, Linear Tape File System Library Edition (LTFS LE) is expanded by software to reduce consumption of the index partition and to support elimination of the appending of unnecessary data. More specifically, instead of recording metadata in the index partition during normal unmounting, the metadata is recorded in separate local storage such as on hard disk drive (HDD), and the index partition is updated only when the cartridge is ejected from the library. In this way, the present invention is able to significantly reduce the frequency of index partition updates. Because an update occurs only when the user intentionally ejects a cartridge, overflow of the index partition before overflow of the data partition can be prevented.

Abstract: A method, article of manufacture, and apparatus for protecting data. A file modification is identified. A previous file entry is modified where the previous file entry is stored in a key value database. A new file entry is created in the key value database. The previous file entry modification includes modifying the end version of the entry.

Abstract: A method includes flushing a write transaction based on byte-ranges within a file system block. It is determined if the write transaction is a first write transaction to the file system block and whether to flush the received write transaction to a recovery log. If it is determined to flush the write transaction to the recovery log and the received write transaction is the first write transaction: the data associated with the write transaction is appended in the recovery log and byte-ranges remaining in the file system block are recorded, and also recording an associated particular bit value or particular bit pattern that the remaining byte-ranges must be set to before the remaining byte-ranges are accessed or when a recovery sequence for recovering data in the recovery log executes due to failure. The write transaction is replicated. The entire file system block byte-range is marked as committed.

Abstract: A system that facilitates a geofencing operation is disclosed. The system obtains polygons that define a set of geographic regions. Then, the system projects rays from endpoints of the line segments that define the polygons onto a reference line to form intersection points. For each interval between pairs of consecutive intersection points on the reference line, the system keeps track of open line segments that project onto the interval. For each data point in a set of data points, the system identifies a relevant interval on the reference line that the data point projects onto, and performs a crossing number operation to identify polygons that the data point falls into, and the system increments a count for each polygon that the data point falls into. Finally, the system performs a geofencing operation for the location-aware device based on the identified polygons that the data point falls into.

Abstract: A document processing system for remote processing an image frame of a document and methods of using thereof. The system includes a remote server, having a processing unit and a data repository unit. The system further includes a personal mobile device having an image acquisition device for acquiring at least one image frame of a document, a communication unit adapted to communicate with the processing unit and an image-transmission-management module. Upon receiving the at least one image frame of a document by the remote server from the personal mobile device, via the wireless network, the processing unit extracts textual data, image data or both from the received at least one image frame to thereby create extracted data; associates an access code to the extracted data; and stores the at least one image frame, the extracted data and the associated access code in the data repository unit.

Abstract: Systems and methods are provided for providing user assistance on a mobile device. For example, a method may include receiving a first image of a screen captured on a mobile device, determining key content in the first image by performing recognition on the first image, and using the key content as a query to an index that associates key items with screen capture images previously received from the mobile device. The method may further include determining that a search result of the query includes at least one key item with a rank that exceeds a relevancy threshold, determining a portion of a second image from the screen capture images that is associated with the at least one key item, generating annotation data that includes the portion of the second image, and providing the annotation data for display with the screen on the mobile device.

Abstract: A composer interface allows a user to provide input, such as text data, to the social networking system. One or more images may be presented to the user via the composer interface, allowing the user to select one or more images to associate with the input. The images presented to the user may be selected based on associations of images with similar input by social networking system users. For example, images that a threshold number of users have associated with similar input are presented via the composer interface. If the user selects an image to associate with the input, the social networking system presents the selected image along with the received input in a content item presented to other social networking system users.

Abstract: A method for analyzing an image of a real object, generated by at least one camera includes the following steps: generating at least a first image by the camera capturing at least one real object, defining a first search domain comprising multiple data sets of the real object, each of the data sets being indicative of a respective portion of the real object, and analyzing at least one characteristic property of the first image with respect to the first search domain, in order to determine whether the at least one characteristic property corresponds to information of at least a particular one of the data sets of the first search domain. If it is determined that the at least one characteristic property corresponds to information of at least a particular one of the data sets, a second search domain comprising only the particular one of the data sets is defined and the second search domain is used for analyzing the first image and/or at least a second image.

Abstract: A method and device for automatically processing static test data of a rail transit vehicle are provided. A target operation step is determined in accordance with a commissioning template. Information about a commissioning task step is sent to a terminal device, for prompting that the target operation step needs to be executed. After the information about a commissioning result corresponding to the target operation step is received, it is judged whether test data in the information is correct. If it is judged that the test data is correct, the information is sent to the terminal device, the judgement result is filled into the commissioning template, and a step of determining the target operation step is executed. If it is judged that the test data is incorrect, the information is sent to the terminal device, and the judgement result is filled into the commissioning template.

Abstract: An example process for selecting chart scalings for plotting two time-series datasets includes determining a first log difference between a logarithm of a maximum value of a first dataset and a logarithm of a minimum value of the first dataset. The process also includes determining a second log difference between a logarithm of a maximum value of a second dataset and a logarithm of a minimum value of the second dataset. The process also includes selecting, based at least in part on the first and second log differences, between a linear chart scaling and a logarithmic chart scaling for the first dataset. The process also includes selecting, based at least in part on the first and second log differences, between a linear chart scaling and a logarithmic chart scaling for the second dataset.

Abstract: An approach for enabling collaborative development of a database application is provided. Specifically, this approach provides a database development and collaboration tool (DDCT), which can be utilized by multiple developers involved in a particular software project, to enable automated synchronization and database version control by allowing a database development language and data changes to be stored in a metadata form that is general to more than one database management system (DBMS). Each developer is united and able to collaborate through the system, thus ensuring that a change to a database structure and/or data in a static data table created in a particular database language by one developer is automatically incorporated in the overall development process. Furthermore, the DDCT provides the opportunity to maintain a single repository entry for more than one DBMS, which simplifies synchronization.

Abstract: An approach for tracking system changes to support data maintenance within a directory service environment. Log fields are added to a directory service database for applications that interface with a directory service environment based on predetermined fields to be tracked. The log fields are updated to register database schema fields and data associated with the applications to create a history of changes. An application's identity and data access to the directory service environment are monitored and the log fields are updated to create a history of usage. The directory service database history of usage and changes are periodically analyzed to determine applications relationship dependencies and usage information. Associated maintenance actions are identified by detecting conditions in the directory service environment, based on predetermined maintenance criteria and maintenance is performed.

Abstract: Methods, systems, and computer program products for decompressing data are described. An ordinal column number of columnar data to be accessed is obtained, the ordinal column number identifying a location of the columnar data in a corresponding uncompressed row, the columnar data being stored in a first data structure. A breakpoint value in a breakpoint field of the at least partially compressed row is determined, the breakpoint value indicating a location of an end of a common prefix in the corresponding uncompressed row, the common prefix being stored in a second data structure. The ordinal column number of the columnar data to be accessed and a column number indicated by the breakpoint value are compared, the comparison identifying one or more locations of the columnar data to be accessed.

Abstract: A temporal-miss handler includes updating a data leaf in a tree-structured database of a communications processor with a plurality of threads. A search for the data leaf includes generating at least one search result for one of the plurality of threads. A sufficiency of a temporal separation, between updating the data leaf and searching for the data leaf, to retrieve the data leaf is determined. Each search result is cleared when the temporal separation is insufficient. A new search is performed when the temporal separation is insufficient.

Abstract: Identifying unvisited portions of visited information to visit includes receiving information to crawl, wherein the information is representative of one of web based information and non-web based information, computing a locality sensitive hash (LSH) value for the received information, and identifying a most similar information visited thus far. Identifying unvisited portions of visited information further includes determining whether the LSH of the received information is equivalent to most similar information visited thus far and, responsive to a determination that the LSH of the received information is not equivalent to most similar information visited thus far, identifying a visited portion of the received information using information for most similar information visited thus far and crawling only unvisited portions of the received information.

Abstract: Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.

Abstract: The present invention relates to a method, computer program product and system to compute one sorted list of enumeration values in a specific language, read from at least one relational database including at least one data table storing enumeration programming variable values and at least one catalog table storing an expression, in at least one language, of the enumeration programming variable values, said method comprising the steps of receiving a request for providing enumeration variable values including one list sorted in a specific order, of the values of a specific enumeration, in a specific language; then, all the expressions of the enumeration values for the specific language for the specific enumeration read in a corresponding catalog table are sorted in the specific order; if the sorted list of the specific enumeration expression values matches a list of the specific enumeration variable values sorted in the specific order in the same catalog table, the sorted list of enumeration values in a specifi

Abstract: Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.

Abstract: Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.

Abstract: The present disclosure describes systems and methods for managing and implementing an asset license reclamation program across a network. The status of an asset, such as computer software, is automatically determined and if the asset does not meet particular use criteria, the asset may be flagged for reclamation and/or redeployment, either within the same network segment or in a separate network segment.

Abstract: Optimizing approximation of an earliest access time of objects in a datasharing environment by maintaining a global exception list for objects that are accessed by transactions that commit infrequently. The global exception list comprises a time value representing the earliest access time for each object in the global exception list, and an object identifier. The system references the global exception list to determine whether the object is in the global exception list. If the object is in the global exception list, the system uses the time value associated with the object when determining the earliest access time for the object. If not, the system approximates the earliest access time of the object by selecting the most recent access time value from the global exception list, providing more recent access times for objects accessed by transactions that commit frequently.

Abstract: Embodiments of the present invention provide efficient systems and methods for processing large data sets using a composite function. Embodiments of the present invention can be used to compute a broad range of composite functions in a single map-reduce job. Each mapper computes an additive function G on a set of specified data partitions, and then passes the results to one or more reducers. The one or more reducers can then compute a function F, using the aggregate results of function G and data from a single partition.

Abstract: Methods and systems for interacting with multiple three-dimensional (3D) object data models are provided. An example method may involve receiving a search query comprising a descriptor for an object that is associated with a given category of objects. The method may involve comparing the descriptor to contents of a three-dimensional (3D) object-data-model database that includes contents associated with the given category of objects. Based on the comparison, the method may involve generating a search query result that comprises 3D object data models that describe the object and associated images that describe the object. The method may also involve arranging the 3D object data models and associated images in the search query result in a manner such that the 3D object data models are moveable inline in the search query result, and providing the search query result.

Abstract: A list of command entries is displayed in a search interface, each of the command entries representing one or more commands of a plurality of commands of a search query. The list of command entries are displayed in a sequence corresponding to the plurality of commands of the search query. Based on a user interaction with a designated command entry in the displayed list of command entries, the displayed list of command entries is modified with respect to the designated command. Furthermore, the search query is automatically modified with respect to the corresponding one or more commands represented by the designated command entry. The modification can include causing the designated command entry to be removed from or reordered in the displayed list of command entries and the automatic modification cam include causing the corresponding one or more commands to be removed from or reordered in the search query.

Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.

Abstract: In one aspect, a method includes receiving a query determined to be a question query that seeks an answer response and data identifying resources determined to be responsive to the query; identifying structured content set in a top-ranked subset of the resources, each structured content set being content arranged according to related attributes in one of the resources; for each identified structured content set, determining whether the query matches the structured content set based on terms of the query matching related attributes of the structured content set; selecting one of the structured content sets for which the query is determined to match; generating, from the selected structured content set, a structured fact set from the related attributes that matched the terms of the query; and providing the structured fact set with search results that identify the resources determined to be responsive to the query.

Abstract: Systems and methods are provided for expanding database search queries. In one embodiment, a method comprises receiving a token that is usable in search queries for data in a database, the database including items of data stored in a tree hierarchy of categories. The method further comprises determining a synonym candidate for the token, and identifying the synonym candidate as a synonym for the token in response to a determination that the token and the synonym candidate are in a same category for a level of the tree hierarchy.

Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.

Abstract: An approach for joining operations on document-oriented databases. The approach consists of receiving database identifiers, common attributes and results attributes for core and target databases being joined. Common attributes are searched for in the databases. The searches performed include string, expansive, character and nested. Common attribute join conflicts are identified and input is received to resolve attribute join conflicts. Resolved join conflicts are updated in a join substitution database for subsequent use and joined data results are output to virtual table(s).

Abstract: Techniques are provided for caching external data sources for SQL processing. According to an embodiment, a database system receives a query that requires foreign data from an external data source. In response to receiving the query, the database system determines whether the foreign data currently resides in a cache of the database system. In response to determining that the foreign does not currently reside in the cache, the database system retrieves the foreign data from the external data source, maps the foreign data to a column granule of a table, and stores the column granule in the cache. In another embodiment, the database system receives a second query that requires the foreign data. In response to determining that the foreign data is cached with the stored column granule, the database system retrieves the column granule from the cache.

Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.

Abstract: A database management system (DBMS) runs on scalable production system. The DBMS includes a first operating mode, wherein the scalable production system runs on a first set of computing resources, and a second operating mode, wherein the scalable production system runs on a second set of computing resources. The DBMS in the first mode determines that with respect to the first set of resources a first query access plan for executing a query satisfies optimization criteria. A determination is made that with respect to the second set of resources the first plan fails preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having the DBMS receive a request to execute the query while in the second mode, a determination is made that with respect to the second set of resources the second plan satisfies the optimization criteria.