Abstract: Described is a mechanism for exposing a volume shadow copy of a shared volume over a network to a remote client. A shared volume is accessed at a client computing system having a root. A volume shadow copy (or “snapshot”) of the volume is identified as a child resource of the shared volume. The child resource representing the snapshot may be hidden from ordinary view by default. To access the snapshot, a user may access the child resource as if it were an ordinary file or directory on the shared volume. Advantageously, the user need not mount a new volume representing the snapshot volume, but rather the user may directly access the snapshot.

Abstract: Techniques are described for storing and accessing data on heterogeneous types of data repositories, such as by a distributed software system that uses multiple data repositories on multiple computing nodes, including to transfer groups of data between multiple heterogeneous types of data repositories. In some situations, the techniques may be used by a system that stores various types of data regarding users or other entities that are modeled by the system, such as to transfer a group of data that represents an entity. The transfer of data may be facilitated by use of an abstraction interface that provides a uniform interface for accessing the multiple data repository types, such as an abstraction interface provided by one or more storage management components that further provide functionality to translate data between various data formats used by the multiple data repository types, such as via use of a common data format.

Abstract: An improved solution for managing a file system that includes an archive is provided. In particular, a request for a file system operation can be received and performed on an object that is stored in an archive. The file system operation can be received from a first computer and performed on the object on a second computer. Further, an archive manager can be included that manages an extensible set of archive handlers. In this case, each archive handler can implement a set of file system operations for archives of a particular archive type.

Abstract: Various embodiments of the present invention pertain to the organizing of digital content by events, so that retrieval of such digital content in a manner meaningful and logical to users is achieved. In this regard, an event may be defined at least by event boundaries, such as a span of time, a geographic area, an acquirer of digital content, or a subject of digital content. Digital content that can be deemed to accord with the event boundaries may be associated with the event and made available for access and retrieval.

Abstract: Disclosed is a fragile watermarking scheme for detecting and localizing malicious alterations made to a database relation with categorical attributes without introducing distortions to cover data. A watermark for a tuple group may be inserted by selectively switching the position of tuples in tuple pairs using a tuple hash associated with each tuple in the tuple pair; and a corresponding bit in a watermark derived from the tuple group using a embedding key, a primary key and hash functions.

Abstract: A method for locating a resource involves maintaining a capacity object configured to store server information for a plurality of servers, transmitting a resource request from a client to an indirection server comprising the capacity object, selecting one of the plurality of servers to service the resource request using server associated with the capacity object to obtain a selected server, and redirecting the resource request from the indirection server to the selected server.

Abstract: Methods and systems for proactively processing errors in customs data transmitted to a customs broker are disclosed. A computer receives multiple sets of customs data from multiple importers, each set of data having its own format. The customs data are intercepted by the computer at a central processing division before the customs data are delivered to customs brokers from each of the importers. The computer converts the customs data to have a universal format, then processes the data to detect errors. Information about a detected errors, including correction data to resolve the error, may be transmitted to a customs broker before the customs broker detects the error in his own set of customs data received from the importer.

Abstract: Embodiments of a feedback-driven malware detector are directed to protecting a computer from programs that perform actions that are malicious or not expected by a user. In one embodiment, the feedback-driven malware detector performs a method that initially determines whether the state of an application program scheduled to be added to an extensibility point on a computer is already known. If the state of the object is not already known, the user is informed that an application program is being installed on the computer and that the application program is being added to an extensibility point. Then, input is obtained from the user that assists in determining whether the application program is malware.

Abstract: Serialization and deserialization using data contracts. The data contract specifies data types that are serialized and deserialized for data objects that are associated with the data contract. During serialization, the data contract associated with the data object is identified. Then, the data fields that correspond to those specified data field types are extracted from the data object and serialized into a serialization format. During deserialization, the serialization mechanism receives a serialized data structure having a particular serialization format. A data contract is then identified as being associated with the serialized data structure. After deserialization of the serialized data structure into abstract data, a corresponding data object is populated with data fields that correspond only with those data field types specified in the data contract. Accordingly, data abstraction is enabled while serializing and deserializing.

Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: A system for incremental batch-mode editing of digital media objects includes one or more processors and memory coupled to the processors, where the memory stores program instructions executable by the processors to implement a media management tool. The media management tool is configured to receive a batch request indicating a plurality of modification operations to be performed on a plurality of digital media objects, and to perform the modification operations in a particular sequence. After a particular modification operation is performed, the media management tool is configured to provide a representation of one or more digital media objects affected by the modification operation, and receive input or feedback pertaining to the modification operation. The input may, for example, indicate respective versions of one or more digital media objects on which the next modification operation in the particular sequence is to be performed.

Abstract: A mechanism works in conjunction with a DB2® Log and an analysis tool, such as BMC's Log Master™, to handle logged data for Large Objects (LOBs) stored in tables of a DB2 database system. A plurality of controls track data logged for the LOBs. The mechanism reads log records from a DB2 Log and uses the controls to determine which of the tracked LOBs is associated with the log records and obtains data from those associated log records. The mechanism builds keys to index the data and stores the keys and the data in a Virtual Storage Access Method store having Key Sequenced Data Sets maintained separate from the log record store for the DB2 Log. When requested by the analysis tool, the data in the store can be reassembled using the keys and map records in the first store that map the logged data for the tracked LOBs.

Abstract: Database indexes include multiple fields that are used to track how the components of the index are used. An index component monitoring mechanism tracks how the components of the index are used, and updates fields in the index accordingly. Such component-level statistics allow a query optimizer to make more intelligent decisions regarding when to build a new index and when to discard an index, and also provide information regarding which queries are using the index, the maintenance cost of the index, and the selectivity of the index when used to process a query.

Abstract: A method for locking a nomination item in a multi-user distribution scheduling system is provided. At least one nomination item, associated with a voyage, may be created and stored within a database. A lock object, associated with the nomination item, may be created to prevent concurrent modification of the nomination item. The nomination item may be modified and stored within the database, and then the lock object may be deleted.

Abstract: A system and method are provided for analyzing media content and generating related metadata as it is provided to a computer. In one embodiment, the system includes an extensible analysis object managing a plurality of plug-ins for analyzing the media content and generating metadata related to the media content.

Abstract: A computerized system and method for transforming (formatting or aggregating) the results of a query into a hierarchical information stream, such as an eXtensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the “auto1” mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the “auto2” mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.

Abstract: A geographic database represents roads including an altitudinal component of the geometry of the roads. The altitudinal component of the geometry of roads is represented using data that indicate straight line segments and vertical curves, in particular parabolic vertical curves. The straight lines and vertical curves are determined by providing data, indicating the altitude at a plurality of locations along portions of roads, as an input to a Hough transform to determine the straight line segments and vertical curves that coincide with the portions of the roads vertically. Then, data that define the straight line segments and vertical curves are stored to represent the altitudinal component of the geometry of the portions of the roads in the geographic database. The altitudinal variation of roads is thus expressed in closed form. From this closed form representation, the slope or grade at any point along the road can be easily computed.

Abstract: An information retrieval apparatus includes a display which displays document information, an input unit which adds additional information to the document information displayed the display, a first storage which stores mark symbol information specifying a particular symbol used for marking, a detector which detects an input from the input unit and decides whether or not the input additional information is identical to or similar to the mark symbol information stored in the first storage, a second storage which stores the mark symbol information and the additional information which is decided that it is similar to the mark symbol information by the detector, associating with the mark symbol information, and a retrieval unit which retrieves the mark symbol information and the additional information associated with the mark symbol information from the second storage, and a retrieval result by the retrieval unit is displayed on the display.

Abstract: A system for generating embedded expressions configured to generate a result. The system includes an embedded expression generation engine configured to generate a root expression, including at least one parameter. The parameter includes an assigned embedded expression configured to generate a result based on one or more input parameters. The system further includes an embedded expression user interface configured to display the root expression and associated parameters and embedded expressions and provide expression generation tools allowing the user to modify the root expression.

Abstract: A virtual item set representing a subset of items stored within an original data structure. The system includes a virtual item set processor configured to generate a plurality of virtual items that are a subset of items in the original data structure, and a virtual item set including the plurality of virtual items. Each virtual item includes a data field containing a data item from the original data structure and a metadata field, the meta field data including position information representing the position of the data field within an original data structure.

Abstract: Method and computer system for logically evaluating a Boolean expression used in a query statement to optimize the query. The Boolean expression refers to an attribute and includes a plurality of conditions. The Boolean expression is received (410) and decomposed (420) into the plurality of conditions. For each condition at least one condition value referring to the attribute is extracted (421) from the condition. The at least one condition value is then inserted (422) into a condition value list in sorted order. A relationship vector of the at least one condition value is initialized (423). Then the relationship vectors of the at least one condition value and of each further condition value that is in the condition list and that is in the value range of the condition are adjusted (424). After having processed all conditions the Boolean expression may be reducing (430) according to each relationship vector.

Abstract: A system may obtain search results associated with a search performed using a search query. The system may modify the search results, if necessary, based at least in part on information associated with prior document accesses by a user and present the modified search results to the user. The modification of the search results might including adding, deleting, and/or reordering items in the search results. One or more advertisements relevant to the search query may also be presented to the user along with the modified search results.

Abstract: In a database system, a full outer join is computed using a hash-based join.

Abstract: This disclosure provides various embodiments of software for utilizing a common database layout. In one aspect, a first database table having a first layout and a generic index is accessed using a first instance of a query, and a second database table having a second layout and the generic index is accessed using a second instance of the query. Some implementations may have a generic index that consists of a globally unique identifier. Other implementations may have a generic index that is a combination of database table fields. In some implementations, the first and second database tables may be resident in a first data repository, and the software may access a third database table having a third layout and the generic index using a third instance of the query, wherein the third database table is resident in a second data repository.

Abstract: Virtual solution architecture for computer data systems. In one aspect, providing an architecture for a computer data system includes creating a virtual solution architecture that includes a plurality of building blocks, each building block characterized by balanced operation, and mapping the virtual solution architecture to a physical solution architecture for the computer data system. Another aspect includes providing at least one balanced configuration unit (BCU) in a computer data system, the BCU including at least one balanced partition unit (BPU) that includes computer resources to provide balanced operation for the BPU.

Abstract: A probabilistic detector is utilized to query a database. Utilization of a probabilistic detector provides assurance with 100 per cent probability that a search expression in the query is not in the database index. The probabilistic detector is implemented in the form of a Bloom filter. The probabilistic detector is created by hashing expressions in the database index and mapping the resulting hash values into the probabilistic detector. Upon receiving a query, expressions of the query are hashed. The probabilistic detector is queried using these hash values. If the results of querying the probabilistic detector indicate that searched for information may be in the database, the database is not queried. If the results of querying the probabilistic detector indicate that the information may be in the database, the database is queried for the information using the original query. This technique is advantageous in mitigating detrimental effects of denial of service attacks.

Abstract: Methods, systems, and computer readable medium for displaying results of a search query. In one implementation, the method includes receiving a query, obtaining documents that satisfy the query, constructing a facet hierarchy based on documents that satisfy the query, creating a cube structure based on the facet hierarchy, and displaying a multi-dimensional search interface based on the cube structure.

Abstract: The subject disclosure pertains to a class of object finder queries that return the best target objects that match a set of given keywords. Mechanisms are provided that facilitate identification of target objects related to search objects that match a set of query keywords. Scoring mechanisms/functions are also disclosed that compute relevance scores of target objects. Further, efficient early termination techniques are provided to compute the top K target objects based on a scoring function.

Abstract: Our approach seeks to reduce the complexity of this type of calculation through approximation and pre-computation. It is designed to work efficiently with modern relational database constructs for content management. The approach is designed to enable the kinds of highly interactive data-driven visualizations that are the hallmark of third generation business intelligence.

Abstract: Enabling text searching that accommodates a search criteria corresponding to a capitalization characteristic. One or more search terms are received, and a determination is made as to a capitalization characteristic of at least one search term. One or more documents are identified from a collection of documents. The identification is based at least in part on the determination of the capitalization characterization of the search term, so that the search result satisfies the criteria of the capitalization characteristic.

Abstract: Methods, program storage devices and systems for developing a Personalized Medicine Service for an individual or group of individuals that can support the operation, customization and coordination of computer systems, software, products, services, data, entities and/or devices.

Abstract: A system and method for viewing models and model variables within a sophisticated modeling environment is disclosed. The system provides varying levels of insight into a modeling infrastructure to help the user understand model and model variable dependencies, usage, distribution, and/or the like. The method includes storing model and model variable data within a relational database system, receiving a request from a user interfacing with the system via a web interface, extracting search criteria and presentation preferences from the request, formulating and executing one or more queries on the database to retrieve the required data, formatting the data in accordance with the request, and retuning the data to the requesting user in the form of a web page.

Abstract: A unique formatting scheme for object-relational mapping allows disparate applications that adopt the scheme to seamlessly access data in disparate relational databases. The formatting scheme contemplates a common format that conveys the mapping information through (i) attributes embedded with code objects, and (ii) an external mapping source. Adoption of the common format can result in several advantages for network-based client-server operations: (i) Software developers can continue programming in their existing languages. (ii) Data servers from various vendors can also continue to be developed and managed in the vendors' core programming languages. (iii) Vendors that employ client applications which have adopted the common format can consistently use various data warehouses without incurring customization costs.

Abstract: A method, apparatus and computer program product are provided for processing of an original batch of documents in which any document of the original batch that fails to comply with the predefined specification is identified to be a non-compliant document. At least one non-compliant batch is then formed that contains the non-compliant documents. The non-compliant batch is distinct from at least one compliant batch that contains any documents that do comply with the predefined specification. At least one of the non-compliant and compliant batches advantageously includes a plurality of documents. The complaint batch(es) may then be forwarded for further processing without awaiting rework of the non-compliant documents included in the non-compliant batch(es).

Abstract: Database interaction is facilitated by graphically presenting database objects in groups that are not necessarily dictated by object types of the database objects. In an example implementation, database navigation is facilitated by determining object dependency groups for a database in which each object dependency group corresponds to a database source object and includes at least those database objects that depend directly or indirectly from the corresponding database source object. When these data source object-based dependency groups are graphically displayed, selecting a database object thereof provides access thereto. In another example implementation, a user can designate an attribute associated with database objects by which the database objects are to be grouped. Thus, the database objects are grouped by various values that the user-designated associated attribute takes.

Abstract: Automated sampling and aggregation of performance or other dynamically varying data facilitates user productivity by making data available for a wide range of uses. An automated sampling and aggregration system includes one or more types of data collectors, including a dedicated data collector per machine, multiple data collectors per machine, or an instance-less data collector.

Abstract: When a number of document data registered in one of full-text index-for-registration/deletion storage parts reaches a predetermined number, or when a capacity of the full-text index-for-registration/deletion storage part reaches a predetermined capacity, a merge processing is performed for merging data from the full-text index-for-registration/deletion storage part to a full-text index-for-search storage part. While this merge processing is performed, a registration/deletion processing is performed by using another full-text index-for-registration/deletion storage part.

Abstract: Systems and methods for processing an index are described. An index may be merged with another index of comparable age and size into a single index. Since older indexes are less likely to need updating, they are “set aside” to age based on certain adaptive criteria such as the age and size of the index, percentage of deletions, and how long it takes to update the index. An index that has been set aside may be compacted into a format that is optimized for fast searching.

Abstract: A file system transfer designation section for transferring the file system matching with file system transfer rules from the first volume of the first storage apparatus to the second volume of the second storage apparatus based on the first file system transfer rules, a file system storage information manager for updating storage information of the file system in accordance with transfer of the file system by the file system transfer designation section, and transmitting the updated file system storage information, and a search information manager for updating search information for searching the files based on a file search request from the client apparatus using the file system storage information sent by the file system storage information manager are provided.

Abstract: A method and apparatus for use in an information retrieval system is provided, which derives related informational items that have a usage based relationship strength, and which results in an efficient and more accurate dynamic relationship association between informational items. This system comprises the steps for detecting a selection of at least a first informational item and a second informational item in an information retrieval session. A relationship type is assigned based on characteristic similarities between the first informational item and the second informational item. Additionally, a relationship strength is assigned based on historical frequency of the consecutive selection of the first and second informational items and providing an access to the second informational item upon detection of the first being accessed by a user of the information retrieval system.

Abstract: A system and method for presenting related items to a user. A universal data store is provided which contains a plurality of items. A portion of the items contain relational information that allows relationships between two or more of the plurality of items to be determined. A shell presents a selected item to a user and is configured to utilize the relational information to present one or more items in the data store which are related to the selected item.

Abstract: A method for efficiently choosing optimal weights in a distributed manner may include optimizing weights in a predefined order while preventing or reducing the likelihood that interacting weights are concurrently optimized. In this manner, divergence and deadlock during optimization may be avoided.

Abstract: Disclosed is a method and system to receive a first value of a first attribute in a user interface and create a value pattern for a second attribute in the user interface based on the first value dynamically. A second value for the second attribute is automatically proposed from the created value pattern.

Abstract: A programmable streaming data processor that can be programmed to recognize record and field structures of data received from a streaming data source such as a mass storage device. Being programmed with, for example, field information, the unit can locate record and field boundaries and employ logical arithmetic methods to compare fields with one another or with values otherwise supplied by general purpose processors to precisely determine which records are worth transferring to memory of the more general purpose distributed processors. The remaining records arrive and are discarded by the streaming data processor or are tagged with status bits to indicate to the more general purpose processor that they are to be ignored. In a preferred embodiment, the streaming data processor may analyze and discard records for several reasons. The first reason may be an analysis of contents of the field.

Abstract: A web based application makes data conveniently and readily available to individuals dispersed from a common collection site or database. Individuals can access various levels of retrospective or previously stored data in the database only in accordance with pre-defined roles, or levels which can be established at log on.

Abstract: The subject disclosure pertains to interaction with one or more collections of data. Queries and domains are presented as separate entities. A number of compositional operators are provided to manipulate a generic collection of data at a low level. Query comprehensions can specify interactions with one or more collections at a higher or more intuitive level. The query comprehensions can be translated or mapped to operators that can be employed to interact with one or more data collections and return results where applicable.

Abstract: A method for processing queries is provided. A first representation of a query is generated, where the query includes a certain operator that is to be performed based on an XPath expression that is expandable into multiple location paths. The first representation of the query is rewritten into a second representation that corresponds to an equivalent query, where rewriting the first representation includes expanding the XPath expression into the plurality of location paths and, based on the certain operator, including a plurality of operators in the second representation, where the plurality of operators include: a first set of operators that is to be performed based on each of the plurality of location paths, and a second set of operators that is to be performed based on data returned from at least one operator included in the first set of operators. The query may thereafter be executed based on the second representation.

Abstract: While interacting with a messaging interface, keywords or other search criteria are automatically identified and used to perform a search. Search results and sponsored links (or advertisements) are displayed to the user within the messaging interface. To alleviate privacy concerns, this process will not be performed unless the user has explicitly opted-in to the search feature. In another embodiment, the user can highlight keywords in an outbound or inbound message to trigger a search without leaving the messaging interface. In another embodiment, the user can input a search keyword or phrase to trigger a search without leaving the messaging interface.

Abstract: A system and method for serving content in a container document. The system comprises a container server that identifies one or more modules for use with a container document, receives a module specification from a remote server, and serves the container document including module data based on the module specification. The module specification comprises a content element and one or more optional preference elements that enable the container server to provide preferences to the module.

Abstract: A method for tracking user internet surfing involving a first step of providing a computer hosting contents from content hosts. The computer is configured with the required software and hardware to control all interfacing with the user; and, to request and receive data from the content hosts. Additional steps include storing on the computer storage medium an identification of the user to enable the user to log in to the computer; enabling a logged-in user to access the computer through the requesting client to view a content in the plurality of contents; maintaining a user list comprising the surf-code reference of the content viewed by the logged-in user; enabling the logged-in user to access the user list to identify the content viewed by the logged-in user; and, presenting the content viewed by the logged-in user to the requesting client based on the user list.