Abstract: Various technologies and techniques are disclosed for searching for and extracting data from databases of content management applications. User input is received to connect to a database or database snapshot of an application, and a connection is established. When the database is not part of a current live instance of the application, an emulation is performed such that the database is treated like it is attached to the current live instance of the application. The user is able to browse and/or search for content, including documents, in the database or database snapshot without having to explore individual site collection structure and user interfaces of individual sites. A site collection user interface (UI), a site selector UI, and/or a list selector UI, for example, provide data entry fields for entering search requirements. Unattached databases can be managed using commands, such as using an object model or command line.

Abstract: Disclosed is a method implemented by a computer system that comprises a file system. The file system comprises first, second, third, and fourth directories wherein 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. In one embodiment, the method comprises receiving first and second requests to open first and second files, respectively, that are contained in the file system. The first and second requests comprise first and second file system paths, respectively. The first file system path comprises a first file name, and the first file name comprises the first file extension. The second file system path comprises a second file name, and the second file name comprises the second file extension.

Abstract: Analyzing backup objects maintained by a de-duplication server. A plurality of first objects may be maintained. Each first object may refer to second object(s) and each second object may refer back to at least one first object. For each respective first object, the respective first object may be analyzed to determine the one or more second objects referred to by the respective first object. Correspondingly, a command may be generated for each respective second object of the determined second object(s), thereby generating a plurality of commands. Each command may be used to verify that the respective second object refers back to the respective first object. The plurality of commands may be sorted into a disk access order. The commands may be used to verify that each second object refers back to first objects that refer to the second object.

Abstract: A server device receives a user request and retrieves, based on the user request, a list of popular topics, a generic ranking score for each topic in the list of popular topics, and a topic profile for a first topic in the list of popular topics. The server device identifies a user profile for the user and determines a personalization score for the first topic in the list of popular topics, where the personalization score for the first topic is based on one or more similarities between the user profile and the topic profile for the first topic. The server device determines a revised ranking score for the first topic in the list of popular topics based on the personalization score and the generic ranking score for the first topic; and ranks the topics in the list of popular topics, using the revised ranking score for the first topic.

Abstract: A method for clustering multi-dimensional data streams includes: when data elements are input, determining 1-D subclusters and assigning identifiers to the determined 1-D subclusters; (b) generating a matching set that is a set of identifiers of the 1-D subclusters where each dimensional value of the data elements belongs to the range of the 1-D subclusters of the corresponding dimensions; and (c) determining subclusters by finding a set of frequently co-occurring 1-D subclusters among a set of 1-D subclusters that belong to the generated matching set. With the present invention, the processing time required to find the subclusters can be improved and the performance of the memory is further improved.

Abstract: A method, including receiving a data source selection from a user or software application, the data source including medical information of a plurality of patients, receiving, from the user or software application, a data pattern that is related to a concept to be explored in the data source, querying the data source to find information that approximately matches the data pattern; and receiving the information from the data source, wherein the information includes unstructured data, assigning a classification to individual parts of the information based on the part's relationship to the data pattern, and outputting the classified information to the user or software application.

Abstract: An event stream processing system includes a versioned data structure layered over a log-structured store. A first address handle points to a first version of data in the versioned data structure. A stream of data updates from a data source create a second version of data in the versioned data structure, addressed using a second address handle.

Abstract: Described herein are techniques for the dynamic allocation of storage capacity between multiple namespaces associated with a storage system. Data from multiple namespaces is stored in a common pool of addresses of the storage system and data from each namespace is capable of being written to any free address of the storage system at any time. Metadata associated with each of the files stored in the storage system is maintained that tracks the particular storage address or addresses and namespace associated with the file. Storage capacity can be dynamically allocated between multiple namespaces by writing data to free blocks and updating the metadata accordingly.

Abstract: A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client.

Abstract: A computer-implemented method and system for enabling communication between networked users based on search queries and common characteristics is disclosed. Particular embodiments relate to receiving a search query from a first user and establishing a communication link between the first user and a second user based on the first user's search query. Particular embodiments relate to receiving a first search query from a first user, receiving a second search query from a second user, determining if the first user and the second user fit within match criteria, and establishing a communication link between the first user and the second user if the first user and the second user fit within match criteria.

Abstract: Embodiments are described for a system for integrating expert sources of knowledge into a general search service. The method can include a general search engine interface to receive a search query with at least one search term from a user. An expert knowledge engine can enable retrieval of expert information and analyzes. A predictive model module can be used to determine a probability that an expert knowledge engine may provide a valuable response to the query. The search query can be routed to the expert knowledge engine based on a cost-benefit analysis. A query reformulation module can reformulate a query for use by the expert knowledge engine. A display module can be employed to combine the expert search results with other search results.

Abstract: A computer-implemented method for repairing system files may include 1) identifying a request to repair a corrupted system file in an operating system, 2) receiving file metadata describing the corrupted system file and system metadata describing the operating system, 3) identifying an uncorrupted version of the corrupted system file by i) identifying a series of matching tests for matching the corrupted system file with the uncorrupted version, the series of matching tests including at least one file metadata item from the file metadata and at least one system metadata item from the system metadata, and ii) applying the series of matching tests in a predetermined order to a database of uncorrupted system files until a matching test matches the corrupted system file with the uncorrupted version of the system file. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with awareness of limited resource usage includes identifying limited resource usage for each possible plan being considered for query execution by a query engine. A determination of whether any possible plan has limited resource usage that does not exceed a threshold level is made, and when at least one possible plan does not exceed the threshold level, the identified limited resource usage is included as a consideration during plan selection by the query engine. In an embodiment, temporary database usage is identified for each possible plan.

Abstract: A distributed file system enables the intelligent storing and retrieval of files among a plurality of storage units. The distributed file system utilizes a metadata data structure to track and manage detailed information about each file, including, for example, the device and block locations of the file's data blocks, to permit different levels of replication and/or redundancy. The distributed file system includes a switch to receive a read request for a file and to send the read request to one of the storage units. Each of the plurality of storage units is operable to monitor access to the file, such that a block cache module is operable to perform a scalable number of packet read aheads, wherein the scalable number is based on at least a current read rate and a current latency of a link to access the at least one file.

Abstract: Methods and apparatus consistent with the invention allow a user to submit an ambiguous search query and to receive relevant search results. Queries can be expressed using character sets and/or languages that are different from the character set and/or language of at least some of the data that is to be searched. A translation between these character sets and/or languages can be performed by examining the use of terms in aligned text. Probabilities can be associated with each possible translation. Refinements can be made to these probabilities by examining user interactions with the search results.

Abstract: Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.

Abstract: A method and apparatus are provided for enhancing the impact of data de-duplication by preferential selection of the master copy to be retained based on current loads and performance metrics of the storage media devices. The computer system is configured to take as input the identified duplicate copies of data and evaluating their locations in storage devices to determine the cumulative affects of retaining one of the identified duplicate copies as a master copy and optionally allocating a new location if needed. Once a master copy has been designated, the remaining identified duplicate copies are removed from storage.

Abstract: According to one embodiment, a storage device includes an interface, a first and second memory blocks and a controller. The interface receives a content search request. The first memory block stores files and inverted files corresponding to contents included in the files. The second memory block stores a file search table. The controller creates the inverted file for each content included in the files and stores IDs of the files including the content in the inverted file. The controller obtains, by search of the content, a corresponding inverted file from the inverted files stored in the first memory block and stores, in the file search table, the IDs of the files included in the obtained inverted file. The controller outputs the IDs of the files stored in the file search table from the interface as a search result for the content search request.

Abstract: An audio playback device and method searches initiates a web search for images related to music or other audio files being played, downloads images from selected web pages returned by the search engine, and outputs one or more images from the selected web pages on a display to enhance the user's listening experience.

Abstract: A system and a method are disclosed for generating, storing, retrieving, and utilizing a search macro or shortcut link to a resource, such as a web site that provides access to an information database. The system may load a page into an application from the resource. The resource may have a Uniform Resource Identifier, and the page may have a search field that causes the application to generate a message when activated. The system may read the Uniform Resource Identifier insert a placeholder into the search field, and activate the search field, which causes the application to generate a message. The system may read the message and parse the message to isolate a search string containing the placeholder. The system may store the search string in a data structure, and may also store the Uniform Resource Identifier and associate it with the search string in the data structure.