Abstract: Methods and apparatuses to cancel database queries from a web application user interface in a networked database application. In one embodiment, the method includes receiving a user request to cancel a query previously sent to a database and calling an application programming interface (API) provided by the database to terminate one or more statements running on the database, the one or more statements being related to the query.

Abstract: The present disclosure describes a standardized logical model architecture, for use in building a business intelligent systems, and a system and method of using the logical model architecture to populate a data repository (e.g., a data mart/warehouse) with the data to satisfy reporting and data analysis needs.

Abstract: The invention comprises a set of complementary techniques that dramatically improve enterprise search and navigation results. The core of the invention is an expertise or knowledge index, called UseRank that tracks the behavior of website visitors. The expertise-index is designed to focus on the four key discoveries of enterprise attributes: Subject Authority, Work Patterns, Content Freshness, and Group Know-how. The invention produces useful, timely, cross-application, expertise-based search and navigation results. In contrast, traditional Information Retrieval technologies such as inverted index, NLP, or taxonomy tackle the same problem with an opposite set of attributes than what the enterprise needs: Content Population, Word Patterns, Content Existence, and Statistical Trends. Overall, the invention emcompasses Baynote Search—a enhancement over existing IR searches, Baynote Guide—a set of community-driven navigations, and Baynote Insights—aggregated views of visitor interests and trends and content gaps.

Abstract: The subject invention relates to systems and methods that perform consistency checks of user defined type (UDT) fragments utilizing a stream of data without wholesale copying of the data. Streaming consistency checks facilitate discovering invalid fragments as soon as possible such that the entire UDT fragment does not have to be read, stored, analyzed, etc. Additionally, a UDT fragment can be evaluated without being completely materialized; thus, systems and/or methods employing the subject invention can yield improved performance as compared to conventional techniques by reducing required resources and enabling faster detection of invalid structures.

Abstract: The invention comprises a set of complementary techniques that dramatically improve enterprise search and navigation results. The core of the invention is an expertise or knowledge index, called UseRank that tracks the behavior of website visitors. The expertise-index is designed to focus on the four key discoveries of enterprise attributes: Subject Authority, Work Patterns, Content Freshness, and Group Know-how. The invention produces useful, timely, cross-application, expertise-based search and navigation results. In contrast, traditional Information Retrieval technologies such as inverted index, NLP, or taxonomy tackle the same problem with an opposite set of attributes than what the enterprise needs: Content Population, Word Patterns, Content Existence, and Statistical Trends. Overall, the invention emcompasses Baynote Search—a enhancement over existing IR searches, Baynote Guide—a set of community-driven navigations, and Baynote Insights—aggregated views of visitor interests and trends and content gaps.

Abstract: A system and method for managing a plurality of server nodes. In one embodiment, the server nodes are organized as “instances.” Each instance includes a group of redundant server processes (e.g., J2EE server nodes) and a dispatcher process (e.g., a J2EE dispatcher node) for distributing service requests to one or more of the server nodes. In addition, a central message passing architecture is defined which allows the various instances to communicate with one another. In one embodiment, a hierarchical configuration data object is stored within a database and is centrally accessible by all of the servers from all of the instances. The hierarchical configuration data object organizes configuration data and binary data in a logical hierarchy which simplifies server node management in an enterprise network. At the bottom of the logical hierarchy, configuration parameters are stored within a property sheet data structure.

Abstract: Techniques for using both database internal and database external authorization information to control access to a database are disclosed. Corporate accounts which are generally used in many corporate environments (e.g., operating system accounts) can be defined as “external” database accounts with database external authorization information that define database external access privileges for a database. The database external access-privileges are used in conjunction with a set of complementary database “internal” access privileges defined for database internal accounts. An integrated access-privilege set is generated and used as a single source to authorize access to a database regardless of whether database internal or external accounts are used to access the database. As a result, databases can be integrated with various non-database entities (e.g., corporate computing systems).

Abstract: Media data files stored in a first computing device are transcoded for transferring to a second, portable computing device. The device parameters of the second computing device are determined by determining the type of the second computing device, and selecting one from a plurality of sets of predetermined, pre-stored device parameters for different types of second computing devices, based on the type of the second computing device. A selected media data file is transcoded in accordance with the determined device parameters of the second computing device, regardless of whether the second computing device is connected to the first computing device. When the second computing device is connected to the first computing device, the transcoded media data file is transferred from the first computing device to the second computing device.

Abstract: A method is disclosed to efficiently manage membership within a hierarchical data structure. A record module is included to create a record that includes a member identifier, a member type, and an ancestor list for a member of a hierarchical data structure. The member type identifies the member as resource or a group comprising at least one resource, and the ancestor list comprises group identifiers ordered to represent a hierarchical relationship between the member and a top-level group. A storage module is included that stores the record in a collection. A reference module is included that references the record in response to accessing the member of the hierarchical data structure.

Abstract: A method for dynamically setting up collaborative associations between a group of users, computing resources, and/or communication devices, where the constituents of the collaborative association are chosen based on a variety of contextual criteria. The dynamic collaboration enabler component determines the explicit identities of the parties that should be a part of the collaboration. The group of individual entities involved in the collaboration can change dynamically during the lifetime of the collaboration, based on appropriate changes in the contextual data. Such contextual data refers to both state variables associated with the collaboration software or infrastructure itself, or to the state of entities external to the collaboration. The duration of the collaborative association is specified either explicitly or through a set of context related conditions.

Abstract: Methods and computer program products are disclosed for generating and viewing an electronic report having security features that allow for “virtual bursting” of the report for multiple users. A single report having multiple pages is generated such that each or some of the pages have security tags that are compared to a security identifier list of a particular user that acts as a security clearance for that user. Through this comparison, a subset of pages from the report is formed which makes up a “report” from the user's point of view that contains only data the user is allowed to see. This allows multiple users to view only authorized portions of a single report having page-level security determined by level breaks in the data.

Abstract: The subject invention provides a system and/or a method that facilitates mapping a data base model to a database object. A type storage system can utilize a storage mapping of a file storage data model. The mapping can describe the database object created based at least in part upon a schema and how instances of the type described in the schema are stored and/or accessed. Furthermore, a query can be provided to find at least one of an item, a document, and/or a contact that satisfy at least one criterion. The type storage system can receive data, wherein the data is at least one of a schema, a data model, a type, a query, and query criteria via an interface to provide the storing and querying. Additionally, the type storage system can generate a view that exposes at least one instance of the type.

Abstract: Schema information is provided with transmission of a data object. When a data object is converted to a transmission format, schema information for the object type is added to the transmission format element. The unmarshaling code uses the schema information to update a schema registry at the receiving end. The schema registry is used as a tool for converting the transmission format element back to the data element. The next time an object of that object type is sent to the recipient, the schema information is not added to the transmission format element.

Abstract: In accordance with aspects of the present invention, provided are methods for incrementally estimating the cardinality of a derived relation including statistically correlated partially applicable predicates for a range-partitioned table. During the generation of a QEP a cardinality estimate is calculated in which one or more partially applicable predicates is correlated to another partially applicable predicate and/or to one or more fully applicable predicates. The cardinality includes a number of rows expected to be returned by the QEP and is computed in an incremental fashion for each operator of the QEP.

Abstract: A method and system for ranking messages of discussion threads based on relationships between messages and authors is provided. The ranking system defines an equation for attributes of a message and an author. The equations define the attribute values and are based on relationships between the attribute and the attributes associated with the same type of object, and different types of objects. The ranking system iteratively calculates the attribute values for the objects using the equations until the attribute values converge on a solution. The ranking system then ranks the messages based on attribute values.

Abstract: A computer system performs data processing using a data organizer which parses a primary set of data into predefined sets of data components according to one or more enterprise models. The sets of data components from the data organizer are respectively stored in multiple data sources. The data components may be stored as a binary file or hierarchical file. A plurality of data processing systems execute the enterprise models. A task manager controls which enterprise model executes on each data processing system. The data processing systems access the data components from the data sources which correspond the executing enterprise model. The data components are sent over dedicated communication channels to the data processing systems. Each data processing system may have a data interface, which is configured to receive data from different sources and convert the data into a standard format.