Abstract: Methods and systems for ranking analysis results based on user perceived problems of a database system are described. During operation, an embodiment may receive a designation of a perceived database system performance problem from a user, wherein the problem is associated with one or more database system metrics. Next, the embodiment may determine a set of recommendations for alleviating the perceived database system performance problem. The embodiment may then analyze the set of recommendations to determine, for each recommendation in the set of recommendations, an impact the recommendation is expected to have on the one or more database system metrics. Finally, the embodiment may rank the set of recommendations according to the impact each recommendation is expected to have on the perceived database performance problem.

Abstract: Systems and method of the present invention provide for one or more server computers configured to identify, within a database transaction log, a dynamic website content in a database and a command modifying the dynamic website content, write the dynamic website content and the command modifying the dynamic website content to a website repository as a delta, receive a request to reverse the command modifying the dynamic website content, identify, within the delta, the command modifying the dynamic website content, and generate and execute a database query configured to reverse the command modifying the dynamic website content.

Abstract: Some embodiments of the present invention include determining at least one input requirement of a dynamic object and associating the at least one input requirement with a group of related information in a database. The dynamic object may then be configured to operate based on information being accessed from the group of related information. This may include configuring the software code associated with the dynamic object to reflect each information as it is being accessed from the group of related information.

Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks can be utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that can be serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: Techniques are described for automatically mining query dimensions from web pages resulting from execution of a search query. Lists of items such as words, terms, or phrases are extracted from the web pages based on the recognition of free text, metadata tag, or repeated region patterns within the web page text. Extracted item lists are weighted according to document matching and/or inverse document frequency, and item lists are clustered based on shared or similar items within the lists to generate query dimensions. The generated query dimensions, and the items within each query dimension, are ranked according to quality, and high-quality query dimensions are provided for display alongside top search results.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: A method for defining a relevant area for displaying advertisements based on a category of a user search is disclosed. The method includes receiving a search request from a user; determining a business category based on the search request; determining a location associated with the search request; determining business category density information based at least on the determined business category and the location associated with the search request; determining an extent based on business category density information for the location; determining local content to provide to the user based at least in part on the determined extent, the business category, and the location; and providing for display to the user the local content, wherein the local content is provided to the user in addition to the search results. The location may be explicitly included in the search request, associated with responsive search results, or associated with the search request.

Abstract: Embodiments disclosed herein relate to systems, methods, and computer program products for transforming an unstructured database into a structured database. In some embodiments, the system and method imports an unstructured database comprising entities and a hierarchy associated with the entities. The system and method analyze the unstructured database, flatten the database so that a recursive database is converted into a database that fully expands all entities into lower levels, and identifies instances of unbalanced or ragged hierarchies. The system populates the database according to predetermined rules to address the unbalanced or ragged hierarchies and outputs a structured database that can be used for accurate analysis of the hierarchy and entities stored therein, such as corporate structure hierarchies or stock inventory hierarchies.

Abstract: To enable tracking of a document's history, each time an electronic document is opened, an embedding module obtains one or more document history parameters. The document history parameters may include a MAC address or the computer used to open the document, an operating system, a file size of the document, time of opening the document, a user ID, etc. The embedding module encrypts the document history parameters and embeds them into the document, for example using steganography techniques.

Abstract: Systems and methods are disclosed that identify users of a media distribution system that tend to consume popular media items prior to such media items gaining popularity. For example, a set of early adopters may be identified that tend to listen to music associated with particular artists before such artists become popular. The systems and methods disclosed may also utilize identified early adopters to determine relatively obscure or unpopular media items (or creators thereof) that are likely to become popular in the future. Illustratively, an obscure artist whose content is commonly consumed by early adopters can be identified as potentially achieving widespread popularity in the future. These media items predicted to become popular or media item creators may then be recommended to other users of the media distribution system.

Abstract: A system and method and apparatus of enabling the detection of re-occurrence of an event in an audio-video broadcast is herein described. Further a system, method and apparatus to insert the most appropriate s “event sound” is also discussed herein. A apparatus using the methods is also disclosed herein.

Abstract: Systems and methods are provided for using metadata to efficiently access object data from two or more storage components. Control circuitry receives a request from a host device to perform an operation on a uniquely identified object in a storage system comprising at least a first storage component and a second storage component. Control circuitry retrieves metadata information about the location of the object in store, wherein the metadata information comprises a first indication of a location of the object in the first storage component and a second indication of a location of the object in the second storage component. The objects in one or both of the first and second storage components are located based on the retrieved metadata information, and the requested operation is performed on the requested object.

Abstract: A memory controller detects a request, with a key to a data object and a value, to perform an operation. The memory controller locates the data object by mapping the key to a location of the data object in a tiered data structure and identifies a sequence number of the data object. When the sequence number of the data object is greater than a sequence number of a snapshot of the tiered data structure, the memory controller replaces the data object with a modified data object, including the key and the value, and assigns the modified object a unique sequence number. When the sequence number of the data object is less than the sequence number of the snapshot, the memory controller inserts a new data object, including the key and the value, into the tiered data structure and assigns the new data object the unique sequence number.

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for responding to queries. A first user query is received. The first user query is processed including identifying one or more segments in the first user query, a segment representing a word or a phrase. A stand-alone score is determined for each segment of the first user query, wherein the stand-alone score is an indication of a likelihood that the segment represents a stand-alone query and that the segment represents a main topic of the first user query. A historical log of queries is processed to determine query-independent scores for segments that are included in queries represented by the log. The final query-independent scores are used to determine the stand-alone score for each segment of the first query.

Abstract: Search results are provided for mobile computing devices. Search results are retrieved based on a search term. Each of the search results is assigned to one or more categories. The categories and the assigned search results are provided to the mobile computing device. The mobile computing device is adapted to display each of the categories and a partial list of the search results for each of the categories.

Abstract: A non-transitory computer-readable storage medium that stores a file management program for causing a computer to execute a file management process including: transmitting a file search request based on a search condition from a currently operating information processing apparatus to a plurality of other information processing apparatuses, receiving file information searched by the respective other information processing apparatuses, and displaying the file information in the search result; selecting another information processing apparatus to be a transfer source out of a plurality of other information processing apparatuses that store a same file as a file which is selected from the search result, based on the transfer time of the selected file to the currently operating information processing apparatus; and requesting transfer of the selected file to the selected other information processing apparatus to be the transfer source, receiving the transferred selected file and displaying the selected file.

Abstract: An entity-based search system is described herein that detects and recognizes entities in Internet-based content and uses this recognition to organize search results. The system associates one or more entity identifiers with a web page and stores this information as metadata of the page in a search engine index. This metadata will enable entity-based queries as well as rich data presentations in a search engine result page (SERP), including grouping results by entities, filtering results by one or more particular entities, or re-ranking search results based on user preference of entities. Thus, the entity-based search system allows users to identify a particular entity the user is interested in finding, and to receive search results directly related to that entity.

Abstract: In a method for maximizing information content of logs, a log message from an executing software program is received. The log message includes a timestamp, a source code location ID, a session ID, and a log message text. The timestamp, the source code location ID, and the session ID of the log message are stored in a lossless buffer. A hash function value of the session ID is determined. It is determined that the hash function value of the session ID is less than a hash value threshold. The log message text is stored in a session buffer in response to determining that the hash function value of the session ID is less than the hash value threshold, wherein the session buffer contains log message texts of log messages with corresponding hash function values less than the hash value threshold.

Abstract: A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding.