Abstract: In one embodiment, the present invention includes a method for allocating a second number of buckets for a hash table shared concurrently by a plurality of threads, where the second number of buckets are logically mapped onto a corresponding parent one of the first number of buckets, and publishing an updated capacity of the hash table to complete the allocation, without performing any rehashing, such that the rehashing can later be performed in an on-demand, per bucket basis. Other embodiments are described and claimed.

Abstract: Techniques described enable creation of a single log containing information from both server-side and client-side logs. A logging service receives page requests and other data from a user operating a computing device. These page requests are then stored in a server-side log. The logging service also receives interactions made by the user on a displayed page. These interactions are then stored in a client-side log separate from the server-side log. The logging service then converts a format of the data in the client-side log and merges the client-side and server-side logs to form a single log. A service provider may then analyze this single log to track how this and other users navigated the pages associated with the page requests.

Abstract: Embodiments of the present invention are directed to systems and methods for providing archival support for one or more services provided by a cloud infrastructure system. One such method comprises receiving a message corresponding to an archive trigger event, and determining based on the message one or more services subscribed to by a customer of a cloud infrastructure system which are to be archived. The method further comprises sending an instruction to the one or more services to archive customer information, and storing each archive in an archive directory accessible to the customer.

Abstract: In some embodiments, a method can comprise accessing one or more neighborhood data structures, at least a portion of the one or more neighborhood data structures are active. In many embodiments, the one or more neighborhood data structures each comprise a label comprising a record identifier, the record identifier corresponding to a specified record of the one or more records, a neighborhood comprising a list of record identifiers for other records linked to the specified record of the one or more records by a pairwise link, and a message for each of the other records linked to the specified record of the one or more records, the message comprising the label and an activity state indicator, the activity state indicator indicating if the neighborhood data structure is active. Other embodiments of related methods and systems are also provided.

Abstract: Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.

Abstract: Methods and apparatus related to identifying a query template that includes one or more terms and a member of an entity category and ranking the query template. Query suggestions may be determined based on the query template. The ranking of the query template may be utilized to determine if the query template is a valid query template. The ranking of the template may be based on at least a count of occurrences of one or more of the entities of the entity category in past queries that conform to the query template.

Abstract: Computer-implemented method for building a web corpus (WCD) comprising the steps of: sending by a web crawler (WC) a query to a reference web crawl agent (RWCA), this query containing a least one identifier of a resource, receiving by the web crawler (WC) a response from the reference web crawl agent (RWCA); if this response does not contain the resource identified by the identifier, downloading by the web crawler (WC) the resource from the website (WS) corresponding to the identifier and adding the resource to the web corpus (WCD; and if this response contains the resource identified by the identifier, adding the resource to the web corpus (WCD).

Abstract: A system and computer-implemented method for automating data warehousing processes is provided. The system comprises a code generator configured to generate codes for Extract, Transform and Load (ETL) tools, wherein the codes facilitate the ETL tools in extracting, transforming and loading data read from data sources. The system further comprises a code reviewer configured to review and analyze the generated codes. Furthermore, the system comprises a data migration module configured to facilitate migrating the data read from the data sources to one or more data warehouses. Also, the system comprises a data generator configured to mask the data read from the data sources to generate processed data. In addition, the system comprises a Data Warehouse Quality Assurance module configured to facilitate testing the read and the processed data. The system further comprises a reporting module configured to provide status reports on the data warehousing processes.

Abstract: Users in public forums often mention certain topics in the course of their discussions. Member's comments in messages to other members are analyzed to obtain terms that co-occur with topics. Frequencies of co-occurrence of a term with topics are normalized based on frequency of the term in a random sample of message. The terms are ranked by their normalized frequency of co-occurrence with a topic in messages. The top terms are selected based on their rank. Analysis of demographic information associated with members that mentioned top terms associated with a topic is displayed in graphical format that highlights the relationship between the age, gender, and usage of the top terms over time. The demographic information presented includes average age of members that mentioned a top term or their gender information within a selected time interval.

Abstract: A network element comprising a processor configured to receive a plurality of search responses from a plurality of media content service providers associated with a search request triggered by the search request, and rank the search responses based on maximizing an end user's quality of experience (QoE). Included is a network element comprising a processor configured to receive a plurality of media content from a plurality of media content service providers, store the plurality of media content for a plurality of end users, receive a media content search request from a user terminal, rank the media content based upon maximizing the user terminal's QoE. Also included is a method comprising requesting media content from a plurality of media content service providers on behalf of a user terminal, receiving data associated with the media content from the plurality of media content service providers and aggregating the media content data.

Abstract: A file processing system includes a system targeting unit to target a distributed file system, a chunk generator to generate a chunk including file blocks and to generate copies of the chunk to be stored in the distributed file system, a data storage medium to store the chunk, and a chunk operation requesting unit to request storage of the generated chunk copies in the distributed file system. A distributed file system includes a first data server and a second data server. Each data server includes a chunk storage unit to store a chunk copy received from a file processing system, and a chunk operation performing unit to generate an identical copy of the stored chunk copy that is undamaged to replace a damaged chunk copy.

Abstract: Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information. A scanning operation is performed by searching a suffix of each of the sorted data streams for identifying a data sequence that includes a first symbol representing textual data, and a second symbol representing numerical data. The suffix tree for the converted data is then built.

Abstract: Techniques for managing data relationships are presented. A database element from a first database table is linked with a database element of a second database table via a Graphical User Interface as directed by a user. The link establishes a data relationship having attributes and properties. The relationship along with the attributes and properties are graphically presented to the user for inspection and analysis.

Abstract: A computer-implemented method of searching large amounts of machine generated data collected from disparate sources, comprises steps of: receiving data from the disparate sources into a multi-level system of storage blocks; high-speed searching at a broad level for groups of the storage blocks containing records of interest; nested searching at an intermediate level to determine specific storage blocks containing the records of interest, within the groups of the storage blocks; distributed searching at a fine level to identify the records of interest, within the specific storage blocks; and displaying the records of interest to a user.

Abstract: Methods and systems for storing stream data in a stream application are disclosed. The stream application is composed from a plurality of processing elements executing on one or more compute nodes. The plurality of processing elements is communicatively coupled to a management system. The management system is configured to monitor and control operations of the plurality of processing elements. A trigger rule, which includes a trigger condition, is loaded on a selected processing element in the plurality of process elements. The stream data is then monitored at the first processing element to determine if the trigger condition relative to the stream data has occurred. The stream data is stored in a database when the trigger condition occurs. The stream data is stored in the database according to the trigger rule.

Abstract: Embodiments of the present invention provide an approach for locating previously communicated electronic messages (e.g., emails, etc.). Specifically, the system will receive a request to locate/retrieve a previously communicated electronic message (“message”). The request can be issued by a sender or a recipient of the message. In any event, the request will include a set (one or more) of characteristics pertaining to the message such as a set of recipients thereof. One or more electronic messaging databases will then be searched based on the set of recipients and the message located. Once located, an alert will be sent to the requester and/or other message parties. The alert will indicate the message that was located. If the alert is validated (e.g., the message was the correct message), the message will be displayed.

Abstract: Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information. A scanning operation is performed by searching a suffix of each of the sorted data streams for identifying a data sequence that includes a first symbol representing textual data, and a second symbol representing numerical data. The suffix tree for the converted data is then built.

Abstract: Systems and methods for using a logical data model to at least partially address the deficiencies with existing ORM solutions are provided. In certain embodiments, the logical data model includes a layer that hides the underlying physical layout of tables in a database. The logical data model can act as a data management component that supports any subset of the following: 1) dynamic data modeling and schema management; 2) data set comparison and merge with historical tracking; and/or 3) data query.

Abstract: An embodiment of the invention provides a method to extract selected information from an image file selectively without requiring the user to restore, on the destination storage server, the image file which has the data for a file system. The selected information can be, for example, contents of a file, contents of a directory, other information from the image file. The selected information can be selectively extracted by reading the blocks of the file from the WAFL data structures that has been stored in the image file. An index file is generated and this index file tracks the location of VBNs (virtual block numbers) in an image file so that the user can easily obtain the selected information from disk blocks that are identified by these VBNs.

Abstract: A computer-implemented system, method and program product generates answers to questions in an input query text string. The method includes determining, by a programmed processor unit, a lexical answer type (LAT) string associated with an input query; automatically obtaining a candidate answer string to the input query from a data corpus; mapping the query LAT string to a first type string in a structured resource; mapping the candidate answer string to a second type string in the structured resource; and determining if the first type string and the second type string are disjointed; and scoring the candidate answer string based on the determination of the types being disjointed wherein the structured resource includes a semantic database providing ontological content.