Abstract: Methods, systems, and computer program products are described herein for updating big data tables using snapshot isolation. The tables may store data (e.g., as data objects) collected from different users. The tables are stored in a first data store. The data's metadata is stored in a second data store. The metadata comprises version numbers for the objects that correspond to a consistent version thereof. When an update process for the table is initiated, a coordinator locks the metadata, and. the objects are updated. If the update to the objects is successful, the coordinator commits the updates and obtains the new version numbers of the objects. If all the commits are successful, the coordinator atomically updates the metadata with the new version numbers and releases the lock. However, if a commit to an object is unsuccessful, a subsequent process rolls back the committed objects to the version numbers specified by the metadata.

Abstract: Methods, systems, and computer program products are described herein for updating big data tables using snapshot isolation. The tables may store data (e.g., as data objects) collected from different users. The tables are stored in a first data store. The data's metadata is stored in a second data store. The metadata comprises version numbers for the objects that correspond to a consistent version thereof. When an update process for the table is initiated, a coordinator locks the metadata, and. the objects are updated. If the update to the objects is successful, the coordinator commits the updates and obtains the new version numbers of the objects. If all the commits are successful, the coordinator atomically updates the metadata with the new version numbers and releases the lock. However, if a commit to an object is unsuccessful, a subsequent process rolls back the committed objects to the version numbers specified by the metadata.

Abstract: Systems and methods for monitoring business applications are disclosed. Data is provided from an application programming interface (API) in a monitored application to a collection runtime. The collection runtime collects data based upon a data collection model. A current time increment is assigned to the collected data. The collected data is provided as a stream of event data to an event processing service, which performs one or more queries on the data stream. The results of the queries are provided to a data store and/or to a user interface. The data collection model is created from a data collection profile, and the queries are created from an observation model.

Abstract: The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.

Abstract: Aspects of the subject matter described herein relate to business rules. In aspects, an interface is described that allows a user to enter, update, and delete business rules. Once entered, the business rules may be validated and translated into other forms including a form that is executable by a computer system.

Abstract: Handling business process exceptions. A method includes a computing system using a template, causing one or more operations to be performed to determine a problem that caused a business process exception. The computing system uses a template to cause one or more operations to be performed to perform one or more repair operations to address the business process exception. The computing system uses a template, to cause one or more operations to be performed to take action on the business process exception.

Abstract: The subject disclosure relates to lifecycle management for business models associated with a business application as well as implementations of the business models. As described herein, a framework is provided in which business models can be built using modeling tools. The framework defines a separation of models from implementations and their relationships. Support is provided for translation of a business model to an implementation automatically and/or manually using development tools. Further embodiments herein define relationships of models to their implementations at various levels of granularity. Relationships can be defined and maintained at various granularity levels of a business application with different addressable granularity of an implemented application. These relationship associations can be used as described herein for tracking and managing changes in an implementation that may affect an associated model and vice versa.

Abstract: Special lists can be used to perform fast ranked searching of documents containing key terms. The special lists are distinguished from basic inverted indices because they contain a ranking of only a predetermined number of documents that may be identified in the index. During a search, search engines can utilize the special lists to perform fast ranked searching without having to redundantly search through the entire corpus or index of documents available to the search engine. Rather, the search engine can search only the documents listed in the special list, thereby saving the time and resources required to perform the search. The search engine can also be configured to search a combination of the special lists and the index to provide users selective control over the balance between the accuracy and speed of the search.

Abstract: The subject invention pertains to database reverse query matching. A text document can be received and analyzed to determine which, if any, queries the document matches. To enable such functionality, a number of intermediate structures such as tables are generated in accordance with designated queries. In particular, a canonical table can be generated that specifies the expressions or phrases as well as match rules. Furthermore, a Boolean table can be generated that specifies the Boolean relationship of expressions in canonical table. A match component or methodology can match text phrases to query phrases identified by the canonical table. An evaluation component or related methodology can subsequently utilize the Boolean table to determine if the preliminary phrase matches match the query logic.

Abstract: The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.

Abstract: The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.

Abstract: Special lists can be used to perform fast ranked searching of documents containing key terms. The special lists are distinguished from basic inverted indices because they contain a ranking of only a predetermined number of documents that may be identified in the index. During a search, search engines can utilize the special lists to perform fast ranked searching without having to redundantly search through the entire corpus or index of documents available to the search engine. Rather, the search engine can search only the documents listed in the special list, thereby saving the time and resources required to perform the search. The search engine can also be configured to search a combination of the special lists and the index to provide users selective control over the balance between the accuracy and speed of the search.