Abstract: A computerized method and system to communicate information between a supported client computer and a remote support organization have been described. At the supported client computer, status information, generated by one or more client applications when executing on the supported client computer, may be retrieved. The status information may be stored in a client database on the supported client computer. A first client database definition for a client data item may be mapped to a first tag, the first client database definition may be associated with the client database and the client data item may include the status information. A client message document including the first tag may be communicated to a support server of the remote support organization. The status information may be stored in, and retrieved from, the client database via a functional abstraction layer comprising one or more customized application program interfaces (API).

Abstract: Methods, apparatus, and computer-readable storage media for object retrieval and localization that employ a spatially-constrained similarity model. A spatially-constrained similarity measure may be evaluated by a voting-based scoring technique. Object retrieval and localization may thus be achieved without post-processing. The spatially-constrained similarity measure may handle object rotation, scaling and view point change. The similarity measure can be efficiently calculated by the voting-based method and integrated with inverted files. The voting-based scoring technique may simultaneously retrieve and localize a query object in a collection of images such as an image database. The object retrieval and localization technique may, for example, be implemented with a k-nearest neighbor (k-NN) re-ranking method in or as a retrieval method, system or module. The k-NN re-ranking method may be applied to improve query results of the object retrieval and localization technique.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying historical data. One method includes calculating time trend statistics for a document and a query during different time periods. The method further includes modifying a quality of result statistic for the document as a search result for the query by a factor based on the one or more time trend statistics. The method further includes providing the modified quality of result statistic as an input to a document ranking process. Another method includes calculating a difference score for statistics for a group of documents and a query for a first time period and a second time period. The method further includes modifying quality of result statistics for documents responsive to the query based on the difference score. The method further includes providing the modified statistics as an input to a document ranking process.

Abstract: Techniques are disclosed for cost modeling in a data flow model. In one embodiment, a data flow model is provided that includes multiple data flow objects, each data flow object including one or more data units. Each data flow object represents a respective information asset. Quality and cost components are assigned to each data unit of a first data flow object. A cost property is determined for each data unit of the first data flow object, based on the assigned components. An object cost property is also determined for the first data flow object. The determined cost properties may be used to identify information assets that are more cost-effective to upgrade, relative to other information assets.

Abstract: Embodiments of the invention relate to systems, methods, and computer program products for improved electronic discovery and custodian management. Embodiments herein disclosed provide for an enterprise wide e-discovery system that provides for data to be identified, located, retrieved, preserved, searched, reviewed and produced in an efficient and cost-effective manner across the entire enterprise system. In addition, by structuring management of e-discovery based on case/matter, custodian and data and providing for linkage between the same, further efficiencies are realized in terms of identifying, locating and retrieving data and leveraging results of previous e-discoveries with current requests.

Abstract: Systems and methods are disclosed for employing usage-optimized tables with a computer database system. In one embodiment, the database system stores create, update, and delete database operations in the usage-optimized table. The create, update, and delete database operations remain in the usage-optimized table until a flush condition is reached. When the flush condition is reached, the create, update, and delete operations are transferred to their corresponding real tables. In embodiments, the read operation does not flush the contents of the usage-optimized table to the real table. In such embodiments, the database system modifies read operations to account for data resident on the usage-optimized tables.

Abstract: A query explain plan is described for use with a distributed data system in order to help developers and IT experts to detect bottlenecks and to determine which queries are to blame for a slow running system. In accordance with an embodiment, the distributed data grid utilizes a facility to provide a distributed explain plan. This distributed explain plan provides visibility into how a query was answered by each node in the cluster. For example, one node may have applied the filters of the query in one sequence, while another node may have used a different sequence. Additionally, the distributed query explain plan can provide execution tracing, rendering information about the execution time of each step, total execution time and the like.

Abstract: Techniques and devices for facilitating migration of files between a source system and a target system are provided. A system for facilitating migration of files between a source system and a target system includes an extraction component and an injection component. The extraction component includes at least one extraction handler and a profile engine operative to parse a profile specification, execute the at least one extraction handler, and provide a batch specification. The injection component includes a batch handler for obtaining pulled data from a source system, and a batch engine is operative to parse a batch specification and to create at least one file structure in the target system based on extracted structure information in the batch specification. Methods and GUIs for facilitating migration of files are also described.

Abstract: A system for aggregating data obtained from different organizations within a seed company or within multiple seed companies is provided. The system may receive seed product development data from a seed product development source, seed production data from a seed production source, and/or seed sales and/or marketing data from a seed sales and/or marketing source. The data may be aggregated in a central storage unit based on the geospatial data associated with the received data. The aggregated data may then be accessed and/or output in response to a query and/or algorithm.

Abstract: A temporal relational database includes a relational database framework that allows for all the capabilities of a standard relational database with the addition of the concept of time. Transactions, which can be modifications of attribute values or changes to the database schema, can be stored with temporal histories. Through the use of these temporal histories, the temporal database is able to seamlessly respond to queries for times that are in the past, present, or future. Furthermore, transactions can be entered into the temporal relational database that are not effective until some point in the future, thus allowing for seamless migration of the data and schema of a database. Applications that access data in a temporal database may retrieve a time appropriate schema from the temporal database. An exemplary use of a temporal database to manage roles and responsibilities within an organization is described.

Abstract: A method switches file server from old file server to new file server which are coupled via a backend network and provides data synchronization. The old file server and new file server are coupled with one or more host computers via a frontend network to direct input/output (I/O) requests from the one or more host computers. The method comprises creating stub files in the new file server, the stub files including stub information indicating location of data in the old file server; switching I/O requests directed to old file server to I/O requests directed to the new file server; checking whether the new file server has any stub files; and, if the new file server has one or more stub files, recalling data corresponding to the one or more stub files from the old file server according to the stub information to replace the one or more stub files.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying entities using search results. One of the methods includes determining that a first search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with a first entity type; obtaining search results for the first search query from a search engine, the search results identifying a plurality of resources; identifying entities of the first entity type that are related to any of the plurality of resources identified by the search results; and selecting names of one or more of the identified entities of the first entity type to include in a response to the first search query.

Abstract: A method comprises receiving a plurality of emails. Each of the plurality of emails comprises message information and header information. The header information comprises subject information and one or more email addresses. The method further comprises generating filtered email data comprising email addresses by at least filtering message information and subject information from each of the plurality of emails. The method further comprises correlating sender information and recipient information in the filtered email data, the correlation based at least in part on the one or more email addresses. The method further comprises storing in memory one or more email addresses from the filtered email data.

Abstract: A remote browsing process is directed to the generation and management of a remote browse session at a network computing and storage provider. A client computing device provides a search request to a network computing and storage provider. Responsive to the search request, the network computing and storage provider provides search results corresponding to historical content representations associated with content previously requested by the client computing device or a user associated with the client computing device. The network computing and storage provider may determine the search results based on a navigation path associated with a previous request for content, or based on any number of other factors.

Abstract: Large amounts of data resulting from periodic sampling and capture of data corresponding to variable operational parameters of one or more systems, such as a plurality of vehicles, and stored in a large number of rows of data corresponding to the number of captured samples are summarized in an analytically meaningful way by simply counting the instances of particular values of the operational parameters of interest in the form of a histogram and stored as a single row of data. The reduction in number of rows of data allows acceleration of processing of later queries by a factor of one thousand (assuming an average trip length of ten minutes) or more.

Abstract: Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying entities using search results. One of the methods includes determining that a search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with an entity type; obtaining search results for the search query from a search engine, each search result identifying a respective resource; for each of a plurality of the obtained search results, determining an initial score for each of a plurality of entities of the entity type based on occurrences of names of the entity in the resource identified by the search result; generating a final score for each of the entities based on the initial scores; and selecting one or more names of entities of the entity type to include in a response to the search query based on the final scores.

Abstract: A mechanism for performing automated data integrity verification testing for file systems is described. A method of embodiments of the invention includes initiating a temporary termination of connection between a computer system and a storage medium that is coupled to a file system. The method further includes restoring the connection between the computer system and the storage medium, transmitting data records including transactions indicating data blocks reported to have been committed to the storage device, and facilitating data verification testing at the computer system, the data verification testing including reconciling the data records with contents of files of the file system. The data records represent data blocks that are notified as being committed to the storage medium, and the contents of the files represent data blocks actually committed to the storage device.

Abstract: Techniques for managing data compression in a data protection system are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for managing data compression comprising receiving a request for a data operation, analyzing a data management policy associated with the request, identifying a compression level associated with one or more portions of data in the data operation based at least in part on the data management policy, and identifying a compression algorithm to be used for one or more portions of data in the data operation.

Abstract: Described is automatically processing an initial database repro (text representing a bug when corresponding script is executed in a database engine) into a min-repro (a subset of the text) that is simplified version of the initial repro yet still contains the bug. A parse tree representative of the initial database repro is processed into simplified parse trees based on language grammar rules, e.g., by replacing higher level nodes with descendant nodes. Repros of the simplified parse trees are executed to determine which simplified repros still fail execution because of the bug (that is, the simplified repros were not oversimplified). A minimum simplified parse tree with respect to a desired level of minimality is found from among those failing repros, with the simplified repro that corresponds to the minimum simplified parse tree output as the min-repro.