Abstract: Disclosed herein are systems and methods for rendering scored opportunities using a predictive query interface including means for receiving input from a user device specifying a dataset of sales data for a customer organization, in which the sales data specifies a plurality of sales opportunities; generating indices from rows and columns of the dataset, the indices representing probabilistic relationships between the rows and the columns of the dataset; storing the indices in a queryable database within the host organization; selecting one or more of the plurality of sales opportunities specified within the sales data; querying the indices for a win or lose predictive result for each of the selected one or more sales opportunities; and displaying the win or lose predictive result for each of the selected one or more sales opportunities to the user device as output. Other related embodiments are further disclosed.

Abstract: Methods, systems, and computer program products for synchronizing a first closed system with a second closed system are disclosed. A first transaction synchronization function on a first computing device receives a first plurality of user transactions and stores corresponding transaction records in a first synchronization file in a common format. The first transaction synchronization function submits the first plurality of user transactions to the first closed system via a first vendor interface for application to a first database. A second computing device accesses the first synchronization file, translates the transaction records in accordance with a second vendor interface, and submits the translated transaction records to a second closed system via a second vendor interface for application to a second closed system.

Abstract: Disclosed herein are systems and methods for implementing a SIMILAR command with a predictive query interface including means for generating indices from a dataset of columns and rows, the indices representing probabilistic relationships between the rows and the columns of the dataset; storing the indices within a database of a host organization; exposing the database of the host organization via a request interface; receiving, at the request interface, a query for the database specifying a SIMILAR command term, a specified row as a parameter for the SIMILAR command term, and a specified column as a parameter for the SIMILAR command term; querying the database using the SIMILAR command term and passing the specified row and the specified column to generate a predictive record set; and returning the predictive record set responsive to the query, the predictive record set having a plurality of elements therein, each of the returned elements of the predictive record set including (i) a row identifier which corre

Abstract: Systems and methods for providing an enterprise crawl and search framework are described, wherein the system includes features such as use with middleware and enterprise application environments, pluggable security, search development tools, user interfaces, and governance. In accordance with an embodiment, the system includes an enterprise crawl and search framework which abstracts an underlying search engine, provides a common set of application programming interfaces for developing search functionalities, and allows the framework to serve as an integration layer between one or more enterprise search engine and one or more enterprise application. A computing environment can be used to display an administration interface for use in administering the framework.

Abstract: The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node.

Abstract: A database system performs hash join process for processing queries that join an inner and an outer database table. The hash join processes builds a hash table in memory for the inner table. The database system receives a limit on the memory for storing the hash table. The database system maximizes the number of partitions stored in memory for the hash table. If the hash table exceeds the limit of the memory while adding rows from the inner table, the database system selects a partition for spilling to a persistent storage. The partition selected for spilling to may be the largest partition or a partition larger than most of the partitions. The database system initializes the hash table to a number of partitions that is substantially equal to half of the total number of blocks that can be stored within the specified limit of memory for the hash table.

Abstract: In one embodiment, a cluster uses an extent store layer and a set of hash tables having a plurality of slots embodying extent metadata that describe write data of one or more write requests organized into one or more extents. One or more non-volatile logs (NVLogs) are maintained in the cluster. The one or more NVLogs include an extent store layer log maintained by the extent store layer. The extent store layer log records changes to the set of hash tables as a plurality of log stream structures, where each log stream structure is associated with a hash table. One or more storage devices of the cluster are organized as a plurality of log streams, where each log stream is associated with a corresponding log stream structure of the extent store layer log.

Abstract: The information matching apparatus includes calculating matching result values representing identicalness, similarity, and relevance between a plurality of records by matching the plurality of records based on a judgment criteria, each of the plurality of records including sets of values corresponding to items, generating frequency distribution information in which the calculated matching result values are used as classes and determining the judgment criteria for whether the records matches or not based on the generated frequency distribution information.

Abstract: A web-based application provides more accurate and clearer methods of searching, sorting, and displaying a set of images stored in a database. A first aspect of the present invention is the method by which image data is stored. Typical content-based systems use color information, whereas the present invention uses an image-location tagging method. A second aspect of the present invention is the method by which the set of images are sorted in relevancy. Tag data of the images allows for a new and last method of searching through an entire set. A third aspect of the present invention is the method by which the sorted images are displayed to the user. Instead of the common method of just displaying the images in a rectangular array, where each image is the same size, the web-based application positions and sizes each image based on how relevant it is.

Abstract: A system, method, and computer program product (e.g. mobile App) and/or web-based service is provided to enable users to research online reviews in order to assess the performance and functionality of mobile applications. The system extracts reviews from multiple online sources, including: mobile Apps “stores”, blogs, online magazines, websites, etc.; and, utilizes sentiment analysis algorithms and supervised machine learning analysis to present more informative summaries for each App's reviews. Summaries may include: a sentence that encapsulates a sentiment held by many users; the most positive and negative comments; and a list of features with average scores (e.g. graphics, fun, easy to use, etc.). Additionally, the user may view a separate review detail page per App that provides further summaries, such as a short list of other Apps that the same reviewer gave a very positive review for the features. The user is then able to purchase and download the App via a link.

Abstract: In an example embodiment, a method of performing data profiling in an in-memory database is provided. A command requesting a data attribute calculation on data in the in-memory database may be received. A precreated procedure stored in the in-memory database may then be used to perform the data attribute calculation on the data in the in-memory database The precreated procedure may be described in a computer language utilized by the in-memory database. Finally, a result of the performing of the data attribute calculation may be returned to the client computer.

Abstract: A node a data grid receives a prepare request identifying data to lock for a first transaction. The prepare request indicates a locking order that is different from a locking order indicated by a prior prepare request of a second transaction using the same data. The node identifies keys that correspond to the data. The keys are co-located on the node. The node ranks the keys to define an order for acquiring locks for the data based on key identifiers that correspond to the keys. The defined order matches a locking order used by the second transaction. The node acquires locks for the data using the defined order.

Abstract: A data indexing system including a plurality of servers and a tracked resource set client is provided. Each of the servers includes a plurality of resources that are part of a resource set. Each of the servers also includes a tracked resource set corresponding to the resource set. The tracked resource set describes the plurality of resources located in the resource set. The server identifies the plurality of resources using rules of linked data. The tracked resource set client is in communication with the plurality of servers. The tracked resource set client has a data index. The data index is built and kept up to date using the tracked resource set of each of the plurality of servers.

Abstract: A data indexing system including a plurality of servers and a tracked resource set client is provided. Each of the servers includes a plurality of resources that are part of a resource set. Each of the servers also includes a tracked resource set corresponding to the resource set. The tracked resource set describes the plurality of resources located in the resource set. The server identifies the plurality of resources using rules of linked data. The tracked resource set client is in communication with the plurality of servers. The tracked resource set client has a data index. The data index is built and kept up to date using the tracked resource set of each of the plurality of servers.

Abstract: There is an approach for generating a pattern-based database. The approach includes accessing a log specifying one or more strings representing data having a dynamic portion and a static portion. The approach also may include generating a pattern-based database, including one or more records representing compression of the data, by determining the dynamic portions and the static portions of the strings. The approach also may include assigning pattern values to the strings based on the determined dynamic portions and the static portions. The pattern values may be configured to provide compression of the strings within the records of the pattern-based database.

Abstract: A computer-implemented method for providing backup interfaces may include (1) identifying a backup policy configured to back up a source system according to a backup configuration, (2) identifying a request to display the backup policy within a graphical user interface, and in response to the request, (3) portraying the backup policy within the graphical user interface as a flow diagram, the flow diagram including (i) a first box representing the source system, the first box displaying an identifier of the source system, (ii) a second box representing a backup stage of the backup policy, the second box displaying an identifier of the backup stage, and (iii) a directed edge connecting the first box and the second box, the directed edge indicating a sequence beginning with the first box and progressing to the second box. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: When processing data via multiple computers, the number of computers can be increased or decreased without actually moving the data assigned to the respective computers, and the data can be arranged and processed so as to enhance the performance of the system in response to the increase of the number of computers. A plurality of computers for performing data processing stores target data to be processed in a shared storage system, and when data processing is to performed, the shared storage divides the storage area storing data corresponding to the number of computers, and creates virtual data storage areas referring to a portion of the storage area for each computer, so as to enable each computer to refer to independent virtual data storage areas and to complete data processing.

Abstract: Provided are techniques for locating one or more genome patterns. One or more lexical annotators that each identifies a sequence of nucleotides are created. One or more parsing rule annotators are created using at least one of (1) one or more of the lexical annotators, (2) one or more dictionary entries, and (3) one or more previously-defined parsing rule annotators. The one or more parsing rule annotators are used to discover the one or more genome patterns comprising a combination of the lexical annotators and the parsing rule annotators.

Abstract: Provided are techniques for locating one or more genome patterns. One or more lexical annotators that each identifies a sequence of nucleotides are created. One or more parsing rule annotators are created using at least one of (1) one or more of the lexical annotators, (2) one or more dictionary entries, and (3) one or more previously-defined parsing rule annotators. The one or more parsing rule annotators are used to discover the one or more genome patterns comprising a combination of the lexical annotators and the parsing rule annotators.

Abstract: Described herein are systems and methods for providing an enterprise crawl and search framework, including features such as use with middleware and enterprise application environments, pluggable security, search development tools, user interfaces, and governance. In accordance with an embodiment, such a system includes an enterprise crawl and search framework which abstracts an underlying search engine, provides a common set of application programming interfaces for developing search functionalities, and allows the framework to serve as an integration layer between one or more enterprise search engine and one or more enterprise application. A user interface is provided for use in validating a search box against at target environment as part of implementing search within that environment.