Abstract: A file system includes first, second, third, and fourth directories where the first and second directories are sub-directories of the third directory, the third directory is a sub-directory of the fourth directory, the first directory stores only files identified by a first file extension, the second directory stores only files identified by a second file extension, and the first and second file extensions are distinct. A method involves receiving first and second requests to open first and second files, respectively, that are contained in the file system. The first and second requests include first and second file system paths, respectively. The first file system path is modified by adding identities of the first, third, and fourth directories to the first file system path. The second file system path is modified by adding identities of the second, third, and fourth directories to the second file system path.

Abstract: Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a patricia tree having leaf keys and pattern search control blocks containing a prefix and either an end-of-trail leaf or a pointer to another of the pattern search control blocks, by placing each of the prefixes in a tree prefix table; searching for a key in the tree; searching for the key in the prefix table if the tree searching does not find the key in the tree; confirming that the key is deleted if the key is not found in the prefix table; deleting the key from one of the pattern search control blocks; and collapsing the patricia tree by eliminating the left most pattern search control block from the patricia tree if the patricia tree searching finds the key.

Abstract: Techniques are provided for lock management. The techniques are based on an enhanced lock management system that generates a semantic response in response to lock requests for a resource. The semantic response communicates both the underlying cause blocking the request, and information that may be used by the requester to obtain notification of when the underlying cause should no longer lead to denial of the lock request. The semantic response may be generated by the master of the resource, who provides the semantic response to the local lock manager of the lock requester. The semantic response may be retained by the local lock manager so that the semantic response can be provided to subsequent lock requesters, without need for interacting with another lock manager on another node.

Abstract: Provided is a system and method for updating a plurality of the same files consistently. The file update system comprises a first and a second data servers formed as pipe line type network for storing an original file and a duplicate file of the original file respectively, and for updating both the original file and the duplicate file in response to an update request, wherein the first and the second data servers mutually exchange file update information, correct the file update information so as to prevent overlapped update due to a plurality of update requests for the same file, and then update the original file or the duplicate file according to the corrected file update information.

Abstract: A search support apparatus estimates, based on a document and a specific phrase (keyword) in the document, a theme of the document, a site type of a website that provides the document, and a content type of the document, and selects a search condition corresponding to the theme, the site type, and the content type, to be presented to the user.

Abstract: Techniques for analyzing keyword data for quality management purposes are provided. One or more keywords are selected. Each of the one or more keywords represent a category of quality management. A keyword time series is prepared for each of the one or more selected keywords. A set of fixed form time series is prepared for each of the one or more selected keywords. The set of fixed form time series comprises one or more fixed form time series representing statistical data related to the one or more selected keywords. One or more correction sets comprising one or more correction parameters are obtained. Each of the one or more correction parameters correspond to one of the one or more fixed form time series within each set of fixed form time series. A set of corrected time series is generated for each of the one or more correction sets.

Abstract: A network-based file access system obtains an identifier for a resource stored on a remote storage system to an application. The application can use the identifier to pull the contents of a file associated with the identifier or to push contents of a file to a folder associated with the identifier.

Abstract: Techniques for processing a query that includes a path expression are provided. A query processor determines whether an XML index may be used to execute the query instead of having to scan multiple XML documents. The query is parsed and normalized, which results in multiple normalized path expressions that are based on the original path expression. If the XML index is a path-subsetted index, then the query processor generates annotated path expressions based on the normalized path expressions. The query processor determines whether each of the annotated path expressions is satisfiable by the path-subsetted XML index. If so, then the XML index is used to process the query.

Abstract: An indexing system, including a server for providing access to at least one site, a server agent for creating an index file of data relating to the site, and a central index for storing index information from the index file. The server agent initiates communication with the central index to transfer the index file from the server agent to the central index.

Abstract: A database spread over multiple nodes allows each node to store a journal recording changes made to the database and also allows a journaling component to manage the memory space available for journaling. Two threshold size values may be specified for the journal. The first threshold value specifies a journal size at which to being pruning the journal on a given node. A journal pruning algorithm may be used to identify journal entries that may be removed. For example, once a given transaction completes (i.e., commits) the journal entries related to that transaction may be pruned from the journal. The second threshold value specifies the maximum size of the journal. After reaching this size, journal entries may be written to disk instead of the in-memory journal.

Abstract: A database spread over multiple nodes allows each node to store a journal recording changes made to the database and also allows a journaling component to manage the memory space available for journaling. Two threshold size values may be specified for the journal. The first threshold value specifies a journal size at which to being pruning the journal on a given node. A journal pruning algorithm may be used to identify journal entries that may be removed. For example, once a given transaction completes (i.e., commits) the journal entries related to that transaction may be pruned from the journal. The second threshold value specifies the maximum size of the journal. After reaching this size, journal entries may be written to disk instead of the in-memory journal.

Abstract: A mechanism minimizes the management issues of the participant objects of the logical target set, such as an application set. The mechanism maps the current physical implementation. The mechanism then identifies the target and extraneous object set locations to facilitate isolation. Thereafter, the mechanism optimizes the logical target set placement for best manageability and performance. The mechanism minimizes the management issues by providing a small application footprint. This is accomplished by placing the object set on the fewest necessary volumes to facilitate both application performance and independence of administrative action.

Abstract: In a system and method for organizing database search criteria match results which are generated through a search engine adapted to generate system databases upon the processing of search criteria established and submitted by a system user, the system is adapted to define and group the search criteria match results for presentation to the user based upon the relative emphasis or de-emphasis of such results. The system includes a context software module, for enabling the generating of a context database consisting of content, links, and layouts organized for presentation to the user, which module is adapted to determine and specify the context database based on a current context and settings. The system also includes a criteria software module for enabling the generating of a comparison database, adapted to enable criteria to be submitted, modified, and input by the user to generate comparison database information.

Abstract: A system for determining the intent of query that includes a search engine that receives a first search query, a query/click log module configured to store log data associated with the first search query; and a computational module that generates metric values associated with the first search query based on the log data and that determines that the first search query is one of a regional specific query or a global query based on the metric values, where the metric values reflect a likelihood of local intent of the first search query, and where the search engine provides search results selected in part based on the metric values.

Abstract: Methods, systems and computer products perform cost estimate to determine an efficient approach to answer a query according to one of several unified query plans. One unified query plan involves querying an unstructured database, referencing a unified index, and probing a structured database based on matches discovered in the unified index. The results of the unstructured database query are used to lookup entries in a unified index associated with the structured database. Then the structured database is probed by querying only the subset of the structured database gleaned from the unstructured database query.

Abstract: Classifying Uniform Resource Identifier (URI) expression using one or more XPath expressions. A request comprising a URI expression and additional network information is modeled as a logical XML document representation. One or more XPath expressions are then created from the schema of the logical XML document. Each of the one or more XPath expressions represents a classification category of the request. Further, an XML document is generated from an incoming request. One or more XPath expressions are evaluated on the XML document for classifying the incoming request.

Abstract: A system, method and medium for browsing media content using meta data, in which media content stored in the system is efficiently browsed using meta data of media content currently in use and media content related meta data. The system includes a media reproducing unit to reproduce media content having corresponding meta data, a root category generating unit to generate at least one root category from meta data corresponding to the media content currently in use, and a sub-category generating unit to generate at least one sub-category of a root category selected by a user from among the at least one root category, based on the meta data.

Abstract: Method, system and article of manufacture for scheduling queries. In particular, the scheduling options made available to a user for a particular unit of work are determined dynamically at the time of scheduling. In this way, the execution cost, for example, of a particular unit of work can be taken into account when determining which scheduling options to make available. In addition, or alternatively, system availability and/or user parameters may be accounted for when determining which scheduling options to make available.

Abstract: A system for sequentially opening and displaying files in a directory, including a processor, at least one directory including a plurality of electronic files, software executing on the processor for receiving a request to open and display a first one of the plurality of electronic files, software executing on the processor for receiving a next file request, and software executing on the processor for opening a next file in the at least one directory upon receiving the next file request.

Abstract: Methods and apparatuses for searching network data for one or more predetermined strings are disclosed. In one embodiment, the string search is a multi-stage search where the stages of the search are performed by different hardware components. In one embodiment in a first search stage, a first processor performs a comparison of blocks of incoming data to determine whether the blocks potentially represent the beginning of one of the predetermined strings. If a potential predetermined string is identified, a second processor performs a further search to determine whether the string matches one of the predetermined strings. Because the first processor searches only for the beginning of the predetermined strings, the first stage comparison can be performed quickly, which improves network performance as compared to more detailed searching. The second stage is performed by second processor, which allows the first processor to search for potential matching strings.