Abstract: A system for calculating the importance of web pages is provided. The web pages are organized hierarchically into collections. The system calculates the importance of each collection based on inter-collection links from a web page in one collection to a web page in another collection. The system then calculates the importance of web pages in the collections with a high calculated importance based on links between the web pages in those collections using, for example, a conventional page rank algorithm. The system may also calculate the importance of web pages in each collection with a low calculated importance separately based on the links between the web pages in the collection using, for example, a conventional page rank algorithm.

Abstract: A method is disclosed for identifying queries stored in a log which are semantically related to an input query that may include a large number of terms. A set of one or more subsequences are generated for each query stored in the log, and these sets of subsequences are stored in a lookup table. A set of one or more subsequences are also generated for the input query. The subsequences in the lookup table and of the input query are generated by hashing of the respective query terms to a value between 0 and 1 using a known technique of min-hashing. The present system then constructs the subsequences of the query using the k-min hashes of the query, where k is an integer based on the number of terms in the query.

Abstract: Systems and methods for performing a directory search are described. In one described system, a computer program receives a first search query and causes the first search query to be executed on a directory. The program generates a second search query associated with the first search query and causes the second search query to be executed on a local data store. The program then obtains a first result from the directory, obtains a second result from the local data store, and generates and outputs a result set, the result set comprising the first result and the second result.

Abstract: A method for processing queries for a document of elements is provided. The document includes a plurality of subsections where each subsection includes at least a portion of elements in the document. The method comprises: receiving a query for a path of elements in the document of elements; determining a plurality of step queries from the query, each step query including at least a part of the path of elements; for each step query in the plurality of step queries, determining one or more subsections that include elements that correspond to a step query; and determining at least one subsection that includes the path of elements of the query. A result for the query is generated using the at least one subsection.

Abstract: Records representing items in a dimensionally-modeled fact collection are assigned to bins. A count-based portion of a user interface receives user bin assignment specification of the records based on user-specified counts of records. Actual counts for bin assignment are determined by constraining records having a same data value at a specified particular dimension to be within the same bin. A user-observable indication of the determined actual counts is provided. The user interface may include a value-based portion. The value-based portion of the user interface may be operated to receive user indication of bin assignment specification of records based on user-specified at least one value at the particular dimension. Determining actual counts includes reconciling the user indication of bin assignment specification in the count-based portion with the user indication of bin assignment specification in the value-based portion.

Abstract: Embodiments of the present invention include a method for performing a data uniqueness check in a set of sorted data blocks comprising accessing data to be inserted into the set of sorted data blocks, determining a proper data block of the set of sorted data blocks for which the data to be inserted should be located based on a first sorting key. The method further includes examining the proper data block for an existing data entry and if the proper data block is empty, the method further includes inserting the data to be inserted into the proper data block of the set of sorted data blocks.

Abstract: A garbage collection system that needs to meet real-time requirements uses an eager read barrier that performs a forwarding operation as soon as a quantity is loaded. The barrier maintains a to-space invariant by including a forwarding pointer in the header of objects to be moved or accessed that normally points to the object itself. However, if the object has been moved, the forwarding pointer points to the new object location. The eager read barrier maintains the registers and stack cells such that the registers and stack cells always point into to-space. Barrier-sinking and common sub-expression elimination are used to minimize the overhead associated with the read barrier.

Abstract: Techniques and systems are disclosed for storing instances of an opaque type in a database according to a direct path loading approach. According to one aspect, an opaque type implementor registers, with a loader application, routines that the opaque type implementor implements. In response, the loader application associates the opaque type with the routines. The loader application reads data that comprises instances of the opaque type. The loader application determines which routines are associated with the opaque type. The loader application invokes the routines, which create an array for storing instances of the opaque type and populate the array with values specified in the data. The loader application converts the array into a data stream that conforms to the format of the database's data blocks. The loader application then streams the data to a database server, which writes the data directly into data blocks in the database.

Abstract: A similarity detector detects similar or near duplicate occurrences of a document. The similarity detector determines similarity of documents by characterizing the documents as clusters each made up of a set of term entries, such as pairs of terms. A pair of terms, for example, indicates that the first term of the pair occurs before the second term of the pair in the underlying document. Another document that has a threshold level of term entries in common with a cluster is considered similar to the document characterized by the cluster.

Abstract: Methods, systems, computer program products, and methods of doing business whereby managed resources and/or data are identified using a model based on object-oriented techniques. A resource hierarchy is defined for a set of resources/data to be managed, and naming rules are associated with classes in this hierarchy. The naming rules for a particular class describe how to uniquely identify resources of that class among more than one management system and in a way that is independent of the management system. The identities are structured strings created using the naming rules of the class to which the resource/data belongs. Structural restrictions placed on the structured strings allow any two identities to be compared for equality (using, for example, a simple string comparison).

Abstract: A computer implemented method, an apparatus, and computer usable program product for identifying a defective product is provided. A data processing system identifies a product status for products comprising at least one range of serial numbers. The data processing system then narrows the at least one range of serial numbers using a range flattening algorithm. The data processing system then applies a conditional mask algorithm to the at least one range of serial numbers to narrow the at least one range of serial numbers.

Abstract: A system and method facilitating asset composition based, at least in part, upon metadata (e.g., asset specification) describing compositional property(ies) of the asset(s) is provided. Asset specification(s) (e.g., metadata) that describe asset(s) to efficiently search and/or match asset(s) are employed. The system can facilitate matching (e.g., automatically) the particular software component to available server(s). Thus, the system can provide a flexible manner of describing asset(s) and an efficient way of locating matching description(s).

Abstract: Techniques are presented for automatic search query generation and results set management. A searcher makes selections from metadata; the metadata is associated with a particular lexicon or industry. Furthermore, the selections are mapped to fields associated with a data source. A thread-safe or unique search query is generated in response to the fields. The thread-safe search query is in a query language format which can query the data source. In an embodiment, the thread-safe search query is executed against the data source and the results returned are customized to rank the results, to sort the results, to filter the results, and/or to acquire a random sampling of the results.

Abstract: A method of accessing a shareable computer file includes receiving a request to access the shareable computer file, retrieving a file ID from a stub file corresponding to the shareable computer file, retrieving a file name from a database corresponding to the file ID, accessing the shareable computer file if a user has not modified the shareable computer file, and accessing a modified copy of the shareable file stored in the stub file if the user has modified the shareable computer file. A database is generated in operating system space or accessed using the operating system, and includes file IDs and their corresponding file names for shareable computer files. The stub file is generated locally to correspond to the shareable computer file, and includes a modified copy of the shareable computer file if the shareable computer file has been modified, and a link to the shareable computer file if the shareable computer file has not been modified.

Abstract: When a start key is operated, an inferring process of estimating a demand of a user is executed on the basis of preset situation data, a user profile, and situation data manually input via a situation setting key. Based on the inference result, a genre list and a contents list are reconstructed so that genres and contents items are arranged in order of the degree of a demand of the user. The top three genres extracted from the reconstructed genre list are associated with three selection keys, and the names of the associated genres or labels of the genres are displayed in genre name display parts. It enables the user to easily and instantaneously select one of contents items to be processed.

Abstract: The present invention provides methods, systems and apparatus for integrating browser-incompatible information in a Web content file and for displaying the information on a computing device of a browser environment. A Web content providing means is capable of providing the Web content file, and performs the following steps: receiving the Web content file that comprises an element having a remote procedure call (RPC) request generating instruction for generating an RPC request from the browser environment; interpreting the Web content file for displaying on the browser environment; interpreting the RPC request generating instruction to generate the RPC request; transmitting the RPC request to a data server indicated in the RPC request generating instruction of the element; receiving response data from the data server; and modifying the displaying of the Web content file on the browser environment by the response data.

Abstract: Systems and methods for analyzing the content of online conversations using data mining technologies are provided. Methods and systems for utilizing the results of data mining technology implementation to retrieve relevant advertising content and/or other relevant information for display in association with the content of an online conversation are also provided.

Abstract: A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are scored on content, and a set of pages is selected, the selected set of pages having scores greater than a first predetermined threshold. The selected set of pages is scored on connectivity, and a subset of the set of pages that have scores greater than a second predetermined threshold are selected as related pages.

Abstract: A solution is provided wherein multiple instances of source data measures are displayed in individual cells by utilizing a slicing mechanism that allows the user to select a range of values for certain dimensions known as slicers. The source data measures to be displayed in a cell may then be filtered using these ranges of values for the slicers, and then displayed inside the cell.

Abstract: Techniques are provided for detecting lost writes so that data corruption can be avoided. According to one technique, lost writes are detected by comparing version numbers that are indicated in redo log entries with version numbers that are indicated in corresponding blocks in a standby database. According to one technique, which may be used in conjunction with the above technique, lost writes are detected by logging read operations that occur relative to a primary database, and comparing version numbers that are indicated in read log entries with version numbers that are indicated in corresponding blocks in a standby database. According to one technique, lost writes are detected by comparing, in response to read operations, (a) version numbers that are stored in a persistent in-memory cache with (b) version numbers that are indicated in corresponding blocks that are read from a primary database.