Abstract: The present disclosure relates to systems, methods, and computer-readable media for optimizing selection of a cached execution plan to use in processing a parametric query. For example, systems described herein involve training a plan selection model that makes use of machine learning to identify an execution plan from a set of pre-selected execution plans based on predicted cost of executing a query instance in accordance with the selected execution plan (e.g., relative to predicted costs of executing the query instance using other pre-selected execution plans). This application describes features related to lowering costs associated with selecting the execution plan in a way that will continue to be more accurate overtime based on training and refining the plan selection model.

Abstract: Various aspects of this disclosure relate to determining mapping issues in object relational mapping (ORM). An artificial intelligence (AI) model may be trained to identify errors in mapping between relational databases and objects during code compilation. Multiple AI models may be used, with different models being associated with different programming frameworks, thereby making this technique framework agnostic.

Abstract: Methods, systems, and computer program products are provided that construct and execute multi-step query plans in a database application. A database application accepts a query such as, for example, a graph query. The database application generates a physical query plan comprising a set of execution steps that perform the query. The set of execution steps comprises at least an initial step, an intermediate step and a final step. The database executes the query by passing control to the initial step that, when complete, passes execution control to some other step. The intermediate step executes and when complete, may pass execution control to any other step including itself. Steps may be configured to communicate arbitrary data between steps. The generated query plan may also comprise multiple multi-step sequences, and such sequences may be configured to execute in the alternative based on intermediate query results, or a parameter included in the query.

Abstract: An online document system provides a recommendation for one or more features within the online document system to an entity. The online document system accesses a set of feature training data to train a machine learning model. The set of feature training data may describe characteristics of entities associated with the online document system and historical activity associated with the entities' usage of the online document system's features. The machine learning model may be configured to identify a feature to recommend to an entity based on the entity's characteristics and history of using other features within the online document system. For example, data representing the entity's user accounts and use of an electronic signature feature is used by the machine learning model to identify a document authentication feature to recommend to the entity. The online document system may then provide the identified feature in a recommendation to the entity.

Abstract: Techniques for customizing knowledge representation systems including identifying, based on a plurality of concepts in a knowledge representation (KR), a group of one or more concepts relevant to user context information, and providing the identified group of one more concepts to a user. The KR may include a combination of modules. The modules may include a kernel and a customized module customized for the user. The kernel may accessible via a second KR.

Abstract: The present disclosure is directed to a system and associated methods for assessing, evaluating a target business, and leveraging insights from the assessment and evaluation to provide strategy recommendations to optimize the performance of the target business. In some embodiments, the system may identify a benchmark competitor and determine a performance score for the benchmark competitor. In some embodiments, the system may determine a domain score of an identified benchmark competitor. In some embodiments, the system determines an updated performance score based on provided capability process data. In some embodiments, the system recommends solutions and/or key performance indicators (KPI) to solve a provided problem. In some embodiments, the system provides a platform to enable stakeholders, (e.g., users) in the target business to perform a design thinking process.

Abstract: Systems, computer program products, and methods are described herein for implementing intelligent data analysis. The present invention is configured to receive, from a computing device of a user, a first data file, wherein the first data file is associated with a base version of a data source; receive, from the computing device of the user, a second data file, wherein the second data file is associated with an updated version of the data source; initiate an intelligent data analysis engine on the first data file and the second data file; analyze the second data file to determine one or more discrepancies in relation to the first data file; determine one or more discrepancy types associated with the one or more discrepancies; retrieve, from an action datastore, one or more offset actions to rectify the one or more discrepancies; and automatically execute the one or more offset actions.

Abstract: A display apparatus includes circuitry to acquire history data including a record of an event executed with a plurality of display apparatuses including the display apparatus. The plurality of display apparatuses shares data of a sharing area shared by the plurality of display apparatuses. The sharing area is generated based on the history data. The circuitry displays, on a display screen, at least a part of the sharing area as a display area for the display apparatus. The display area is set based on an operation log included in the history data. The operation log is related to a user at the display apparatus.

Abstract: Techniques involving migrating authenticated content on a network towards the consumer of the content. One representative technique includes a network node receiving an encrypted seed having at least a location of the user data at a network service that stores the user data, and a cryptographic key to access the user data. The seed is received in response to a user login attempt to the network service. The user data is requested from the location using at least the received cryptographic key. The method further includes receiving and storing the user data at the network node, where the network node is physically closer to a location of the user than is the location of the network service. If the user is successfully authenticated, user access is provided to the stored user data at the network node rather than from the network service.

Abstract: The invention relates to a computer implemented campaign management system (CAMS), the system including a graphical user interface (GUI), the management system (CAMS) processing a plurality of participant records (PREC) according to a user-configured process structure (PS) of a plurality of configured logic templates (CLT); wherein the participant records (PREC) comprise participant attributes (PA), and wherein the processing of participant records involves processing or modification of one or more of the participant attributes (PA) of the participant record (PREC), wherein the management system reads, processes and/or modifies participant attributes (PA) of participant records (PREC) by a sequence of one of more executable program fragments (EPF) according to the process structure (PS) and wherein the execution of one of more executable program fragments (EPF) can be suspended in response to user action (UACT) and/or participant action (PACT) and wherein the execution of the process structure can be resumed

Abstract: Methods and systems for presenting time series for analysis. A method includes presenting a first visualization of summary information for an initial data set of a plurality of batches, presenting a filtered data set of the initial data set having a first batch identifier associated with a first batch and the second batch identifier associated with a second batch, executing a time series connector including transmitting a request to a time series application, the request comprising the first batch identifier, the second batch identifier, and the time series configuration data. The method further includes causing presentation of a user interface comprising a chart including a first plot for first time series data for the first batch identifier and a second plot for second time series data for the second batch identifier, the chart configured to the time series configuration data, and the first plot is aligned to the second plot.

Abstract: The present disclosure is directed to systems and methods of managing remote devices. The system can include a server with memory, a detection module, and a collection module. The memory can store a management information base (MIB) having a hierarchical tree of object identifiers and corresponding object values. The detection module can query devices and receive a first object identifier and its first object value, which can vary from those in the MIB; and use patterns to match the first object identifier and object value; and generate an identification of the device from the matches. The collection module can use the identification to select a collection template, which can indicate a subtree of the MIB and a collection pattern; traverse the subtree and identify a second object identifier that matches the collection pattern, and its second object value; and associate the second object value with the first object value.

Abstract: This application discloses a method and apparatus for determining characteristics of a sound source. The method may include: acquiring a first position of a first virtual role controlled by an application client in a virtual scene; detecting, in a sound source detection area associated with the first position, a second position of a sound source virtual object in the virtual scene; determining transparency of a position mark that matches the sound source virtual object, according to a sound source distance between the first position and the second position, the position mark identifying the second position of the sound source virtual object; and displaying, on an interaction interface of the application client, the position mark of the sound source virtual object according to the transparency.

Abstract: As described herein, a system, method, and computer program are provided for identifying foreign keys between distinct tables based on a statistical analysis of table values. In use, a plurality of candidate field combinations are determined between a first table and a second table. A statistical analysis of values stored in fields of each candidate field combination of the plurality of the candidate field combinations is performed. Foreign keys between the first table and the second table are identified, based on a result of the statistical analysis.

Abstract: According to an aspect of an embodiment, operations may comprise receiving a search query for points near a query-point, accessing a compressed octree representation of a point cloud comprising 3D points of a region, and traversing the compressed octree representation to identify regions that overlap a search space by, marking a current node as overlapping the search space responsive to determining that the current node is a leaf node, identifying a child node of the current node and performing a nearest neighbor search in the child node responsive to determining that a region represented by the current node overlaps the search space, and identifying a sibling node of the current node and performing the nearest neighbor search in the sibling node responsive to determining that a region represented by the current node does not overlap the search space.

Abstract: One embodiment of the present invention provides a system for generating a product recommendation. During operation, the system obtains data indicating vertices and edges of a graph. The vertices represent consumers and products and an edge represents an access relationship. The system may receive a query indicating an ego for determining a product recommendation. The system may then traverse the graph from a vertex representing the ego through a plurality of edges to a plurality of vertices representing products. The system may traverse the graph from the plurality of vertices representing products to a plurality of vertices representing other consumers. The system may then traverse the graph from the plurality of vertices representing other consumers to a plurality of vertices representing other products. The system may generate a recommendation that based on the plurality of vertices representing other products.

Abstract: A sort device includes a compare unit on one level of a hierarchical structure that includes a plurality of levels. The compare unit to compare one beat of one record with another beat of another record to provide a winner beat. The sort device further includes another compare unit on another level of the hierarchical structure to provide a further beat to the compare unit, and a request pipe to be used to request that the other compare unit provide the further beat to the compare unit.

Abstract: A method, computer system and computer program product, the method comprising: upon receiving a database query comprising at least a first and a second join operations: storing the database query in the memory; identifying by the processor within the database query the first join operation, wherein the first join operation is a many-to-many join operation or a one-to-many join operation between a first table and a second table, in which fields of the second table are used only for filtering rows from the first table or for joining with another table; and converting by the processor the first join operation to an enhanced operation which eliminates returning at least two matches for at least one row from the first table when the database query is executed.

Abstract: According to some embodiments, a system associated with predictive analytics may include a data filter dictionary that stores a plurality of electronic data records based on prior input data. A data filtering and noise reduction module may receive input data and access the data filter dictionary. The data filtering and noise reduction module may then utilize data from the data filter dictionary and a latent semantic indexing data filter and noise reduction algorithm to remove information from the input data and create a subset of the input data. A predictive analytic algorithm platform may receive the subset of input data and use a predictive analytic algorithm to output a prediction result. An intelligent loop-back mechanism may then receive the subset of the input data and dynamically update the data filter dictionary based on an impact associated with the output prediction result.

Abstract: A user-defined, structured input which identifies a column in a database and includes an active input associated with the column is received via a UI. A format-related, context-sensitive rule which applies to the active input is determined including by determining an expected format for the active input based at least in part on the format of the column in the database. Guidance associated with satisfying the rule is provided in real time via the UI. This includes displaying format assistance associated with the rule (by identifying the expected format and/or automatically configuring the UI so that the active input has a format which matches the expected format) and/or displaying format validation associated with the rule, including by indicating whether the format of the active input matches the expected format.

Abstract: Systems, methods, and computer-readable media for automatically filtering data in complex tables are disclosed. The systems and methods may involve at least one processor that is configured to display multiple headings including a first heading and a second heading, receive a first selection of a first cell associated with the first heading, wherein the first cell may include a first category indicator, receive a second selection of a second cell associated with the first heading, wherein the second cell may include a second category indicator, receive a third selection of a third cell associated with the second heading, wherein the third cell may include a third category indicator, generate a logical filter for the complex table, and, in response to application of the logical filter, to cause a display of a filtered collection of items from the first group that contain the third category indicator.

Abstract: Provided is a method, a computer program product, and a system for providing request messages with zero round trip time in a Transport Layer Security (TLS) session. The method includes establishing a TLS session between a server and a client by performing a TLS handshake between the server and the client. The method further includes generating a session ticket associated to the client. The method also includes transmitting the session ticket to the client and receiving an early request message from the client during the TLS session. The early request message includes a request message that is to be sent to the client upon resuming the TLS session with the client. The method further includes associating the early request message with the session ticket and processing the early request message. The data related to the early request message can be sent upon resumption of the TLS session.

Abstract: Aspects of the invention include assessing, by a management layer executing on a first processor, a query from a client application requesting data from a server. The assessing occurs prior to the query being executed by a provider. The assessing includes extracting, by the management layer, characteristics of the query. The management layer compares the extracted query characteristics with a policy defined by the provider. Based at least in part on results of the comparing, it is determined by the management layer whether the query is permitted to be executed by the provider at the server. The management layer initiates execution of the query at the server in response to determining that the query is permitted to be executed. The management layer prevents execution of the query at the server in response to determining that the query is not permitted to be executed.

Abstract: Aspects of the present invention disclose a method for extracting information of an unlabeled image within a document and aligning the information to text of the document. The method includes one or more processors identifying an image that is not associated with a corresponding label in a document that includes text. The method further includes determining a feature of an object of the image. The method further includes identifying an alignment candidate of the text of the document based at least in part on the feature of the object, wherein the alignment candidate is a segment of the text of the document identified as corresponding to the feature of the object. The method further includes aligning the feature with the alignment candidate of the text of the document.

Abstract: Filename-based malware pre-scanning is described herein. A method as described herein can include establishing sequential malware scanning for respective files in a first directory of a file system according to filenames of the respective files; comparing an elapsed time since a previous malware scan for a first file of the respective files in the first directory having a first filename in a filename sequence to a scan age threshold associated with a scheduled malware scan task for the first directory; and, in response to the elapsed time since the previous malware scan for the first file being determined to be less than the scan age threshold, removing the scheduled malware scan task with respect to the first file and at least one second file of the respective files in the first directory having respective second filenames in the filename sequence.

Abstract: An apparatus includes a cache controller circuit and a multi-ported cache memory including a plurality of cache ways. The cache controller circuit is configured to maintain rank values and a threshold value usable to classify the rank values. A given rank value corresponds to a least recently used one of the plurality of cache ways. The cache controller circuit is further configured to receive, in a common access cycle, first and second memory access requests for the cache memory, and, in response to a determination that the first and second memory access requests correspond to respective first and a second cache ways, compare the corresponding rank values for the first and second cache ways to the threshold value. The cache controller circuit is further configured to, based on the comparison, modify the rank value of a selected one of the first and second cache ways.

Abstract: Disclosed herein are system, method, and computer program product embodiments for a query processing system. An embodiment operates by receiving a query associated with a table. An ordered index with entries that include key values that uniquely identifies a corresponding record in the table is determined. A last key value is initialized to store a minimum value for a data type of the key value. The query is executed as a union-all of a plurality of queries. While a count of selected records is less than or equal to a threshold quantity and at least one entry remains in the ordered index, an ordered next entry with a key value subsequent to the last key value in the index is identified, the corresponding record is selected from the table, the last key value is updated, the query is executed, and the count is incremented.

Abstract: The specification provides a system, method, and storage medium for executing an outer join command on a first table and a second table in a distributed database. The method may comprise: broadcasting the first data set to a plurality of database nodes storing the second data set; dividing the plurality of database nodes into a first subset and a second subset; obtaining, an OUTER JOIN result based on the first data set broadcasted to each database node of the first subset and the portion of the second data set stored therein; obtaining, an INNER JOIN result based on the first data set broadcasted to each database node of the second subset and the portion of the second data set stored therein; and returning a result to the OUTER JOIN command by aggregating the OUTER JOIN result and the INNER JOIN result.

Abstract: A method for enforcing a number of context model based policies with forward chaining comprising applying a policy set including a plurality of policies to an instantiated context model which includes a set of referenced instance documents in XML format, determining whether the instantiated context model should be updated, if the instantiated context model should be updated, executing an updating operation, re-generating a new instantiated context model according to the updated instance documents and the instantiated context model, and applying the policy set to the new instantiated context model, and wherein the policies include a condition part and an action part.

Abstract: Provided are techniques for efficient subquery predicate generation to reduce processing in a multi-table join. It is determined that a query is to be rewritten, wherein the query includes a predicate for a first column of a first table and a second column of a second table. The query is rewritten with generated subquery predicates for the first table that are to be applied to the second table and with generated subquery predicates for the second table that are to be applied to the first table. Minimum and maximum ranges for columns of the generated subquery predicates at a cursor open are determined. The minimum and maximum ranges are merged to determine inclusive ranges that exist in the first table and the second table. The generated subquery predicates are rewritten as derived local subquery predicates with the inclusive ranges. The query with the derived local subquery predicates is executed.

Abstract: Computer software that adjusts a performance capability of a storage volume by (i) determining a current storage volume to store data having a workload pattern, wherein a cycle of the workload pattern includes a hot period and a cold period, (ii) determining a time limit window of the current storage volume, wherein the time limit window is a shortest time window within which performance capability of the current storage volume is to be kept without adjustment, (iii) determining a low performance period of the current storage volume corresponding to the cold period, and (iv) in response to the low performance period being greater than or equal to the time limit window, reducing the performance capability of the current storage volume during the low performance period.

Abstract: Provided are techniques for efficient subquery predicate generation to reduce processing in a multi-table join. It is determined that a query is to be rewritten, wherein the query includes a predicate for a first column of a first table and a second column of a second table. The query is rewritten with generated subquery predicates for the first table that are to be applied to the second table and with generated subquery predicates for the second table that are to be applied to the first table. Minimum and maximum ranges for columns of the generated subquery predicates at a cursor open are determined. The minimum and maximum ranges are merged to determine inclusive ranges that exist in the first table and the second table. The generated subquery predicates are rewritten as derived local subquery predicates with the inclusive ranges. The query with the derived local subquery predicates is executed.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: Provided are techniques for minimizing processing using an index when non-leading columns match an aggregation key. A query that includes a clause and an aggregation key is received. It is determined that a non-leading key column of an index matches a column of the aggregation key comprising any of: a leading column of an ORDER BY aggregation key, any column of a duplicate removal aggregation key, a MIN aggregation key, and a MAX aggregation key. The clause is processed using an order of the aggregation key to generate a first result set. Then, the clause is processed using the non-leading key column of the index that matched the column of the aggregation key and the first result set to generate a second result set. The second result set is returned.

Abstract: A smart fill feature is provided, which may be utilized to provide suggestions to a user and to prepopulate fill results in a spreadsheet. Characteristics associated with a set of data may be recognized and used to help determine fill results Suggestions may be determined from internal and or/external data sources, and may use contextual information in a data set to determine what a user may be trying to accomplish. External data sources may include one or more Internet data sources or internal corporate databases, providing a large amount of data from which to search for potential fill results. A split column command may be used to split a column into two or more columns. Data may be split between columns or combined by various methods, which may include, by example, by direct manipulation via tokens, or via a slider UI.

Abstract: A first dataset from one or more databases and a second dataset from the one or more databases may be identified. The first dataset may contain first data while the second dataset may contain second data. A first relationship measure may be computed for the first dataset, where the first relationship measure is configured to represent the first data in a first condensed format. A second relationship measure may be computed for the second dataset, where the second relationship measure is configured to represent the second data in a second condensed format. A join key may be computed using the first relationship measure and the second relationship measure. The join key may represent a correspondence area between the first dataset and the second dataset. An interactive user interface element may be configured to display a graphical depiction of the correspondence area between the first dataset and the second dataset.

Abstract: A database engine performs row filtering operations concurrently with performing database object partition maintenance operations. The filtering operations do not incur the high processing costs of database delete or purge operations that would incur per row costs for logging, locking, etc. The partitioning and filtering operations are specified in multiple clauses of a single database language statement. The clauses of the statement are executed concurrently. A method implementation receives a database language statement that comprises a partitioning operation specification as well as a filtering operation specification that includes a logical predicate for determining whether or not to filter-out predicate-matching entries when forming the resulting partitioned target database object. While processing the partitioning operations, the method discards entries taken from the source database object whenever the entry corresponds to the logical predicate.

Abstract: Methods and systems for using common property datatypes are described. In some embodiments, a system may receive an assignment statement a data structure comprising a first object of a first datatype, the first datatype one of multiple datatypes supporting a common property, the multiple datatypes representing the common property using differing native values, and a common property object of a common property datatype, the common property object representing the common property supported by the multiple datatype. The system can execute or interpret the subscripted assignment statement, converting the common property object into a second object of the first datatype, the second object having a first native value representing the common property for the first datatype. The system can assign the second object to a location of the first object in the data structure. The common property can be at least one of a maximum, minimum, missing, and default.

Abstract: Bidirectional or multidirectional cascading goals allow goal progress to roll up or downstream multiple levels in an organization. This means that goals from be assigned by higher-level employees to lower-level employees and lower-level employees to higher-level employees. The progress of contributing goals directly modifies the progress of all upward goals to reflect accurate progress of the overarching goal. Goals can be standalone goals, or contribute to other goals. A connection between goals may be made during the goal creation process or after both goals have been created.

Abstract: Electronic documents may be large and have numerous pages, sections and areas of information that are useful to some individuals and not others. It is common for large documents to include some information that is intended for only certain recipients and other information that is intended for other recipients. One example may provide receiving a document that has a number of pages, identifying an extraction attribute, querying the document for the extraction attribute, applying a coordinate to information associated with the extraction attribute, extracting information based on the extraction attribute and a predefined area associated with the at least one coordinate, and creating a new document including the information extracted.

Abstract: A user virtual file system within a hierarchical storage system performs file handling. A user virtual file system scans, reads and analyses data or user behavior to create or modify at least one rule or metadata. The user virtual file system identifies logical or temporal relationships of files based on the at least one rule or the metadata. The user virtual file system groups identified related files in the at least one container. The user virtual file system moves the at least one container to different tiers of storage based on the at least one rule or the metadata.

Abstract: Systems and methods are provided for storing and restoring digital data. A method includes receiving, a first user input requesting that a backup interface be displayed, displaying the backup interface, the backup interface including a display area for presenting at least a first visual representation of an earlier version of a current view and a visual representation of the current view, the earlier version including a first element, receiving, while the backup interface is displayed, a second user input requesting that the current view be modified according to the earlier version, at least with regard to the first element, animating the modification of the first element as moving from the visual representation of the earlier version to the visual representation of the current view, and modifying, in response to the second user input, the current view according to the earlier version, at least with regard to the first element.

Abstract: An example method of processing a query includes receiving a partial query including an identifier that identifies a full query corresponding to the partial query. The partial query is sent from a client and includes a command to select data from a database table stored in a database. The method also includes determining whether the table has been updated since a previous result set was sent to the client. The method further includes generating a partial result set including an indication of the updates to the table since the previous result set was sent to the client. The method also includes sending the partial result set to the client. The partial result set is an incomplete result set of the partial query.

Abstract: Optimizing window joins over data streams can include receiving an input topology and calculating costs of computing a join of data streams based on a number of model topologies, and determining an optimal topology based on the calculated costs and the input topology, wherein the input topology, the model topologies, and the optimal topology each include a number of interconnected operators.

Abstract: A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.

Abstract: An apparatus in one embodiment comprises at least one processing device. The processing device is configured to generate a hash entry of a hash table implementing a key-value store that comprises a plurality of buckets associated with corresponding keys where a given bucket comprises a bucket index having two or more entries for storage of values that hash to a key associated with the given bucket. The processing device is also configured to allocate blocks in non-volatile memory, to split the given bucket into chunks each comprising at least one entry of the bucket index, and to persist the hash table to the non-volatile memory utilizing a direct mapping of the chunks of the given bucket to respective designated block offset positions in the allocated blocks. Persisting the hash table comprises storing first and second chunks of the given bucket in first and second allocated blocks.

Abstract: A cache management method, a cache controller, and a computer system are provided. In the method, the cache controller obtains an operation instruction; when a destination address in the operation instruction hits no cache line cache line in a cache of the computer system, and the cache includes no idle cache line, the cache controller selects a to-be-replaced cache line from a replacement set, where the replacement set includes at least two cache lines; and the cache controller eliminates the to-be-replaced cache line from the cache, and stores, in the cache, a cache line obtained from the destination address. According to the cache management method, system overheads of cache line replacement can be reduced, and cache line replacement efficiency can be improved.

Abstract: The present disclosure is directed to systems and methods of managing remote devices. The system can include a server with memory, a detection module, and a collection module. The memory can store a management information base (MIB) having a hierarchical tree of object identifiers and corresponding object values. The detection module can query devices and receive a first object identifier and its first object value, which can vary from those in the MIB; and use patterns to match the first object identifier and object value; and generate an identification of the device from the matches. The collection module can use the identification to select a collection template, which can indicate a subtree of the MIB and a collection pattern; traverse the subtree and identify a second object identifier that matches the collection pattern, and its second object value; and associate the second object value with the first object value.

Abstract: In one embodiment, the system determines network performance metrics in a number of geographic areas within a communication network based on application data of end users. The system receives, from a client system, a query for geographic areas of interest specifying network performance criteria based on network performance metrics and corresponding thresholds. The system identifies geographic areas of interest matching the network performance criteria of the query. The system determines, for each geographic area of interest, network performance features based on network performance metrics derived from application data collected from the geographic areas of interest. The system generates optimization recommendations for one or more of the geographic areas of interest. The optimization recommendations are customized for the geographic areas of interest based on the performance features associated with the respective geographic areas of interest.

Abstract: Access requests to a database are monitored for average time taken to fulfill the requests and whether a queue of unfulfilled requests is building up beyond an acceptable threshold. When the queue has built up beyond the acceptable threshold and/or when the average time taken to fulfill the requests has exceeded a delay threshold value, database access requests may be rejected. In one advantageous aspect, a graceful degradation in performance may be achieved by selectively rejecting access requests of a lower priority and favoring access requests of a higher priority for execution.