13672results about "Database updating" patented technology

The present invention is a method of organizing and processing data in a distributed computing system. The invention is also implemented as a computer program on a computer medium and as a distributed computer system. Software modules can be configured as hardware. The method and system organizes select content which is important to an enterprise operating said distributed computing system. The select content is represented by one or more predetermined words, characters, images, data elements or data objects. The computing system has a plurality of select content data stores for respective ones of a plurality of enterprise designated categorical filters which include content-based filters, contextual filters and taxonomic classification filters, all operatively coupled over a communications network. A data input is processed through at least one activated categorical filter to obtain select content, and contextually associated select content and taxonomically associated select content as aggregated select content. The aggregated select content is stored in the corresponding select content data store. A data process from the group of data processes including a copy process, a data extract process, a data archive process, a data distribution process and a data destruction process is associated with the activated categorical filter and the method and system applies the associated data process to a further data input based upon a result of that further data being processed by the activated categorical filter utilizing the aggregated select content data.

An online social networking system can be used to rank social network objects of various different object types, each according to its type. The objects may comprise types such as users, communities, blogs, blog entries, events, forums, forum topics, postings, photographs, and / or images. The product comprises code for carrying out a method that begins with receiving ranking data about social network objects that comprises data about events performed on the social network. For each social network object, a ranking function is applied to ranking data about the social network object based on its type. In addition, the recency of an event on the social network related to the social network object is evaluated, in order to calculate the score for the social network object. A relative ranking for each of the plurality of social network objects based on its score is determined, and the score and relative ranking of each of the social network objects stored.

A method and apparatus for reindexing media content for search applications that includes steps and structure for providing a speech recognition database that include entries defining acoustical representations for a plurality of words; providing a searchable database containing a plurality of metadata documents descriptive of a plurality of media resources, each of the plurality of metadata documents including a sequence of speech recognized text indexed using the speech recognition database; updating the speech recognition database with at least one word candidate; and reindexing the sequence of speech recognized text for a subset of the plurality of metadata documents using the updated speech recognition database.

A user can register and update information in the database even through a terminal having no authority to access the database server. A method of updating a database for using an e-mail received by a mail server to update information stored in a storage means of a database server is prepared. A central processing unit of the database server verifies an account and a data ID shown in a subject space of an e-mail read from a receipt mail box of a mail server with a security master storing therein an IP address and a mail address associated with the account of the user. When the account and the data ID correspond are verified, it is determined that the information corresponding to the data ID stored in the storage means is to be updated.

The various embodiments described herein include methods and systems for generating an audiovisual media item. In one aspect, a method is performed at a server system. The method includes: (1) receiving, from a first electronic device associated with a first user, a creation request to create the media item, the creation request including information identifying one or more audio files and one or more visual media files; (2) obtaining the visual media files; (3) requesting at least one audio file from a server in accordance with the information identifying the audio files; (4) in response to the request, receiving at least one audio file from the server; (5) obtaining any remaining audio files; (6) in response to receiving the creation request, generating the audiovisual media item based on the audio files and the visual media files; and (7) storing the generated audiovisual media item in a media item database.

Methods and computer-readable media for maintaining transactional link-level consistency between a database and a file system. A file system change is logged in a record of a database log and a file corresponding to the file system change is created in a file system folder. During a restart recovery process, an analysis operation and a conditional redo operation are performed based on the database log, and a conditional redo operation and an undo operation are performed based on the files in the file system folder. An undo operation is then performed based on the database log.

A system and method for dynamically evaluating latent concepts in unstructured documents is disclosed. A multiplicity of concepts are extracted from a set of unstructured documents into a lexicon. The lexicon uniquely identifies each concept and a frequency of occurrence. A frequency of occurrence representation is created for the documents set. The frequency representation provides an ordered corpus of the frequencies of occurrence of each concept. A subset of concepts is selected from the frequency of occurrence representation filtered against a pre-defined threshold. A group of weighted clusters of concepts selected from the concepts subset is generated. A matrix of best fit approximations is determined for each document weighted against each group of weighted clusters of concepts.

A system and method for linking information of one user to other users via a data aggregation server is provided. Various security settings govern the linking of information. Various methodologies for initiating a link of PIM data are also provided including automatic linking, targeted linking and requested linking. Implementations utilizing group profiles are also provided.

A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. A primitive storage layer (storage pools) knits together raw block stores and provides a storage mechanism for containers and transaction logs. Storage pools are manipulated by individual file servers. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Key-value stores relate keys to data for such purposes as directories, container location maps, and offset maps in compressed files.

Techniques for managing big data include retrieval using per-subject dictionaries having multiple levels of sub-classification hierarchy within the subject. Entries may include subject-determining-power (SDP) scores that provide an indication of the descriptive power of the entry term with respect to the subject of the dictionary containing the term. The same term may have entries in multiple dictionaries with different SDP scores in each of the dictionaries. A retrieval request for one or more documents containing search terms descriptive of the one or more documents can be processed by identifying a set of candidate documents tagged with subjects, i.e., identifiers of per-subject dictionaries having entries corresponding to a search term, then using affinity values to adjust the aggregate score for the terms in the dictionaries. Documents are then selected for best match to the subject based on the adjusted scores. Alternatively, the adjustment may be performed after selecting the documents by re-ordering them according to adjusted scores.

A social graph is built which includes interactions, sharing activity, and connections between the users of the open Web and can be used to improve ad targeting and content personalization. Sharing activity between two users will affect ads or content that both users will be presented while surfing the Web. This sharing activity includes sending of links, sending of videos, sending of files, cutting and pasting of content, sending text messages, and sending of e-mails.

A column-store database computer system responsive to database requests for the update and retrieval of data from within a stable data table providing for the storage of database tuples within a column-store organized database structure. A positional delta tree data structure is implemented in the memory space of the computer system and is operatively coupled in an update data transfer path between a database engine interface and the stable data table. The positional delta tree data structure includes a differential data storage layer operative to store differential update data values in positionally defined relative reference to database tuples stored by the stable data table.

Cluster storage is disclosed. A data stream or a data block is received. The data stream or the data block is broken into segments. For each segment, a cluster node is selected, and in the event that a similar segment to the segment is identified that is already managed by the selected cluster node, a reference to the similar segment and a delta between the similar segment and the segment is caused to be stored on the selected cluster node.

The present invention pertains to enhancement or refinement of estimated locations based upon user-specific information. Upon user authorization, geographical information is extracted from a number of user-related sources, including the web browser history, search history, maps history, address book, e-mail archives and calendar entries. Such information is used to build a spatial index of specific physical locations for a geocoded result set. From this, heat maps identifying particular locations from the user-related sources are created for different periods of time. The heat maps may be used to refine an initial location estimate of the user. This may be done by determining whether one or more positions in a given heat map provide a more accurate position of the user than the initial estimate. If so, a best position is selected. This can be used to provide enhanced driving directions to the user.

Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected.

Ranking and selecting entities based on calculated reputation or influence scores is provided. In some embodiments, a method includes determining whether a first entity is a subject or an object; determining whether a second entity is a subject or an object; and generating a graph, in which a subset of the graph is a subject graph of subject nodes that includes at least one or more subjects (e.g., subject entities) linked to one or more other subjects, and in which the graph includes one or more objects (e.g., object entities) each linked to one or more subjects in the subject graph. In some embodiments, the graph includes directed and undirected links. In some embodiments, the graph includes one or more objects linked to one or more objects.

Techniques for transferring objects between database systems. As implemented in a relational database management system, the techniques employ a data transfer mechanism that operates under control of a master table in the RDBMS that is performing the transfer operation. The master table specifies the kind of transfer operation to be performed, a set of objects to be transferred, operations to be performed on the objects as they are being transferred, and filters for selecting a subset of the objects. During execution of the transfer, the transfer mechanism maintains and updates state in the master table such that queries may be made on the master table to determine the current status of the operation and such that the transfer mechanism may restart the operation after it has been stopped either at the request of a client that is performing the operation or because of an error in the transfer. The master table's persistence and the status information it contains permit the client that is performing the operation to detach from the operation without stopping the operation and later again attach to the operation to determine the operation's status or to perform operations such as creating new files for the operation or changing the degree of parallelism with which the transfer operation is being performed. Another feature of the transfer mechanism is using an object's metadata to determine the most efficient way of transferring the object.

A portable, application-specific USB autorun device, following connection to a computer terminal, automatically initialises or presents itself as a known type of device and then automatically sends to the terminal a sequence of data complying with a standard protocol, that sequence of data automatically causing content to be accessed or a task to be initiated. The device (i) includes a standardised USB module that includes a USB microcontroller, the standardised module being designed to be attached to or embedded in multiple types of different, application specific packages but (ii) excludes mass memory storage for applications or end-user data.

Disclosed herein is an electronic device network including a plurality of electronic devices. The electronic devices may each have updating software adapted to update firmware / software resident in the electronic devices. The electronic devices may also employ additional software for updating the updating software in the electronic devices. The electronic devices may also have software adapted to determine whether a current version of the updating software is to be invoked or whether a previous backup version of the updating software is to be invoked. The determination may be made based upon status information resident in a update status indicator. The status information may indicate that an update upon the updating software is to be conducted, rather than a normal startup operation without performing any updates. The network may also include an update generator adapted to generate updates for use in updating the updating software in the electronic devices.

Cluster storage is disclosed. A data stream or a data block is received. The data stream or the data block is broken into segments. For each segment, a cluster node is selected, and a portion of the segment smaller than the segment is identified that is a duplicate of a portion of a segment already managed by the cluster node.

There is provided a method for HTML directed adaptive features for mobile applications. By presenting user interface portions of the application as HTML documents referenced from a manifest file, the manifest file may be updated from a remote server without directly modifying a native binary of the application. By registering URL handlers for application functions in the native binary of the application, and by modifying a local file manifest stored on a mobile device, the scope of application functionality can be updated by adding, removing, or modifying URLs. The manifest files may further be adapted using specific contexts, such as device hardware, location, user profile data, and other information. Advantageously, application update approval processes through application marketplaces may be bypassed since the native binary is kept intact, allowing for more timely and relevant updates.

Systems and methods are provided for ranking points of interest (POIs). According to one implementation, a computer-implemented method may be provided that includes receiving geographic information from a user device, and selecting a plurality of points of interest within the geographic region. The method may also include generating an initial ranking of the selected points of interest based on voting information received from the user device, viral input from a user's social network, and / or additional input based on searches for maps and travel directions for traversing a route. In addition, the method may include calculating a modified ranking of the selected points of interest.

Methods, computer programs, and systems for updating an access control list (ACL) associated with one or more resources in a data processing system are provided. The method includes providing a table including a list of one or more first ACLs that map to a corresponding one or more previously computed second ACLs; and updating a current ACL associated with a first resource of the one or more resources in the data processing system including determining whether one of the one or more first ACLs in the table matches the current ACL associated with the first resource. If one of the one or more first ACLs in the table matches the current ACL associated with the first resource then updating the current ACL associated with the first resource by associating the corresponding second ACL with the first resource.

A record management system includes: a configuration repository providing a mapping between object information and record management information for each of a plurality of record management actions; at least one object side record management module communicatively coupled with an ECI tool, an ILM engine and the configuration repository, and being responsive to object events, and operative to initiate and control at least one of the record management actions based on the mapping provided by the configuration repository; and at least one record side record management module communicatively coupled with the ILM engine and the configuration repository, and being responsive to record events, and operative to initiate and control at least one of the record management actions based on the mapping provided by the configuration repository.

A replicated decentralized storage system comprises a plurality of servers that locally store disk images for locally running virtual machines as well as disk images, for failover purposes, for remotely running virtual machines. To ensure that disk images stored for failover purposes are properly replicated upon an update of the disk image on the server running the virtual machine, a hash of a unique value known only to the server running the virtual machine is used to verify the origin of update operations that have been transmitted by the server to the other servers storing replications of the disk image for failover purposes. If verified, the update operations are added to such failover disk images.

Methods, computer-readable media, and systems for scheduling the association of metadata with content. In an embodiment, event information is obtained from a virtual calendar, wherein the event information comprises at least one event detail and one or more parameters defining a time period. First metadata is generated based on the event detail, and is stored, in association with the time period, in a memory. Then, subsequently, during the time period, the first metadata may be retrieved from the memory, and associated with one or more content items generated on the device.

The present disclosure relates to systems and methods for identifying products and monitoring planogram compliance using analysis of image data. In one implementation, the method may include accessing at least one planogram describing a desired placement of a plurality of product types on shelves of a plurality of retail stores; receiving image data from the plurality of retail stores; analyzing the image data to determine an actual placement of the plurality of product types on the shelves of the plurality of retail stores; determining at least one characteristic of planogram compliance based on detected differences between the at least one planogram and the actual placement of the plurality of product types on the shelves of the plurality of retail stores; and receiving checkout data from the plurality of retail stores reflecting sales of at least one product type from the plurality of product types.