Abstract: Systems and methods consistent with the invention relate to matching user attributes. In one exemplary implementation, the system and methods may store predetermined general attribute descriptors reflecting attributes of users generally, receive personal attribute descriptors selected from the predetermined general attribute descriptors as corresponding to attributes of a first user and a second user, receive a rating associated with each received personal attribute descriptor, compare at least one personal attribute descriptor associated with the first user with at least one personal attribute descriptor associated with the second user to determine a descriptor match, and calculate a match score based on the determined descriptor match and the received ratings. In addition, first and second display points may be displayed and may be separated by a one-dimensional display distance that is a function of the calculated match score.

Abstract: A method, system and computer-usable medium for a policy validator that automates the validation of existing or proposed policies. A segmented questionnaire wizard is implemented to guide a policy creator through a series of policy-related questions, resulting in the automated generation of a questionnaire used for validating the policy. The resulting validation questionnaire is automatically distributed to predetermined subject matter experts and individuals affected by the policy, whose responses are then analyzed and scored by the policy validator to determine the validity of the policy. If the resulting validation score is within a predetermined, acceptable range, the policy is approved and released for implementation. Otherwise, the process is repeated until an acceptable validation score is achieved.

Abstract: Systems and methods of the present invention provide for storing one or more data records, comprising a text string and a monetary value associated with the text string, in a database. One or more server computers may receive an appraisal request for a domain name and identify one or more keywords in the domain name. The server(s) may then determine an existence of one or more matching data records wherein the text string in the record(s) match the identified keyword. If the matching data records exist, the server(s) may identify a keyword frequency count and a keyword monetary value for that keyword. A keyword appraisal value may be generated by dividing the keyword monetary value by the keyword frequency count. The appraisal value for all identified keywords may be added to the domain name appraisal and the domain name appraisal may be transmitted to a client computer.

Abstract: A file managing software program for managing a list of elements in a specific sequence in a first file of a computer program, including the steps of copying the first file to form a second file having an identical list of elements as the first file. The user is then permitted to rearrange the sequence of the elements of the second file independently of the sequence of the first file. A display of both the first and the second file list elements is provided to the user. Further embodiments allow the user to categorize, prioritize, and order according to users specified rules of how the second file element list is organized and displayed to provide a more convenient and flexible presentation of the file contents.

Abstract: Mechanisms are provided for retrieving and presenting related content using text stream data feeds. Text stream data feeds such as caption information associated with media content or conversations associated with social networking applications are aggregated and used to retrieve related media content, text documents, and advertisements. Text stream data feeds that a user is exposed to may indicate that the user is interested or at least primed for particular types of related content. In particular examples, an inverse vector space search engine is used to determine particular pieces of related content and categories of interest. Post filtering may also be applied to the results.

Abstract: A method is used in managing data storage for databases based on application awareness. Content is received via any of a file system interface, a block based interface, and an object based interface to a data storage system, which executes a general purpose operating system. Based on software installed on the data storage system and running on the general purpose operating system, an application-aware management interface is used to provide a database interface to the data storage system. Based on the database interface, database queries are accepted at the data storage system.

Abstract: A location extraction component analyzes a set of travelogues to identify all of the locations mentioned therein. A co-occurrence extraction component computes co-occurrence values for the identified locations. When the identity of a specified location is received, suggested locations for the specified location are identified through the use of the co-occurrence values. A map is displayed that encompasses an area including the specified location and the suggested locations. The map might include indicators for the specified location and for each of the suggested locations. Attributes of the indicators, such as their size or color, can be modified based upon the co-occurrence value associated with the corresponding suggested location.

Abstract: Embodiments relate to systems and methods for a cloud-based directory system based on hashed values of parent and child storage locations. Platforms and techniques are provided to store a data object to cloud storage resources in two or more locations recorded in a consistent hash structure. A file management tool can store one copy of the data object to a location corresponding to the hashed value of the file path or name, and a second copy to a location corresponding to the hashed value of the parent directory of the data object. All files sharing a common parent directory or other location therefore have at least one copy stored to the same location, in common with the parent. Directory-wide read, write, and/or search operations can therefore be performed more efficiently, since the constituent files of a directory or other location can be accessed from one location rather than distributed locations.

Abstract: Systems and methods are disclosed for receiving a first specification that identifies program code behavior associated with a plurality of documents. The specification includes an input-output pair with a first data entity and a second data entity. The systems and methods further include identifying one or more documents, within the plurality of documents, that are configured to (i) use at least a portion of the first data entity as an input to program code associated with particular ones of the documents, and (ii) provide at least a portion of the second data entity as output associated with the program code, wherein the particular ones of the documents correspond to a positive matching between one or more constraints associated with each document and one or more constraints associated with the specification, and generating search results comprising the identified one or more documents.

Abstract: A method and system for providing relationships in search results are provided. The method includes indexing an entity in a search index as an entity index entry, the entity index entry including facets providing information on the entity type and related entities. Search results are obtained by a search engine in the form of ranked result entities, wherein the result entities include multiple types of entities. The method then includes retrieving index entries to determine relationships between search result entities and providing the relationships in search results. The method further includes, for each result entity, retrieving its entity index entry and cross-checking the facets of the retrieved entity index entry for other result entities.

Abstract: Methods and systems for identifying candidates for de-duplication are disclosed herein. An example system may include: a de-duplication lister that coordinates with a kernel module to identify a unit of data for de-duplication and calculates a signature of the unit of data; a de-duplication queue that manages a de-duplication queue; a de-duplication tracker that maintains a de-duplication data structure including a plurality of entries corresponding to units of data and searches the de-duplication data structure to determine whether the signature of the identified unit of data matches the signature of at least one of the entries in the de-duplication data structure; a de-duplication maintainer that reviews the entries of the de-duplication data structure and removes obsolete entries from the de-duplication data structure; and a de-duplication engine that coordinates with the kernel module to perform de-duplication operations on the de-duplication queue.

Abstract: A data modeling platform allows a user to enter a search request using natural language (e.g., typed or spoken). The search request may be semantically parsed to provide mapping to various database search elements. Pre-existing data models may be identified from the database search elements. One or more new data models may be created from the database search elements. The results represent candidate data models in response to the user's search request.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for archiving an active record in a database. An auxiliary table is created in the database. The auxiliary table can store metadata information about active records to be archived and deleted from the database. An active record to be deleted from the database is selected. Metadata information is stored in the auxiliary table for the selected active record. The selected active record is archived into a data storage device. The selected active record is deleted from the database, based on the update information in the auxiliary table, without comparing column data for the archived record in the data storage device and the active record in the database prior to deletion of the active record from the database.

Abstract: A system for visualizing concepts within a collection of information analyzes a set of materials from at least one collection of information and defines an attribute space associated with the set of materials. The system then determines automatically similarity of members of the attribute space. The system then generates a graphical model of the members of the attribute space, where the generating includes generating a display of the members of the attribute space, each of the members having a respective display distance from other respective members of the attribute space reflective of the determined similarity.

Abstract: This invention pertains generally to a method for resolving and managing eventual consistency conflicts when using a Prefix Hash Tree (“PHT”) in which the underlying storage system is a Distributed Hash Table (“DHT”). An embodiment according to the within invention comprises a computer implemented method for resolving eventual consistency conflicts when using a PHT and DHT.

Abstract: A technique for use in performing snap imaging of a plurality of data objects and associated metadata involves placing the plurality of data objects in a consistent state. While the data objects are in a consistent state, a copy is created of the metadata associated with the plurality of data objects. The data objects are then taken out of the consistent state. The temperature value associated with one or more of the data objects is/are compared with a threshold value. A copy is created of at least some of the data objects for which the associated temperature value exceeds the threshold value.

Abstract: A method is provided in one example and includes generating a query for a database for information stored in the database. The information relates to data discovered through a capture system. The method further includes generating an Online Analytical Processing (OLAP) element to represent information received from the query. A rule based on the OLAP element is generated and the rule affects data management for one or more documents that satisfy the rule. In more specific embodiments, the method further includes generating a capture rule that defines items the capture system should capture. The method also includes generating a discovery rule that defines objects the capture system should register. In still other embodiments, the method includes developing a policy based on the rule, where the policy identifies how one or more documents are permitted to traverse a network.

Abstract: Systems and methods of the present invention provide for storing one or more data records, comprising a text string and a monetary value associated with the text string, in a database. One or more server computers may receive an appraisal request for a domain name and identify one or more keywords in the domain name. The server(s) may then determine an existence of one or more matching data records wherein the text string in the record(s) match the identified keyword. If the matching data records exist, the server(s) may identify a keyword frequency count and a keyword monetary value for that keyword. A keyword appraisal value may be generated by dividing the keyword monetary value by the keyword frequency count. The appraisal value for all identified keywords may be added to the domain name appraisal and the domain name appraisal may be transmitted to a client computer.

Abstract: Techniques are described for identifying conflicts between a prospective temporal key and an index of temporal keys, the index sorted based on a time value associated with each of the temporal keys. Embodiments determine whether a first temporal key within the index of temporal keys conflicts with the prospective temporal key. Here, the keys within the index may be sorted based upon a respective time value associated with each of the keys. Upon determining that the first temporal key conflicts with the prospective temporal key, the prospective temporal key is designated as conflicting with at least one existing temporal key in the index of temporal keys.

Abstract: Techniques are described for refining the manual classification of assets classified or categorized using the terms of a business glossary. A semantic refinement mechanism is used to refine the manual classification of such assets, as well as subsequently evaluate the refined asset classifications. Further, the refined asset classifications may be used as a training set for a machine learning classifier. That is, should the classification of an asset contributing to a refinement change, the refinement based on that classification may be undone, at least in some cases.