Abstract: An apparatus, method, system, and program product are disclosed for data replication. One method includes determining a predicted match ratio. The predicted match ratio may predict a percentage of a current version of a file that matches a prior version of the file. The method may include performing a delta transfer if the predicted match ratio is greater than a predetermined threshold. The delta transfer may transfer a portion of the current version of the file that has changed relative to the prior version of the file. The method may include performing a transfer of the current version of the file if the predicted match ratio is less than the predetermined threshold.

Abstract: A system for large-scale crowd sourcing of map data cleanup and correction, comprising an application server that generates image data, sends image data to a user device, receives tagging data provided by the device user, and provides tags to a crowdsourced search and locate server based on tagging data from a user device, a crowdsourced search and locate server that receives tags from an application server, computes agreement and disagreement values and performs expectation-maximization analysis, and a map data server that stores and provides map data, and a method for estimating location and quality of a set of geolocation data.

Abstract: Techniques are described for generating geographic borders. In one example, techniques include recognizing a geographic location, determining a starting latitude and a starting longitude and population for the geographic location, and generating a border for the geographic location based on the starting latitude, starting longitude, and population.

Abstract: There is provided an information processing device including: a global map acquiring unit that acquires at least a part of a global map representing positions of objects in a real space where a plurality of users are in activity; a local map generating unit that generates a local map representing positions of nearby objects detectable by a device of one user among the plurality of users; and an updating unit that updates the global map based on position data of objects included in the local map.

Abstract: Systems and methods for the management of contact information, which may include automatic transfer processes, automatic update processes, automatic customization processes, automatic delivery processes, automatic storage processes, automatic portability processes, and/or automatic radial mining processes.

Abstract: Embodiments are directed towards a dynamic change evaluation mechanism, whereby items having a detected possible change are scheduled for re-evaluation for possible changes at a higher frequency than items detected to not have previously changed, while those items detected as not to have changed are dynamically scheduled for re-evaluation based on an evaluation backlog that may be in turn based, in part, on a time from when an item is assigned an expiration time to when the item is evaluated. In one embodiment, a possibly changed item may be assigned a new expiration time independent of the evaluation backlog. In another embodiment, if no change is detected, then the item may be assigned a new expiration time as a function of a previous expiration time and on the evaluation backlog.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for prioritizing test cases for relational database systems. The method includes identifying one or more data tables within a relational database. The method further includes identifying an exclusivity value for each of the one or more identified data tables. The method further includes calculating a table weight for each of the one or more identified data tables. The method further includes prioritizing the one or more identified data tables based on the respective calculated table weights. The method further includes identifying one or more sequences of database statements corresponding to the prioritized data tables, wherein a database statement is a command executed on one of the prioritized data tables. The method further includes prioritizing the one or more identified sequences based on the corresponding database statements.

Abstract: A computer-implemented method for reusing deleted database records includes, receiving, by a database manager executing within a computing device, a first query request to insert, into a database table, a first set of database records. The database manager identifies a first set of entries within a journal log bundle. The database manager also determines, in response to identifying a first set of entries, that there is a third set of deleted database records located on a same page as a second set of database records. The database manager also, in response to determining that there is a third set of deleted database records located on a same page as the second set of database records, inserts into the database table the first set of database records using the third set of deleted database records.

Abstract: A method to share remote DMA (RDMA) pointers to a key-value store among a plurality of clients. The method allocates a shared memory and accesses the key-value store with a key from a client and receives an information from the key-value store. The method further generates a RDMA pointer from the information, maps the key to a location in the shared memory, and generates a RDMA pointer record at the location. The method further stores the RDMA pointer and the key in the RDMA pointer record and shares the RDMA pointer record among the plurality of clients.

Abstract: The invention presents a process for obtaining candidate reference data to compare to a data to be identified, implemented in a system comprising a client unit and a storage server comprising two databases, in which: —the first database comprises indexed memory blocks each comprising a corresponding encrypted indexed reference data, and —the second database comprises memory blocks indexed by all possible hash values obtained by a plurality of k indexed hash functions, and wherein each block contains a list of the indexes of the reference data which hashing by one of said hash function results in the hash value corresponding to said block, said process comprising the steps during which: —the client unit hashes the data to be identified with each of the plurality of hash functions, and reads the k memory blocks of the second database corresponding to the hash values thus obtained, the client unit identifies indexes contained in at least t out of k read memory blocks, and —the client unit reads the memory blocks

Abstract: Embodiments are provided for composing multidimensional keys for data blocks organized according to space filling curve approaches in database systems. An embodiment method includes organizing multidimensional data in a storage using a space filling curve algorithm. A plurality of data access paths for allowing access to the data are generated in a hierarchical index topology including an intermediate index page and a plurality of leaf pages. A plurality of odometer-type keys, which point to corresponding data blocks of the multidimensional data in the storage, are digitally composed in the leaf pages using bit clustering in a dimension-by-dimension manner of the multidimensional data. The odometer-type keys have numerical values that determine access to the data blocks according to the space filling curve algorithm. The composition of the odometer-type keys is independent of the numerical values of the odometer-type keys.

Abstract: A database storage system creates secure snapshots or virtual databases based on a source database that stores sensitive information. The database storage system applies a masking function to the sensitive data and stores the masked data in the secure snapshot. The database storage system creates secure snapshots that share masked database blocks with other secure snapshots. The database storage system shares masked database blocks by storing information identifying a previously created masked database block for a new secure snapshot. If a masked database block for the new secure snapshot is different from the previously created masked database block, the database storage system stores metadata including the difference between the two masked database blocks. The database storage system allows sharing any transformed database blocks across snapshot, if the transformed database blocks are obtained by applying a transformation function to data of the source database.

Abstract: Exemplary embodiments are directed to a method and apparatus for storing data for a batch of manufactured items. The method comprises defining in a processor, using a lower limit identifier and an upper limit identifier, a range of unique item identifiers for the batch, wherein each manufactured item in the batch is allocated a unique item identifier falling within the range. The item identifiers are stored in allocated storage space. If an upper limit identifier is specified for each time interval, an amount of storage specified for all manufactured items during a production time period is calculated as a sum of a first product and a second product, the first product being a product of a production time and a size allocated to each upper limit identifier, and the second product being a product of the production time, a total number of manufactured items, and a percentage of unused identifiers.

Abstract: The present disclosure relates to the field of data processing, disclosing a method and apparatus of inter-databases data updating. A method of inter-databases data updating of the present disclosure includes the steps of generating a third row of data based on data of a first database, where data of at least one column of the third row of data is a no-operation operator, the no-operation operator indicating no data change; and updating a fourth row of data of a second database based on the third row of data, where no-operation operator columns of data of the third row of data are not utilized to update data of corresponding columns of the fourth row of data, non no-operation operator columns of data of the third row of data are utilized to update data of corresponding columns of the fourth row of data.

Abstract: A method of migrating data entries stored in a distributed data store from a source memory device of the data store to a target memory device of the data store. The method comprises locking a data entry in the source memory with a soft locking mechanism by an application executing on a computer system, reading the data entry in the source memory by the application, cloning the data entry in a shadow journal in the target memory by the application, launching a plurality of alias redirection threads by the application, where each remaps one of a plurality of aliases of the data entry from referencing the location of the data entry in the source memory to referencing the location of the data entry in the target memory, and committing the data entry in the shadow journal to the target memory by the application.

Abstract: A system, apparatus, and method are provided for adding, deleting, and modifying rules in one update from the perspective of an active search process for packet classification. While a search processor searches for one or more rules that match keys generated from received packets, there is a need to add, delete, or modify rules. By organizing a plurality incremental updates for adding, deleting, or modifying rules into a batch update, several operations for incorporating the incremental updates may be made more efficient by minimizing a number of updates required.

Abstract: A system and method for maintaining consistency across a decentralized database cluster is presented. A database cluster can contain a plurality of database servers, each hosting a copy of the same database. In a system without a centralized coordinating server, a message queue can be used to simultaneously provide updates to each database server in the database cluster. A When a database server receives an index update message, it adds message to a queue indicating it has received the message and watches an index update node. Once every server in the cluster has added a message to the queue, it is known that every database server has received the message. The update can be performed for each server and the changes committed simultaneously. In such a manner, all database servers in the cluster perform an update at approximately the same time. Other embodiments also are disclosed.

Abstract: A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: An authoring platform for authoring a client workflow includes an arrangement of shapes representing steps and connections representing relationships between the steps. Online content retrieved from an online resource may be associated with steps of the client workflow. An authoring service receives the client workflow from the client interface via a network and directs a graph database to store a database workflow corresponding to the client workflow. A search platform is provided for creating and searching workflows using a tag database taxonomy. An author creates a workflow wherein a tag is linked to a workflow item. The workflow is stored as a database workflow and a node in the database workflow representing the workflow item is linked to a node in the database taxonomy representing the tag. Multiple workflows are created in a similar manner to link the workflows to the database taxonomy to provide efficient searching of the workflows.

Abstract: A method for performing a search on a user device includes transmitting a search query to a search engine from a processing device via a network and receiving, by the processing device, search results from the search engine. The method also includes displaying, by the processing device, the search results and receiving, by the processing device, a first user input directed to one or more of the input elements of the query card. The method also includes receiving, by the processing device, a second user input selecting the query card, generating, by the processing device, the selected search query based on the first user input and transmitting the selected search query to the search engine.

Abstract: Embodiments effect the combination of data from different tables (e.g., of an underlying database), and the visualization of that combined table data in an incremental manner. Columns from a second table may be selectively combined with those of a first table, manually by user selection and/or automatically by best guess matching. Such matching may be based upon commonalities between table column headers. A menu may allow user selection of specific table(s)/table column(s) to be combined with a first table, as well as a manner of that combination (e.g., particular types of SQL join operations). The table data combination process is visualized step-by-step (e.g., allowing toggling and forward/backward navigation between interface screens), ensuring the user is able to follow data migration in the combined workflow, and appreciate/recognize changing values resulting therefrom.

Abstract: In one embodiment, a method for improving cardinality estimation of a join predicate between a fact table and an overloaded dimension table is provided. The method includes receiving a dimension table and a fact table in a join predicate of one or more SQL statements. The method further includes identifying a majority of records in the fact table that refer to a subset of records in the dimension table. The method further includes computing a filter factor of the join predicate between the dimension table and the fact table. The method further includes creating a statistical view using one or more relevant portions of the dimension table that are referred to by the fact table.

Abstract: Disclosed aspects relate to automated query modification in a database management system (DBMS). A triggering event related to an execution of a query may be detected by an automated query modification engine. A query modification operation may be determined by the automated query modification engine based on a nature of the triggering event. The query modification operation may be determined to debug the triggering event related to the execution of the query. The query modification operation may be carried-out by the automated query modification engine. The query modification operation may be carried-out to modify the query to debug the triggering event related to the execution of the query.

Abstract: Representative embodiments are disclosed for a rapid and highly parallel decompression of compressed executable and other files, such as executable files for operating systems and applications, having compressed blocks including run length encoded (“RLE”) data having data-dependent references. An exemplary embodiment includes a plurality of processors or processor cores to identify a start or end of each compressed block; to partially decompress, in parallel, a selected compressed block into independent data, dependent (RLE) data, and linked dependent (RLE) data; to sequence the independent data, dependent (RLE) data, and linked dependent (RLE) data from a plurality of partial decompressions of a plurality of compressed blocks, to obtain data specified by the dependent (RLE) data and linked dependent (RLE) data, and to insert the obtained data into a corresponding location in an uncompressed file.

Abstract: A continuous event processing (CEP) query processor determines how and when a CEP query can be processed in a concurrent manner, such that multiple threads of execution can concurrently perform at least some of the CEP query's operations concurrently with each other. According to one technique, a user can instruct a CEP query processor to attempt to execute a CEP query in a concurrent manner. The CEP query processor responsively determines whether the CEP query's execution, or parts thereof, can be made concurrent based on certain constraints that can depend on inheritance and operation type. Based on this determination, the CEP query processor can execute at least certain parts of a CEP query in parallel relative to the same event within an event stream.

Abstract: An item recommendation method and apparatus are provided. The item recommendation method and apparatus may recognize items preferred before a user uses items, based on items rated by the user, and may recommend an item to the user based on preferences for the recognized items.

Abstract: The present invention provides a method and apparatus for representing content information. The method and apparatus for representing content information according to embodiment of the present invention notifies the user employing a mobile environment (mobile terminal or smart terminal) in a tactile, auditory, or visual manner about existence of contents having a score larger than or equal to a particular score within a predetermined distance to represented contents in a predetermined order and enables the user to perform a search for the contents desired by the user based on the user's input, providing such an advantage that the user can find the contents of interest intuitively without examining searched contents one after another.

Abstract: A question and answer based customer support system is provided through which users submit question data representing questions to be answered using support resources. Low quality and/or high quality question formats are defined and questions having a low quality question format are labeled improperly formatted questions, while questions having a high quality question format are labeled properly formatted questions. Received question data is analyzed to determine if the question data represents an improperly or properly formatted question before allocating support resources to generating an answer. If, a determination is made that the question data represents an improperly formatted question, corrective actions are taken before allocating support resources to generating an answer. If a determination is made that the question data represents a properly formatted question, the question represented by the question data is allocated support resources to generate an answer on a priority basis.

Abstract: Certain aspects of the present disclosure relates to a computer implemented method for executing application code to access data and a data source through a data-sharing application, the method including providing at least one flexible activex data object (ADO) .Net for the data source defined by at least one customized dynamic-link library (DLL). The at least one customized DLL may be loaded based on at least one identification in a configuration file in order to communicate to a service in at least one service layer in a network. The at least one flexible ADO.Net provider dll or library may be used to migrate at least one application for the data source.

Abstract: A model-based approach for transforming data. A modeling framework that includes a plurality of rules for performing transformations of data is developed. A data unit is configured. The data unit is assigned to a job that includes one or more rules of the plurality of rules. The job transforms the data unit from a data format of a source system into a data format of a destination system. Usage statistics for at least one rule of the job are monitored. An aggregate rule is determined based on a first atomic rule and a second atomic rule. The first atomic rule and the second atomic rule are identified by at least one, or in part by a common pattern. A first rule of the job is identified based on the usage statistics of a plurality of data units. The first rule is removed from memory.

Abstract: According to one embodiment of the present invention, during database replication from a source database to a target database, operations applied to the source database are transferred as target operations and applied to the target database. A request from a requestor to idle a specified database object is received during the database replication. In response to receiving the request, transference of the target operations for the specified database object from the source database to the target database is terminated and target operations for the specified database object on the target database are monitored. In response to no target operations being applied to the specified database object on the target database, replication of the specified database object is suspended and the requestor is notified when the idling of the specified database object has completed.

Abstract: A computer-implemented method, computerized apparatus and computer program product, the method comprising: receiving a proposed reconfiguration command, the proposed reconfiguration command indicating a modification of a protocol version employed by a plurality of replica-set processes to an updated protocol version; tentatively agreeing on at least one proposed command following the proposed reconfiguration command, the at least one proposed command being in accordance with the updated protocol version, wherein said tentatively agreeing is decided prior to agreeing on the reconfiguration command; and, responsive to agreeing on the reconfiguration command, committing the tentatively agreed at least one proposed command.

Abstract: A method for image processing is provided. The method includes: obtaining an image including a table; generating a skeleton graph associated with the table and including a plurality of edges; identifying a first terminal vertex on the plurality of edges; generating a first region of interest for the first terminal vertex; determining a first target within the first region of interest; and repairing the table by adding a first artificial edge between the first terminal vertex and the first target to the skeleton graph.

Abstract: A mechanism is provided in a data processing system for presentation delivery. The mechanism delivering a presentation content to a group of users and receives a plurality of questions concerning the presentation content from the group of users. The mechanism stores the plurality of questions in a question history database and clusters the plurality of questions in the question history database into one or more question clusters. The mechanism determines a topic for each of the one or more question clusters to form one or more question topics and generates feedback for updating the presentation content based on the one or more question topics.

Abstract: The invention notably relates to a computer-implemented method of designing a choropleth map, wherein the method comprises providing a map, and a number (n) of numerical values (x1, . . . , xn) that represent a statistical variable at respective areas of the map; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; assigning a respective coloration to each cluster of the computed clustering; and at all areas of the map at which a respective numerical value is provided, applying the coloration assigned to the cluster to which the respective numerical value belongs. Such a method improves the design of a choropleth map.

Abstract: First and second data partitions that include first and second portions of data, respectively, from a first of a plurality of data streams are received. A first storage location of a distributed storage system, a first set of metadata for the first of the plurality of data streams is stored. A first and second digest is created for the first and second data partition, respectively, wherein each of the first and second digests include a data structure that points to the first storage location. The first and second data partitions including the first and second digest, respectively, is transmitted to one or more nodes of a cluster computing environment, wherein the one or more nodes are capable of accessing the first storage location via the data structure that points to the first storage location, and wherein the accessing of the first storage location provides processing information. The first and second data partition are processed using the processing information.

Abstract: A computer for identifying categories of web pages. The computer comprises a processor, a non-transitory memory, and an application stored in the non-transitory memory. When executed by the processor the application builds an unvalidated table of uniform resource locators (URLs) in the non-transitory memory based on crawling the World Wide Web, navigates to at least some of the URLs stored in the unvalidated table, analyzes web pages to identify keywords, evaluates the URLs to belong to one or more web page categories using web page categorization rules based on the identified keywords, stores an entry for each evaluated URL in a validated table in the non-transitory memory, each entry comprising the URL, the one or more categories associated to the URL, and the keywords identified in the web page associated to the URL, performs a frequency analysis of keywords associated to URLs, and adapts the web page categorization rules.

Abstract: A system comprises reception of a dataset comprising at least one dataset attribute and one or more instances of each dataset attribute, determination of a similarity value between instances of each pair of one of the at least one dataset attribute and one of a plurality of stored attributes, determination of an intersection between instances of each pair of one of the at least one dataset attribute and one of the stored attributes having a similarity greater than a threshold, and generation of metadata associating a dataset attribute with a semantic entity with which a stored attribute having a similarity to the dataset attribute greater than the threshold is associated.

Abstract: First and second data partitions that include first and second portions of data, respectively, from a first of a plurality of data streams are received. A first storage location of a distributed storage system, a first set of metadata for the first of the plurality of data streams is stored. A first and second digest is created for the data partitions, wherein each of the digests include a data structure that points to the first storage location. The data partitions including the digests are transmitted to one or more nodes of a cluster computing environment, wherein the one or more nodes are capable of accessing the first storage location via the data structure that points to the first storage location, and wherein the accessing of the first storage location provides processing information. The data partitions are processed using the processing information.

Abstract: In one embodiment, a system includes at least one processor and logic integrated with and/or executable by the at least one processor, the logic configured to create a first base record in a keyed index of a database, the first base record including a first unique key and a first data record, wherein the first data record includes at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair, and create one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record. More embodiments of systems, methods, and computer program products for providing alternate keys are also presented.

Abstract: The specification relates to a method of receiving a first query and a second query. The method analyzes the second query for a presence of anaphora. If anaphora is present, the method analyzes the first query for a presence of an entity that can be associated with the anaphora. If the analysis analyzing the first query returns two or more associated entities, the method forms a third query wherein the anaphora of the second query is replaced with one of the associated entities and forms a fourth query wherein the anaphora is replaced with the other of the associated entities. The third query and the fourth query are sent to a query-ranking engine. The third query and the fourth query receive a ranking and the higher-ranked query is sent to a search engine.

Abstract: Innovations in the areas of determining search areas and queries for database searches are presented. For example, a search tool receives input for a search area for a database search. For the database search, the search tool determines one or more target tables that fit the search area input. In this way, the search tool can determine “on-the-fly” which database tables are relevant for the database search. The search tool can also receive input for a search string and construct queries for the database search in the target table(s). For a field of a table, the search tool can selectively convert a search value to a data format of the field. If the search string input includes multiple search values, the search tool can construct an OR query and/or an AND query. The search results can indicate real-time status of the database, while accounting for complex structures of database tables.

Abstract: A searching method and a searching apparatus are provided. The method includes: obtaining a search term input from a client device; determining a type of the search term, and obtaining a knowledge graph corresponding to the type of the search term; and returning the knowledge graph corresponding to the type of the search term to the client device, such that the client device displays information contained in the knowledge graph in a structured form.

Abstract: A computer-implemented method for pairing a new document to a document from a plurality of documents. Embodiments include, for each of the new document and the plurality of documents, generating a vector of terms of interest uniquely associated with a document of the new document and the plurality of documents. For each term of interest, an associated element value of the vector is assigned as zero if the term of interest does not occur in the document and one otherwise. The method also includes, for each document from the plurality of documents, determining a similarity between the vectors. The method also includes selecting a document from the plurality of documents as related to the new document if the similarity between the vector for the new document and the vector for the document from the plurality of documents is greater than or equal to a threshold value.

Abstract: Provided are techniques for creating an inverted index for features of a set of data elements, wherein each of the data elements is represented by a vector of features, wherein the inverted index, when queried with a feature, outputs one or more data elements containing the feature. The features of the set of data elements are ranked. For each feature in the ranked list, the inverted index is queried for data elements having the feature and not having any previously selected feature and a cluster of the data elements is created based on results returned in response to the query.

Abstract: A method, computer system, and a computer program product for building and applying fuzzy term partitions is provided. The present invention may include building a fuzzy category taxonomy. The present invention may also include implementing the built fuzzy category taxonomy into a fuzzy category classifier. The present invention may then include building a fuzzy term extractor. The present invention may further include building a fuzzy term association map. The present invention may also include processing a plurality of words stored on a database. The present invention may then include extracting a fuzzy term from the processed plurality of words. The present invention may further include associating the extracted fuzzy term with a plurality of context data. The present invention may also include producing a context data partition for the extracted fuzzy term. The present invention may then include applying a weight to the extracted fuzzy term.

Abstract: The present disclosure provides computer-implemented systems and processes for augmenting user ratings of items, such as a rating of a song playing on a user device, by analyzing contextual information, such as user and/or device activity data associated with the device. The contextual information may be used to determine an associated intensity of the rating or feedback. The determined intensity levels can be used to weigh the associated rating events and improve the quality of item recommendations that are based on such ratings. Contextual information may indicate whether the user transitioned from another application to rate an item, device status information, and so on. In one embodiment, contextual information can be used to assess how intensely the user feels about a music item and to provide improved music recommendations, such as songs to provide in a playlist or radio station, based on the intensity.

Abstract: Video processing for motor task analysis is described. In various examples, a video of at least part of a person or animal carrying out a motor task, such as placing the forefinger on the nose, is input to a trained machine learning system to classify the motor task into one of a plurality of classes. In an example, motion descriptors such as optical flow are computed from pairs of frames of the video and the motion descriptors are input to the machine learning system. For example, during training the machine learning system identifies time-dependent and/or location-dependent acceleration or velocity features which discriminate between the classes of the motor task. In examples, the trained machine learning system computes, from the motion descriptors, the location dependent acceleration or velocity features which it has learned as being good discriminators. In various examples, a feature is computed using sub-volumes of the video.

Abstract: In embodiments, the present invention provides a method and system for delivery of content on a mobile media platform, providing an automated tag processing facility, and delivering content to a mobile device, wherein content delivery is based at least in part on the automated tag processing.