Abstract: The present invention relates to a system and methodology to assist users with data access activities and that includes such activities as routine web browsing and/or data access applications. A coalesced display or montage of aggregated information is provided that is focused from a plurality of sources to achieve substantially one-button access to user's desired web or data source information/destinations in order to mitigate efforts in retrieving and viewing such information. Past web or other type data access patterns can be mined to predict future browsing sites or desired access locations. A system is provided that builds personalized web portals for associated users based on models mined from past data access patterns. The portals can provide links to web resources as well as embed content from distal (remote) pages or sites producing a montage of web or other type data content. Automated topic classification is employed to create multiple topic-centric views that can be invoked by a user.

Abstract: A first query and a second query, both of which were submitted by a first user to identify information that satisfies a single information need of the first user, are received. The first query and the second query are stored in association with one another and based on a chronological order in which the first query and the second query were submitted by the first user to generate a first query reformulation path. A query is received from a user and more than one query reformulation path is accessed. The received query is compared with queries included in the accessed query reformulation paths to identify a relationship between the received query and a query included in a relevant query reformulation path. One or more prevalent end points is determined based on the relevant query reformulation path and at least one of the prevalent end points is presented to the user.

Abstract: Modeling an electronic data interchange (EDI) document using extensible Markup Language (XML) at runtime. A plurality of structural elements is identified in the EDI document. A plurality of corresponding data values is identified from the identified plurality of structural elements in the EDI document. A plurality of annotations is generated for a plurality of rules included in the EDI document. The plurality of rules defines operations associated with the plurality of corresponding data values. The determined data values and the generated annotated is transformed into an XML schema corresponding to the EDI document. The XML schema is processed at runtime.

Abstract: The present invention provides a method and a system for identifying relevant information in a data set. The method involves the identification of nodes of interest in a tree structure. A node of interest is a node that contains information, which is relevant to a pre-defined context. The method further involves the step of iteratively extracting sub-trees from the tree structure and identifying records in the extracted sub-trees. The sub-tree is a hierarchical structure that shows the relationship of each node of interest with its ancestor nodes in the tree structure. Each record is a group of sub-tree nodes and contains at least one node of interest.

Abstract: Strategies are described for navigating through a database of media resources. The strategies present a user interface presentation that employs different display paradigms depending on the type of media resource being investigated. If the consumer is interrogating a media resource that has different associated “child” resources associated therewith, then a first kind of user interface presentation may be appropriate. If the consumer is interrogating a media resource that is a standalone resource having no child resources, then a second kind of user interface presentation may be appropriate. Still other kinds of display paradigms are possible.

Abstract: A request is received from a requestor over a computer network and compared to a plurality of triggers associated with a plurality of layout configurations. One of the layout configurations is then selected based on the comparison. Next, components are identified for the selected layout configuration. A markup language response (e.g., HTML) is created that includes a markup language version of each of the identified components. The markup language version for at least one of the identified components is based upon a query answer that corresponds to the request. The markup language response is returned to the requestor over the computer network where it can be viewed using a browser running on the requestor's computer.

Abstract: Thread synchronization with lock inflation methods and apparatus for managed run-time environments are disclosed. An example method disclosed herein comprises determining a locking operation to perform on a lock corresponding to the object, performing an optimistically balanced synchronization of the lock if the locking operation is not unbalanced, and modifying a lock shape of the lock if the locking operation is unbalanced.

Abstract: A method and system is provided for automatically presenting search results from user-created search verticals or search macros in response to general web-search queries. A general web-search query is received and a set of user-created search verticals is initially identified using keywords contained in the query. A subset of target user-created search verticals is identified using factors such as whether the user has installed a tab for a particular vertical in a customized user interface, whether the search query has been used in a particular search vertical with a high frequency, and an overall or query-specific customer satisfaction rating for a particular search vertical. The search results can be presented as inline answers or inline suggestions on a common display with general search results obtained for the general search query.

Abstract: A database management system predicts a selectivity for database query conditions requiring a join of records from different tables. The system identifies at least one skewed value in a field specified in the join condition, and constructs, for each skewed value, a set of hypothetical query predicates in which the field specified in the join condition is replaced with a constant equal to the skewed value. The system then predicts the selectivity for the hypothetical predicates, using any appropriate prediction technique. The selectivities of the hypothetical predicates are used to predict a selectivity for the original query.

Abstract: A system and method for optimized distribution of files from a file server to a high number of client machines. The client machines are interconnected as nodes in a binary tree structure with each level of nodes receiving the files from a higher level and transferring to a lower level. The file server is the root node of the tree. A database is arranged to store the tree structure information, register new client machines requesting file transfer, and determine lowest cost paths for new links within the tree structure. The lowest cost paths are determined based on cost parameters assigned to network switches between nodes of the tree. Each client machine acting as a child node is arranged to receive the files from a parent node as the files are stored in the parent node, and disconnect from the parent node upon receiving all of the files.

Abstract: The invention provides a method and system to compare data objects. Each data object is converted into a directed acyclic graph forest, which comprises one or more directed acyclic graphs. The directed acyclic graph forests corresponding to data objects are then compared to calculate a similarity score between the data objects. The similarity score is then used as a measure to determine the extent of similarity between the data objects.

Abstract: A lookup is performed using multiple levels of compressed stride tables in a multi-bit Trie structure. An input lookup key is divided into several strides including a current stride of S bits. A valid entry in a current stride table is located by compressing the S bits to form a compressed index of D bits into the current stride table. A compression function logically combines the S bits to generate the D compressed index bits. An entry in a prior-level table points to the current stride table and has a field indicating which compression function and mask to use. Compression functions can include XOR, shifts, rotates, and multi-bit averaging. Rather than store all 2S entries, the current stride table is compressed to store only 2D entries. Ideally, the number of valid entries in the current stride table is between 2D?1 and 2D for maximum compression. Storage requirements are reduced.

Abstract: A method for transparently navigating through exported file system namespaces on a server using a single mount. When an exported file system is mounted onto a client, the client creates a file system ID structure for the exported file system, wherein the file system ID structure is populated with unique properties of the exported file system, and wherein the unique properties include a file system ID. The client also creates an internal virtual file system structure for the exported file system ID structure, wherein the internal virtual file system structure includes a virtual file system ID. Once the file system and virtual file system structures are created, the client links the file system objects created within the mount to the file system ID structure until a user moves from one exported file system to a second exported file system and a new file system ID is detected.

Abstract: A database management system predicts a selectivity for database query conditions requiring a join of records from different tables. The system identifies at least one skewed value in a field specified in the join condition, and constructs, for each skewed value, a set of hypothetical query predicates in which the field specified in the join condition is replaced with a constant equal to the skewed value. The system then predicts the selectivity for the hypothetical predicates, using any appropriate prediction technique. The selectivities of the hypothetical predicates are used to predict a selectivity for the original query.