Abstract: A file system (i) permits storage capacity to be added easily, (ii) can be expanded beyond a given unit, (iii) is easy to administer and manage, (iv) permits data sharing, and (v) is able to perform effectively with very large storage capacity and client loads. State information from a newly added unit is communicated (e.g., automatically and transparently) to central administration and management operations. Configuration and control information from such operations is communicated (e.g., automatically) back down to the newly added units, as well as existing units. In this way, a file system can span both local storage devices (like disk drives) and networked computational devices transparently to clients. Such state and configuration and control information can include globally managed segments as the building blocks of the file system, and a fixed mapping of globally unique file identifiers (e.g., Inode numbers) and/or ranges thereof, to such segments.

Abstract: A zoom in/out interface to a ratings system provides navigation to users for inspection and interaction with prescribed indicators underlying an integrated rating of a company's performance. The interface presents at various different depths in a hierarchy of the prescribed indicators the multivariate relationships that exist among the indicators, expressed as variable values, as well as the basis for the underlying values of each indicator down to the source of the data.

Abstract: In a method for a dynamic updating of an index of a search engine, wherein the index is an inverted index comprising a dictionary, a posting file with a posting list for each keyword of the index and a database log, the documents are inserted in the index in small batches called update generations, a list of all occurrences of keywords in the documents of each update generation is generated, the occurrence list is inserted in the database log, and for each keyword entered in the database a reference to a previous entry of the same keyword is created. This previous entry has a reference stored in the mass storage device as the last added entry of all recently keywords.—A search engine performing the method may be implemented on one or more servers with a mass storage device, and comprises a core search engine with a search subsystem and an indexing subsystem for creating a keyword index stored on the mass storage device and with the index realized as a dynamically updateable index.

Abstract: A computer-implemented method includes receiving a selection of a particular logical field via a database query interface. The method includes querying a discovery registry associated with a data abstraction model of a database to discover one or more web services that are resolvable based on the particular logical field. The data abstraction model includes a plurality of logical fields, where each logical field corresponds to a particular data structure of the database. A web service input and a web service output of a particular discovered web service are associated with logical fields of the data abstraction model via the discovery registry. A modified database query interface includes an input assistance selectable input associated with the discovered web services. In response to a selection of the input assistance selectable input, a form input interface may be displayed that includes one or more input forms associated with the discovered web services.

Abstract: An online customer support system (20) automates access for a user to a variety of types of information (24-31) maintained within a database (22). In a disclosed example, a dynamic user profile management module (50) automatically establishes a user profile including entitlements to sets of information within the database (22) each time a user accesses the system. A disclosed entitlement inference module (54) recognizes explicit entitlements based on accessibility indicators or infers entitlements based on various disclosed factors or relationships. A disclosed linking module (52) automatically determines a probability that a user can be granted another entitlement that was not granted by the entitlement inference module (54). An example process of registering a user includes requiring only a single piece of information from the user to automatically establish access for that user to an associated portion of the database (22) and any other portions of the database (22) that user should be able to access.

Abstract: A first file server for use with a distributed-file system includes a processor configured to determine that an incoming file system communication is associated with a first portion of the distributed-file system associated with a second file server, send a first authorization request to the second file server to request authorization to directly access the first portion of the distributed-file system, analyze a first authorization response from the second file server to determine at least one storage location associated with the first portion of the distributed-file system, determine that an incoming second authorization request received from a third file server is associated with a second portion of the distributed-file system associated with the first file server, obtain data indicative of the second portion of the distributed-file system, and send a second authorization response that includes the data.

Abstract: A method for using confidence factors in forming a system may include receiving a tolerable confidence factor. The method may also include utilizing only resources and relationships of a plurality of resources and relationships with confidence factors equal to or greater than the tolerable confidence factor to form the system.

Abstract: A system and method for logically masking data by implementing masking algorithms is provided. The method includes receiving one or more inputs from user regarding type of data masking to be implemented depending on type of data entry. Data entries include alphabetical data, data comprising unique codes, data comprising dates and numerical data. Based on inputs received, the data entries are classified and appropriate masking algorithms are executed. For masking numerical data entries, the data entries are first grouped using clustering algorithms and are then shuffled using shuffling algorithms. For low level of data masking selected by a user, numerical data entries are shuffled within groups and for high level of data masking selected by a user, numerical data entries are shuffled across groups.

Abstract: An external service at a service provider server is invoked from a database by accessing from over a network a description of the external service published by the service provider external to the database. A database invocation mechanism is generated from the accessed description of the external service, wherein the database invocation mechanism comprises code within the database. A database program invokes the database invocation mechanism code within the database to invoke and interact with the external service. The database receives data from the external service in response to invoking and interacting with the external service.

Abstract: A content management system provides a profiling mechanism that automatically tags changes made to elements in a document with applicability metadata, and uses the applicability metadata when processing a request to the repository by a user to filter the query results according to a profile for the user. A profiling mapping policy defines roles for users of the content management system. When content is requested from the repository, the profiling mechanism inserts one or more additional request parameters based on the profile of the user. The results that match both the original request and the additional request parameter(s) are returned to the user. When the user views the results, additional filtering may occur to filter individual elements from the user that do match the user's profile.

Abstract: Techniques are provided for transporting subset of databases containing binary XML data. In one embodiment, a method is provided that allows transporting binary XML data that conforms to schema by also transporting the schema entries that are necessary to derive the binary XML. In another embodiment, a method is provided that allows transporting binary XML data that does not conform to schema by also transporting the token tables that contain the mapping for the binary XML.

Abstract: A content management system provides a profiling mechanism that automatically tags changes made to elements in a document with applicability metadata, and uses the applicability metadata when processing a request to the repository by a user to filter the query results according to a profile for the user. A profiling mapping policy defines roles for users of the content management system. When content is requested from the repository, the profiling mechanism inserts one or more additional request parameters based on the profile of the user. The results that match both the original request and the additional request parameter(s) are returned to the user. When the user views the results, additional filtering may occur to filter individual elements from the user that do match the user's profile.

Abstract: A rules engine assigns a set of appropriateness rules to a particular data collection. The set of appropriateness rules describes an optimum usage for the particular data collection based on a source of the particular data collection and a type of activity that is deemed best suited to utilize the particular data collection. The set of appropriateness rules also requires that a data collection requester's role matches a data collection provider's role. In response to determining that a requesting computer is implementing an activity that matches the set of appropriateness rules, a rules engine directs a database controller to transmit the particular data collection to the requesting computer.

Abstract: A distributed storage system employs a Key-Value Store to dynamically change a table layout scheme based on user access patterns. The system can be used as a basic architecture to construct a distributed Key-Value Store to support both row-oriented and column-oriented table layout schemes, by using DHT (Distributed Hash Table) technology for high scalability.

Abstract: A method is provided of validating details associated with a copyrighted work. The work and associated data are received at a first server from a first party and stored in an online database. The work and the data are further associated with the first party and one or more other parties. The data includes a relationship status between the parties and the work, and details associated with the work. The online database is reviewed for preexisting confirmation of the relationships. Where the relationships are unconfirmed, confirmation requests are transmitted to the one or more other parties via the communications network seeking confirmation of the relationships. Upon confirming said relationships, the other parties are contacted seeking validation or correction of the details provided by the first party. Validated details or corrected details are then received from one or more of the other parties and stored on the online database.

Abstract: A system, method, and computer program product are provided for analyzing a plurality of rules in a textual rules structure. Further, the plurality of rules are decomposed into a plurality of contexts, based on the analysis. In addition, the plurality of contexts are stored in a table. Furthermore, a database associated with a device and/or any robot equipped with an operating system may be utilized.

Abstract: A method and mechanism for performing an operation based on multidimensional data in a relational database. A first query is submitted to a relational database engine of the relational database management system, thereby causing a relational cube to be generated. The first query includes instructions to select a portion of multidimensional data for inclusion in the relational cube. The first query includes instructions to group the selected portion of multidimensional data using at least two or more levels of granularity of at least one dimension. The first query also includes instructions to generate a materialized view. Based on a received request for an operation, a second query is submitted to the relational database engine for execution against the relational cube, thereby causing the operation to be performed.

Abstract: A system, method, and computer program product are provided for storing a data stream in a first table of a database. Further, a plurality of contexts associated with the data stream are identified. Additionally, the data stream is filtered, utilizing plurality of contexts. Furthermore, the database may be associated with a device and/or any robot equipped with an operating system.

Abstract: A data processing system accesses a group of events to identify a group of types of events and aggregates at least some of the events into a group of items. Each of the events is aggregated by binding another event to an event identified as a particular type of event based on a correspondence between the event and the particular type of event and binding additional information to the event identified as the particular type of event based on a relationship between the additional information and the particular type of event. The data processing system also rendezvous one of the items with an event.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.