25th week of 2017 patent applcation highlights part 56 |
Patent application number | Title | Published |
20170177565 | Identifying Vague Questions in a Question-Answer System - An approach is provided that improves a question answering (QA) computer system by reducing a number of vague questions submitted to the QA system. When a question is submitted to the QA system, the approach performs a vagueness question analysis on the question. The vagueness question analysis results in a vagueness score. The question is submitted to the QA system in response to the vagueness score reaching a threshold value that indicates a lack of vagueness in the question. The approach inhibits submission of the question to the QA system in response to the vagueness score failing to reach the threshold value. | 2017-06-22 |
20170177566 | SYSTEMS AND METHODS FOR INDEPENDENT COMPUTER PLATFORM LANGUAGE CONVERSION SERVICES - A conversion management (CM) computing device is provided. The CM computing device includes a processor in communication with a memory. The processor is causes the CM computing device to receive, from an app developer device, a plurality of input locale identifiers and an input text string, convert the input text string into at an input text token, compare the input locale identifiers and the input text token to a localization table that includes a plurality of entries. Each entry includes a stored text token, a stored locale identifier, and a translated text string. The processor further causes the CM computing device to identify a matching entry included within the localization table for the input locale identifiers. The matching entry includes a stored locale identifier matching one of the input locale identifiers, a stored text token matching the text token, and an associated translated text string. | 2017-06-22 |
20170177567 | Analyzing Web Site for Translation - A system, method and computer readable medium for synchronizing web content is disclosed. The method includes retrieving a first web content in a first language from a web site, the first web content corresponding to a second web content wherein the second web content is a translation in a second language of the first web content. The method further includes dividing the first web content into a plurality of translatable components and generating a unique identifier for each of the plurality of translatable components. The method further includes matching each of the plurality of translatable components to a plurality of translated components of the second web content using the unique identifier of each of the plurality of translatable components. If a translatable component is not matched to a translated component, the method further includes designating the translatable component for translation into the second language. | 2017-06-22 |
20170177568 | INTERNATIONALIZATION DURING NAVIGATION - Embodiments of the present invention provide systems and methods for internationalization of real-world features during navigation. The method includes receiving a request for navigation to a landmark in a particular language. The method further includes retrieving keywords from a database associated with the landmark, and scoring the keywords based on their level of recognition to a user. The highest ranked keywords are then sent to the user to navigate to the landmark. | 2017-06-22 |
20170177569 | METHOD FOR WRITING A FOREIGN LANGUAGE IN A PSEUDO LANGUAGE PHONETICALLY RESEMBLING NATIVE LANGUAGE OF THE SPEAKER - Provided is a method, device, and computer-readable medium for converting a string of characters in a first language into a phonetic representation of a second language using a first data structure that maps graphemes in the first language to one or more universal phonetic representations based on an international phonetic alphabet, wherein the first data structure comprises a plurality of first nodes with each first node of the plurality of first nodes having a respective weight assigned that corresponds to a likely pronunciation of a grapheme, and a second data structure that maps the one or more universal phonetic representations to one or more graphemes in the second language, wherein the second data structure comprises a plurality of second nodes with each second node of the plurality of second nodes having a respective weight assigned that corresponds to a likely representation of a grapheme in the second language. | 2017-06-22 |
20170177570 | METHOD FOR PROCESSING DOSE INFORMATION IMAGES - The present disclosure relates to methods for automatically controlling loading processes of dose information images. In one example, the method includes receiving a data record at a local data repository, wherein the data record contains a dose information image and a scanner index. The method further includes: comparing the scanner index against a whitelist from the central data repository; transmitting the data record from the local data repository to a checking directory of the central data repository when the scanner index is not contained in the whitelist; validating the dose information image from the checking directory by character recognition; and entering the scanner index in the whitelist in the event of successful validation of the dose information image. | 2017-06-22 |
20170177571 | USING CROSS-MATCHING BETWEEN USERS AND MATCHING AGAINST REFERENCE DATA TO FACILITATE CONTENT IDENTIFICATION - Techniques for identifying video and/or audio content are presented. An identification management component (IMC) groups users determined to be at least potentially be watching the same content based on first content fingerprints associated with respective content viewed by the users on communication devices, and a defined matching criterion. IMC facilitates identifying the content associated with the group of users based on first content fingerprints associated with the group of users and first reference content fingerprints. IMC receives a second content fingerprint associated with a communication device of a user in the group, sends the second content fingerprint to a third-party identification component for comparison with second reference content fingerprints, and receives content identification information in response. IMC identifies the content for the group of users based on the content identification information and/or the content identification made based on the first content fingerprints associated with the group. | 2017-06-22 |
20170177572 | ADAPTIVE MUSIC AND VIDEO RECOMMENDATIONS - The user feedback module receives from a user device a selection of a seed media item. The seed media item includes a seed label. The user feedback module further generates a list, the list includes the seed label and a set of related labels based on the seed label. The seed label and each related label include a separate label weight. The user feedback module also identifies multiple media items associated with an associate label. The associate label includes at least one of the seed label or a related label of the first set of related labels. The user feedback module also transmits to the user device a first media item from the multiple media items. The user feedback module adjusts the label weight of the associate label based on a user feedback on the first media item. | 2017-06-22 |
20170177573 | METHOD AND SYSTEM FOR HYBRID SORT AND HASH-BASED QUERY EXECUTION - A database system, computer program product, and a method for evaluating aggregates in database systems includes hashing of aggregation keys on a per bucket basis, and depending on a number of hashed tuples per bucket, sorting said tuples. Additionally, depending on the number of hashed tuples per bucket, the bucket is kept without change. Moreover, depending on the number of hashed tuples per bucket, maintaining a secondary hash table for a particular bucket, map tuples to it, aggregate as you map. | 2017-06-22 |
20170177574 | SYSTEM AND METHOD OF SUPPORTING USER LEVEL FILE SYSTEM TRANSACTIONS USING BATCH RENAME AND FILE CLONES - System and method for supporting a user-level file system transaction use cloned files of original existing files specified in the user-level file system transaction to perform file system operations on at least one of the original existing files using the cloned files, which include metadata of the original existing files. After at least one of the cloned files have been modified, a batch rename operation is executed to atomically commit every modified cloned file of the user-level file system transaction. | 2017-06-22 |
20170177575 | PROCESSING TRANSACTIONS INVOLVING AN EXCHANGE OF AN ELECTRONIC DOCUMENT - Systems, methods, and computer program products for processing transactions involving an exchange of an electronic document, such as a ticket redeemable for a travel service. Data defining related transactions is stored in a transaction database. In response to detecting the occurrence of a transaction involving a tracked document, a transaction history of the document is retrieved from the transaction database. A plurality of payment events is extracted from the transaction history and filtered by document type and form of payment to determine a set of payment events with forms of payment that are refund-eligible. The refund-eligible forms of payment are aggregated, and the aggregated forms of payment ranked. A residual amount associated with the exchange is reconciled across the ranked aggregated forms of payment by one or more payment events. The payment events are then added to the transaction history of the tracked document in the database. | 2017-06-22 |
20170177576 | UNSUPERVISED BOOSTING OF UNIQUE SEARCH RESULTS IN A METASEARCH ENVIRONMENT - A search query is received from a user. Multiple search results in response to the search query are received from multiple search engines. Each of the search engines provides one or more search results of the multiple search results. One or more features relating to the uniqueness of the multiple search results of each of the search engines are determined. A ranking of the multiple search results is determined based on the one or more features. The multiple search results are displayed to the user based on the ranking. | 2017-06-22 |
20170177577 | BIASING SCRUBBER FOR DIGITAL CONTENT - A digital content server provides bias scores used for biasing display of sections of a digital content item, such as an e-book, audio track, or video, during scrubbing on a client device. For each user, the server compiles a user profile which includes information such as the user's search and browsing history, stated interests, and location. The server determines a collection of similar user profiles and analyzes them to determine a relevance score for each section of the digital content item. For each section, the server also identifies individual entities, and compares the identified entities against the user profile to determine a second relevance score. The server combines the relevance scores to determine an aggregate bias score for each section of the digital content item. The bias scores are provided to a client device containing a scrubber module, which uses the scores to bias display of sections during scrubbing. | 2017-06-22 |
20170177578 | SYSTEMS AND METHODS FOR CONTENT PRESENTATION - Systems, methods, and non-transitory computer-readable media can obtain at least one content item to be scored with respect to a user, wherein the score is used to determine whether the content item is included in a content feed of the user. A value for a first event is determined based at least in part on a likelihood of the user performing an action with respect to the content item, wherein the likelihood of the user performing the action is greater than an average user of the social networking system. The score for the content item is determined based at least in part on the value for the first event, wherein the first value is dampened to reduce its contribution to the score. | 2017-06-22 |
20170177579 | ENTITY-FACETED HISTORICAL CLICK-THROUGH-RATE - In an example embodiment, usage information is used to calculate one or more individual document historical information-deficient metrics (IDHIDMs) by combining values for the one or more metrics from multiple documents within the document corpus that share an identical combination of entities of the one or more entity types. A search query is segmented into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type. At least one IDHIDM for a combination of entities matching the tagged segments is used to rank one or more retrieved documents responsive to the query. | 2017-06-22 |
20170177580 | TITLE STANDARDIZATION RANKING ALGORITHM - A method of ranking a set of candidate standardized titles selected from a corpus of standardized titles is disclosed. The set of candidate standardized titles are selected from the corpus of standardized titles as corresponding to a raw title. A combined inverse document frequency score is determined for each candidate standardized title in the set of candidate standardized titles. The combined inverse document frequency score is based on inverse frequency scores for each of a set of tokens derived from the set of candidate standardized titles. A ranking score is determined for each of the set of candidate standardized titles based on the combined inverse document frequency score. The ranking score for each of the set of candidate standardized titles is communicated for use by a separate module to improve an accuracy in a functionality of the separate module. | 2017-06-22 |
20170177581 | COLLABORATIVE SEARCH OF DATABASES - A search query is received from a search engine of multiple search engines. One or more search results from each search engine of the multiple search engines in response to the search query are received. Each search result of the one or more search results includes a first search score. A factor is determined for each search result of the one or more search results. A second search score is determined for each search result of the one or more search results based on the first search score and the factor. The one or more search results are displayed to a user of the search engine in an order. The order is based on the second search score. | 2017-06-22 |
20170177582 | DECENTRALIZED CARDS PLATFORM FOR SHOWING CONTEXTUAL CARDS IN A STREAM - Disclosed are methods and apparatus for receiving by one or more servers, from a client device, a context of the client device. The servers may obtain, from a plurality of user interface object providers, a plurality of user interface objects. The servers may select and rank a set of the plurality of user interface objects based, at least in part, on the context of the client device. The servers may transmit the set of the plurality of user interface objects or information associated therewith to the client device according to the ranking of the set of user interface objects. | 2017-06-22 |
20170177583 | SYSTEM AND METHOD FOR IDENTIFYING GIFTS HAVING SHARED INTERESTS VIA SOCIAL MEDIA NETWORKING, USER PROFILES AND BROWSING DATA - A method and system identifying gifts having shared interests of a gifter and gift receivers based on social network connections, user profiles data and browsing data. The method includes obtaining gifter identification as gift receivers. The system ranks gift receivers with upcoming life events selected from gifter social network connections. The system acquires profile data and browsing data of the gifter and gift receivers, and identifies their interests to render gift recommendations for gift receivers based on shared interests between the gifter and gift receivers. The system then presents a list of identified gifts to the gifter and allows interaction through a user interface. The shared interests in one embodiment are mutual interests of the gifter and gift receivers and in another embodiment the shared interests are different interests of the gifter and gift receivers. | 2017-06-22 |
20170177584 | MEDIA NAMES MATCHING AND NORMALIZATION - Methods and apparatus to facilitate matching of names for same media content are disclosed. Example methods include analyzing first data associated with first media content and, when a program name/identifier and/or episode name/identifier is not identified in the first data, supplementing the data with second data to form third data and processing the third data with respect to fourth data associated with second media content and calculating a composite match score including a program match score and an episode match score based on processing the third data with respect to the fourth data. When the first media content is determined to match the second media content based on the processing of the third data with respect to the fourth data and a comparison of the composite match score to a threshold is satisfied, a normalized media name is generated for the first media content and the second media content. | 2017-06-22 |
20170177585 | SYSTEMS, METHODS, AND COMPUTER READABLE MEDIUM FOR GENERATING PLAYLISTS - Methods, systems and computer program products are provided for generating a playlist. An application programming interface (API) receives a request to generate a playlist, where the request includes a set of rule-primitives. A playlist engine evaluator evaluates a rule corresponding to each rule-primitive in the set of rule-primitives across a catalog of media content, calculates a cost associated with each item in the catalog of media content, and generates a playlist based on the items of the catalog having the lowest costs. | 2017-06-22 |
20170177586 | METHODS AND SYSTEMS FOR SOCIAL MATCHING - Methods and systems are provided for triggering a social match analysis. A user device such as a network connected device scans for one or more entity identifiers via camera, microphone, or wireless signal receiver and initiates a request to a social matching system. The social matching system retrieves attribute information for each of the identified entities and performs a match analysis, scoring the potential matches and noting common attributes. A match analysis report is generated and returned to the originating requesting user device. | 2017-06-22 |
20170177587 | HIERARCHICAL ENTITY INFORMATION FOR SEARCH - A fast browsing architecture for exploring hierarchical lists of entities through a search user interface. A graphical UI operates to handle the hierarchical lists and sub-lists in different ways for different scenarios such as a hierarchical level is zero (only one list of entities associated with a query and the list cannot be further drilled down), a second scenario where the hierarchical level is one (a list of entities associated with the query and these entities can be further drilled down to a number of sub-lists) and the sub-lists cannot be further drilled down, and a third scenario where the hierarchical level is more than one (a list of entities associated with the query and these entities can be further drilled down to a number of sub-lists), sub-lists can be further drilled down to a number of lists, until there is no more drill down lists to be found. | 2017-06-22 |
20170177588 | CONTEXTUAL CONNECTION RECOMMENDATION IN A SOCIAL NETWORK - A system and method for contextual connection recommendation includes obtaining, with a processor from a database, contextual data and social graph data. related to a pair of members of a social network who are not currently connected on the social network. A connection base score between the pair of members is generated based on the social graph data. A recommendation modifier is generated based on the contextual data. A connection recommendation modified score is determined by applying the recommendation modifier to the base score. A connection recommendation is provided to at least one of the pair of members based, at least in part, on the connection recommendation modified score. | 2017-06-22 |
20170177589 | Suggesting Tags on Online Social Networks - In one embodiment, a method includes accessing one or more content objects associated with a first user of an online social network; generating a set of tag candidates by extracting one or more n-grams from the content objects, wherein each tag candidate comprises one or more text strings or ideograms from the extracted n-grams; calculating, for each tag candidate of the set of tag candidates, a quality-score for the tag candidate based on an affinity coefficient between the first user and a respective content object from which the n-grams or ideograms comprising the tag candidate were extracted; and sending, to a client system for display, one or more of the tag candidates as suggested tags for the first user, wherein each suggested tag has a quality-score greater than a threshold quality-score. | 2017-06-22 |
20170177590 | NATURAL CLASSIFICATION OF CONTENT USING UNSUPERVISED LEARNING - Rating a plurality of digital content items accessible via a network based on consumer interest, including continuously at predetermined intervals identifying a plurality of digital content items discoverable via the network and having dynamic characteristics of temporal behavior of an active conversation; grouping the identified plurality of digital content items into a plurality of event centers, each including one or more word cliques focused on a shared event, each word clique consisting of a unique plurality of words identified in a subset of a plurality of digital content items; rating the event center identified during an initial calculation of the predetermined intervals in accordance with a known value of subject matter related to the shared event; and subsequently, rating the digital content items comprising the one or more word cliques of the event center by correcting the rating set during the initial calculation based on gain and loss in an amount of the plurality of digital content items related to the shared event. | 2017-06-22 |
20170177591 | DEFECT RECORD CLASSIFICATION - An approach to classify different defect records by mapping plain language phrases to a taxonomy. The approach includes a method that includes receiving, by at least one computing device, a defect record associated with a defect. The method further includes receiving, by the least one computing device, a plain language phrase or word. The method further includes mapping, by the least one computing device, the plain language phrase or word to a taxonomy. The method further includes classifying, by the least one computing device, how the defect was at least one of detected and resolved using the taxonomy. | 2017-06-22 |
20170177592 | FILE-LEVEL ARRAY STORAGE - An apparatus and associated methodology contemplating an apparatus having a processor-based storage controller. A nontransient, tangible computer memory is configured to store a data file. Computer instructions are stored in the computer memory defining file-level array storage logic that is configured to be executed by the controller to logically containerize the data file in a file-level data set across a plurality of virtual storage containers, and to concurrently flush the virtual storage containers by migrating units of the file-level data set to a plurality of physical storage devices. | 2017-06-22 |
20170177593 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR SHARING INFORMATION - In one embodiment, a method includes: receiving an excerpt of information from a first user, wherein the excerpt of information includes information from a target web page; storing the excerpt, in an XML format, in a folder on a storage medium; detecting a change in the target web page; in response to the detected change in the target web page, updating the excerpt of information from the target web page; receiving, from the first user, an identification of a second user with whom the first user wishes to share the excerpt of information; and transmitting a communication to the second user inviting the second user to view the excerpt of information in the folder. | 2017-06-22 |
20170177594 | CONTAINER-LEVEL ARRAY STORAGE - An apparatus and associated methodology contemplating a processor-based storage controller and a nontransient, tangible computer memory configured to store a plurality of data files. Computer instructions are stored in the computer memory defining container-level array storage logic that is configured to be executed by the controller to sequentially containerize the data files to a plurality of virtual storage containers, and to flush the virtual storage containers by migrating each storage container's contents to a respective physical storage device. | 2017-06-22 |
20170177595 | DECOUPLING OF ARCHIVING AND DESTRUCTION FOR DEPENDENT BUSINESS OBJECTS - A framework for an improved destruction of interrelated data objects is described herein. In one embodiment, destruction and/or archiving of data objects are decoupled from the destruction and/or archiving of a master data object by using a backup table. Before being destructed, attributes relevant to destruction of dependent data objects are copied from the master data object to the backup table. Subsequent destruction operations performed on data objects dependent on the master data object may attempt to retrieve the attributes relevant to destruction from the master data object itself, or from the backup table. In this way, data object destruction orderings are avoided, enabling dependent data objects to be destructed at any time. | 2017-06-22 |
20170177596 | SYSTEMS AND METHODS FOR BENCHMARKING ONLINE ACTIVITY VIA ENCODED LINKS - The present disclosure is directed towards benchmarking online activity via encoded links generated by an online activity benchmarking system. The method may include identifying by a server of an online activity benchmarking system, for an information resource, a plurality of encoded links encoded by the server of the online activity benchmarking system and linked to the information resource, receiving by the server, via the identified plurality of encoded links, a plurality of requests to access the information resource, identifying by the server, for each request of the plurality of requests to access the information resource, one or more attributes corresponding to the request, categorizing by the server, the plurality of requests to access the information resource based on the one or more identified attributes, and providing by the server, for presentation, an output indicating statistics corresponding to the categorized plurality of requests based on the one or more identified attributes. | 2017-06-22 |
20170177597 | BIOLOGICAL DATA SYSTEMS - Disclosed herein are systems and methods for processing data, particularly biological data. An exemplary system comprises a memory and a processor coupled to the memory, wherein the memory comprises program instructions executable by the processor to: write into the memory a first index comprising one or more locations of a genomic sequence file comprising a header and genomic sequence data; calculate, based on the first index and a genomic range, a byte range of the genomic sequence file; write into the memory a portion of the genomic sequence file, wherein the portion comprises genomic sequence data located within the byte range; calculate a second index; and write into the memory the second index, wherein the genomic sequence data are compressed and no portion of the genomic sequence data is decompressed. | 2017-06-22 |
20170177598 | CENTRALIZED PARALLEL BURST ENGINE FOR HIGH PERFORMANCE COMPUTING - Data storage systems and methods for storing data are described herein. An intermediate storage system is coupled with a High Performance Computing (HPC) system. A plurality of burst engines of the intermediate storage system are directly connected to compute nodes of the HPC. The burst engines are operative to receive file level data from the compute nodes at data transfer rates that at least match to the burst mode output rate of the compute node. The burst engines store the data to high bandwidth storage devices of the intermediate storage system at a data rate that at least matches the burst output rate of the compute node. During a compute phase of the compute node, data is replayed from the intermediate storage devices to a primary storage system at a lower data transfer rate. | 2017-06-22 |
20170177599 | Assignment of Data Within File Systems - The embodiments relate to assigning data to processors of a file system. Metadata associated with respective blocks of data, and an initial batch of the blocks is assigned to nodes of a file system based on the metadata. Unassigned blocks are selectively assigned to one or more of the nodes. The selective assignment includes constructing a linear regression model based on node data, and determining a value for each node based on the linear regression model. Each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks. | 2017-06-22 |
20170177600 | METHOD, SYSTEM, AND DEVICE FOR PROCESSING DATA IN CONNECTION WITH AN APPLICATION - Embodiments of the present application relate to a method, device, and system for processing data. The method includes receiving an input to an application interface non-control zone of a current application, determining whether the input satisfies a preset query trigger condition, in the event that the input is determined to satisfy the preset query trigger condition, displaying a system control, wherein the system control obtains one or more interface elements related to the current application and displays the one or more interface elements, receiving a triggering of at least one of the one or more interface elements, and in response to the triggering of the at least one interface element, displaying a query response interface, wherein the query response interface is obtained according to a query condition associated with the triggered at least one interface element. | 2017-06-22 |
20170177601 | ACTIVE REPARTITIONING IN A DISTRIBUTED DATABASE - Disclosed embodiments include a method (system and non-transitory computer storage readable medium) for load-balancing a distributed database. The distributed database includes one or more storage machines configured to store a plurality of partitions, where each partition includes key-value pairs. In one embodiment, the distributed database prepares for load-balancing by determining a partition to redistribute (or repartition) and generating smaller partitions of the determined partition. In one aspect, each of the smaller partitions is smaller than the determined partition. The redistribution of the partition can occur, when an amount of requests to access one or more key-value pairs stored in the database increases beyond a predetermined request level or when the size of a partition exceeds a predetermined size. Key-value pairs of the determined partition can be split into different sets of key-value pairs, and each set of key-value pair is copied to a corresponding smaller partition. | 2017-06-22 |
20170177602 | COMPRESSED DATA LAYOUT WITH VARIABLE GROUP SIZE - The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage. | 2017-06-22 |
20170177603 | COMPRESSED DATA REARRANGEMENT TO OPTIMIZE FILE COMPRESSION - The embodiments described herein relate to managing compressed data to optimize file compression. A first compression is performed on a first set of data to create first compressed data. The first compressed data is stored in one or more blocks of a first compression group. A size of free space of a last block of the first compression group is discovered and calculated. A second compression is performed on a second set of data to create second compressed data. At least a portion of the second compressed data is supplied to the first compression group for padding into the last block in response to determining that the size of the free space is sufficient. An unpadded portion of the second compressed data is stored in one or more blocks of a second compression group. | 2017-06-22 |
20170177604 | ENCODED DATA OBJECT NOTATION PERSISTENCE FORMAT - An encoded data object notation persistence format can be used in a variety of scenarios to advantage. The encoded format accommodates key name-value pairs and can employ dictionary compression to reduce the amount of storage needed to represent a data object. Searching and querying a collection of encoded data objects can be done more efficiently by taking advantage of the format. | 2017-06-22 |
20170177605 | SYSTEM AND METHOD FOR EFFICIENTLY PROVIDING MEDIA AND ASSOCIATED METADATA - An electronic device obtains a file header for a file that corresponds to a plurality of clusters. The file header includes a cluster index that enables coarse searching within the file. At least one of the file header and the file omits information that is known to or calculable by the device for extracting content from the file. In response to receiving a request to seek to a position within the file, the device identifies a cluster that includes content that corresponds to the position based on the cluster index and obtains a cluster header that enables fine searching within the cluster. After obtaining the cluster header, the device identifies, within the cluster, the content that corresponds to the position based on the content index and provides at least a portion of content corresponding to the file to a presentation device, starting with the content that corresponds to the position. | 2017-06-22 |
20170177606 | SYSTEM AND METHOD FOR INVESTIGATING LARGE AMOUNTS OF DATA - A data analysis system is proposed for providing fine-grained low latency access to high volume input data from possibly multiple heterogeneous input data sources. The input data is parsed, optionally transformed, indexed, and stored in a horizontally-scalable key-value data repository where it may be accessed using low latency searches. The input data may be compressed into blocks before being stored to minimize storage requirements. The results of searches present input data in its original form. The input data may include access logs, call data records (CDRs), e-mail messages, etc. The system allows a data analyst to efficiently identify information of interest in a very large dynamic data set up to multiple petabytes in size. Once information of interest has been identified, that subset of the large data set can be imported into a dedicated or specialized data analysis system for an additional in-depth investigation and contextual analysis. | 2017-06-22 |
20170177607 | SYSTEM, METHOD AND APPARATUS FOR SIMULTANEOUS MEDIA COLLABORATION - A method, system, and apparatus is disclosed for multiple users and/or groups to curate a single combined media playlist using multiple devices while a single host device is connected to speakers/an output. | 2017-06-22 |
20170177608 | ELECTRONIC FILE MANAGEMENT SYSTEM - An electronic file management system may include an electronic file data repository and a file analysis engine that may include a processor and a non-transitory memory device. The non-transitory memory device may store computer executable instructions that, when executed by the processor, cause the file analysis engine to analyze an electronic file to identify a file identifier and determine whether a matching file has previously been saved in a data repository. If a matching file was found by the file analysis engine, a link to the previously saved file may be saved to the data repository and if not, the electronic file itself may be saved to the data repository. The file analysis engine and/or a permissions engine may analyze file itself and/or the contents of the electronic file to determine one or more permissions levels associated with the electronic file and save the file according to the permissions levels. | 2017-06-22 |
20170177609 | SYSTEMS AND METHODS FOR SECURE CLOUD-BASED MEDIA FILE SHARING - Cloud-based systems and methods to securely share electronic files use a cloud or virtualized server to handle management tasks related to file sharing, while file storage is maintained securely by servers that are not part of the cloud. The content of the file to be shared is not transmitted to or by the cloud. Share requests from file senders, notifications to target recipients, and retrieve requests from target recipients are transmitted to and/or by the cloud. | 2017-06-22 |
20170177610 | ADAPTIVE TOOL SELECTION FOR CONFLICT RESOLUTION IN A MULTI-SESSION COLLABORATION SETTING - Systems for web-based collaboration systems. Two or more users can operate concurrently on objects stored in a cloud-based environment that hosts shared objects. Concurrent editing is facilitated by components in the cloud-based environment that serve to grant a first user, a first permission to modify a first instance of an object to be edited with a first editing tool, then grant to a second user, a second permission to modify a second instance of the same object to be edited with a second editing tool instance. The occurrence of a modification event that presents a conflict is detected, and steps are taken for determining a range of possible remediation tool options that can be used to address the modification conflict. Remediation tool options include remediation tool options that are natively supported within the editing tools. A set of applicable remediation tool options are presented in a user interface. | 2017-06-22 |
20170177611 | ENFORCING CONSISTENCY OF FILE TO STORAGE NODE MAPPING - Systems and methods for enforcing consistency of file to storage node mappings in distributed file systems. An example method may include: receiving a request to perform a file operation with respect to a file associated with a volume of a distributed file system; identifying, among a plurality of storage nodes of the distributed file system, a storage node associated with the file; obtaining a lock of a layout of the volume; and responsive to determining, by a processing device, that a directory layout version number matches a volume layout version number, performing the requested file operation with respect to the file. | 2017-06-22 |
20170177612 | METHOD AND SYSTEM FOR HANDLING LOCK STATE INFORMATION AT STORAGE SYSTEM NODES - Methods and systems for handling lock state information between a first storage system node and a second storage system node coupled via a network link are provided. The second storage system node stores lock state information at a storage device previously managed by the first storage system node and notifies the first storage system node of a storage device location where the lock state information is stored. The second storage system node then transfers ownership of the storage device to the first storage system node that copies the lock state information from the storage device location to a memory location managed by the first storage system node. The first storage system node uses the lock state information to reconstruct any locks for storage space presented to a client and then processes client requests for reading and writing information at the storage device. | 2017-06-22 |
20170177613 | Event-Based User State Synchronization in a Cloud Storage System - Cloud storage systems and methods are described for providing event-based user state synchronization among the various cloud elements. A global user directory is maintained on a remote cloud storage system. The global user directory includes a plurality of global user definitions associated with a plurality of user accounts, where each of the user accounts has access to at least one of a remote file system (RFS) hosted by the remote cloud storage system and a local file system (LFS) hosted by a local cloud storage system. As global user definition are altered on the remote cloud storage system, user events are generated and communicated to the local cloud storage system, where they are applied to synchronize the local user definitions with the global user definitions. The invention facilitates centralized control of user definitions, near real-time event delivery to local cloud storage systems, and separation of authentication processes from customers' active directory services. | 2017-06-22 |
20170177614 | VIRTUAL COLLECTION OF ENTITIES IN SYNC PROCESS - Apparatus and methods to control selection of media content provide a mechanism to enhance user interaction with multimedia devices. Additional apparatus, systems, and methods are disclosed. | 2017-06-22 |
20170177615 | TRANSACTION MANAGEMENT METHOD FOR ENHANCING DATA STABILITY OF NoSQL DATABASE BASED ON DISTRIBUTED FILE SYSTEM - Transaction management methods for enhancing data stability of a NoSQL DB based on a distributed file system are presented. The methods include, for instance: initializing a data storage transaction in which the distributed file system stores a logical file in the NoSQL DB, writing, by the distributed file system, the logical file into an inter-file IF, and moving, by the distributed file system, the inter-file to a physical file of the NoSQL DB when commit on a transaction occurs. | 2017-06-22 |
20170177616 | DECENTRALIZING A HADOOP CLUSTER - In some examples, a distributed file system is described. The distributed file system may include multiple data nodes and a director unit. The multiple data nodes may each include one or more data blocks. The director unit may include multiple master nodes configured in a peer-to-peer distributed architecture and operably coupled to the multiple data nodes. Each of the master nodes may be configured to receive a task related to managing data with respect to the distributed file system; to manage a distribution of the task among one or more of the plurality of master nodes; and to communicate a task status and a status of at least a part of the distributed file system to each of the other master nodes. | 2017-06-22 |
20170177617 | THREE PHASE COMMIT FOR A DISTRIBUTED FILE SYSTEM - A technique includes using a primary commit coordinator in a distributed file system as a participant in at least one transaction associated with a file operation to commit the transaction(s) to an associated storage segment of the file system. The primary commit coordinator is used to communicate with at least one other participant in the transaction(s) using a three phase commit protocol to generate transaction states associated with committing the transaction(s). The technique includes selectively checkpointing the transaction states to a backup commit coordinator that is associated with the primary commit coordinator to allow the backup commit coordinator to takeover committing the transaction. | 2017-06-22 |
20170177618 | Systems and Methods for Use in Determining Detailed Locations for Certain Entities - Exemplary embodiments of systems and methods are provided for determining detailed locations of entities. One exemplary method includes receiving at least one signal record for a communication device associated with a user. The at least one signal record includes multiple signal strengths, a temporal indicator, and an identifier unique to the communication device. The exemplary method further includes accessing multiple discrete event records associated with the entity, correlating one of the multiple discrete event records to the at least one signal record based on the temporal indicator included in the at least one signal record, and generating a location range associated with the entity, based on the signal strengths included in the at least one signal record, whereby a location of the entity, distinct from one or more other entities, is indicated by the location range. | 2017-06-22 |
20170177619 | SYSTEM AND METHOD FOR SEARCHING FOR PROPERTY AND DISPLAYING SEARCH RESULTS - A system and method of searching for real estate. A server is communicatively connected to a database comprised of real estate records. One or more client devices communicatively connected to the server receive a defined non-contiguous geographic search area and attribute criteria values for attributes of the sought real estate and the client devices transmit the defined non-contiguous geographic search area and attribute criteria values to the server. The server calculates minimum bounding rectangles corresponding to the non-contiguous geographic search area, queries the database of real estate using the minimum bounding rectangles and attribute criteria values to generate a first set of returned records, compares the first set of returned records against the defined non-contiguous search area to generate a second set of returned records that is a subset of the first set of returned records, and transmits the second set of returned records to the client device. | 2017-06-22 |
20170177620 | CONSTRUCTING FINGERPRINT DATABASE AND POSITIONING BASED ON FINGERPRINT DATABASE - The present disclosure provides various fingerprint database construction methods and apparatuses and positioning methods and apparatuses based on fingerprint database. An example fingerprint database constructing method includes: receiving service requests sent by client terminals having a service relationship with a target service object, and receiving location fingerprint data sent by the client terminals in the process of sending the service requests; determining the location of the target service object according to indication information, and using the location of the target service object as a location point corresponding to the location fingerprint data; and acquiring a fingerprint feature corresponding to the location point according to the location fingerprint data, and establishing a corresponding relationship between the location point and the fingerprint feature, to generate a fingerprint database. The present techniques improve the accuracy of indoor positioning. | 2017-06-22 |
20170177621 | SYSTEM AND METHOD FOR THE IDENTIFICATION OF PERSONAL PRESENCE AND FOR ENRICHMENT OF METADATA IN IMAGE MEDIA - A method and system for the identification of personal presence and enrichment of metadata in image media is disclosed. The method includes obtaining user presence information for user images. Feature extraction is performed on the images and media databases are searched for images based on the presence information, which includes filtering based on known metadata and filtering based on the feature extraction. The user confirms their presence in the filtered images and the user provides new metadata known to the user for the images. The system then infers metadata for the filtered images based on the new metadata and presents the inferred metadata to the user. The user validates the inferred metadata and the inferred metadata confirmed to be valid is stored. | 2017-06-22 |
20170177622 | METHOD AND SYSTEM FOR IMAGE SEARCH - A method and system for image search, the method comprising: receiving an indication regarding at least one feature of at least one image from a collection of images; creating an updated search algorithm according to the indication; and providing an updated collection of images by using the updated search algorithm. | 2017-06-22 |
20170177623 | METHOD AND APPARATUS FOR USING BUSINESS-AWARE LATENT TOPICS FOR IMAGE CAPTIONING IN SOCIAL MEDIA - A method of generating a caption for a social media post is provided. The method may include receiving a social media post to be posted to a social media network; collecting reference data relevant to determining common activities occurring at a category of location associated with the social media post; inferring potential topics for captions from a topic inference model, based on the collected reference data associated with the social media post; setting parameters associated with a language model based on the inferred topic; and generating at least one caption for the social media post based on the identified language model, and the inferred topic. | 2017-06-22 |
20170177624 | SYSTEMS AND METHODS OF GENERATING AND USING A BITMAP INDEX - Systems and methods of generating and using a bitmap index are disclosed. The bitmap index stores bit strings. In a particular implementation, each bit string in the bitmap index corresponds to an attribute. Each location in each bit string corresponds to the same source. The bitmap index supports parallelized and distributed execution of queries with respect to data indexed by the bitmap index. For example, the described bitmap index can be used to index advertising data, healthcare data, financial data, etc. | 2017-06-22 |
20170177625 | ENABLING MULTI-TENANT ACCESS TO RESPECTIVE ISOLATED DATA SETS ORGANIZED USING DIFFERENT APPLICATION SCHEMAS - Multi-tenant access to respective isolated data sets organized using different application schemas is disclosed. Multiple tenants store respective data sets in separate datastores. The datastores are organized using different application schemas, each derived from a same base schema. However, the tenants share access to a same application. The application receives a first request from a first tenant and a second request from a second tenant. The application serves the first request by accessing a first data set organized using a first application schema. The application serves the second request by accessing a second data set using a second application schema. | 2017-06-22 |
20170177626 | SIGNIFICANT CLEANSE CHANGE INFORMATION - A system includes reception of a first data record, identification of one or more component elements in the first data record, application of a cleansing operation to change a first component element of the one or more component elements to a first cleansed component element, the first cleansed component element being different from the first component element, automatic determination a change significance of the change, and storage an identifier of the first cleansed component element in association with an identifier of the change significance. | 2017-06-22 |
20170177627 | MULTI-LABEL CONTENT RECATEGORIZATION - In an example, there is disclosed a computing apparatus, including one or more logic elements, including at least one hardware logic element, comprising a classification engine to: receive a clean multi-labeled dataset comprising a plurality of document each assigned to one or more of a plurality of categories; receive an unclean multi-labeled dataset; and produce a recategorized and cleansed dataset from the unclean multi-labeled dataset, comprising predicting a number of labels {circumflex over (l)} for a document j, and comparing {circumflex over (l)} to an existing number of labels l. There is also disclosed a method of providing a classification engine. | 2017-06-22 |
20170177628 | LOG FRAGMENTATION METHOD AND APPARATUS - A log fragmentation method is disclosed. A slave database server receives a first log sent by a master database server, wherein the first log includes a data table identifier and match identifier. The slave database server determines a match tree based on the data table identifier of the first log, and fragments the first log based on the match tree. Using a match tree that has been set up, a tree structure of the match tree can be effectively utilized to fragment a log, and the fragmented log has a high degree of concurrency, thus improving the efficiency of log replay. | 2017-06-22 |
20170177629 | PRESERVING HIGH VALUE ENTRIES IN AN EVENT LOG - A first entry is received at an event log interface. The event log interface is configured to store received entries in an event log. It is determined that there is not enough storage space to store the first entry in the event log. A second entry is identified. The second entry is the oldest entry in the event log based on when the second entry was written to the event log. It is determined that the second entry contains an indicator to preserve. A copy of the second entry is sent to the event log interface to be written to the event log. One or more entries are deleted from the event log. The one or more entries includes the second entry. The first entry is written to the event log. The copy of the second entry is written to the event log. | 2017-06-22 |
20170177630 | Computerized Software Engine to Assess Physical Value Using Document Versioning - A computer system may create version records in a versioned database that stores data from transaction documents. Each version record may include a timestamp that represents a time from which the data stored in the version record is valid. The timestamp may represent the time of creation of particular version of the transaction document. The version records may be accessed to perform a valuation for a specified time. | 2017-06-22 |
20170177631 | Universal Delta Set Management - The different advantageous embodiments provide a method for identifying changes in data sets. An ending version for a data set is received. A beginning version for the data set is identified. The ending version for the data set is compared with the beginning version for the data set. A number of differences is calculated between the ending version and the beginning version. A data structure is created that identifies the number of differences between the ending version and the beginning version. | 2017-06-22 |
20170177632 | METHOD AND APPARATUS FOR SAVING WEB CONTENT - The present invention relates to a method for storing of network host provided content at a non-host location. In accordance with an embodiment, an event corresponding to storing of at least one network host provided content or web page is detected on a device where a user accessing a browsing application to view the web page. Upon detecting the network host provided content or web page and retrieval information corresponding to the web page is stored at a non-host location in a mapped relationship with each other. The retrieval information is a information of the searchable type based on the information present in the network host provided content. | 2017-06-22 |
20170177633 | DBMS-SUPPORTED SCORE ASSIGNMENT - The invention relates to a computer-implemented method implemented by a DBMS. The DBMS comprises a database with a data table with a plurality of data columns and a condition table with condition columns and a score column. The DBMS receives a request and extracts a data vector from each data column and a condition vector from each condition column. For each of the data vectors, the DBMS computes a match vector selectively comprising identifiers of the rows in the condition table whose condition value is identical to an attribute value of said data vector; then, the DBMS selectively returns the rows of the condition table whose respective identifier is contained in each of the computed match vectors as the result to the client application for enabling the client application to identify assignments of the data records and the score values of matching condition table rows. | 2017-06-22 |
20170177634 | CREATING DATA IN A DATA STORE USING A DYNAMIC ONTOLOGY - In one embodiment, a method comprises creating and storing an ontology for a data store in response to receiving first user input defining the ontology, wherein the ontology comprises a plurality of data object types and a plurality of object property types; creating one or more parser definitions in response to receiving second user input defining the parser definitions, wherein each of the parser definitions specifies one or more sub-definitions of how to transform first input data into modified input data that is compatible with one of the object property types; and storing each of the one or more parser definitions in association with one of the plurality of object property types. | 2017-06-22 |
20170177635 | AUTOMATIC COMPARISON OF ENTERPRISE PROFILE ANALYTICS - A method includes storing, in a memory, a first Systems, Applications, Products (SAP) profile including first information. The method further includes storing, in the memory, a second SAP profile including second information. A processor compares the first information with the second information on a line-by-line basis. A reporting data structure is generated that includes a visual line-by-line result of the comparing. | 2017-06-22 |
20170177636 | FAST CIRCULAR DATABASE - A data management system and associated data management method is disclosed herein. An exemplary method for managing data includes receiving data records timestamped with times spanned by a defined time interval; generating a data cube that includes data planes, wherein each data plane contains a set of data records timestamped with times spanned by the defined time interval; generating an index hypercube for the data cube, wherein dimensions of the index hypercube represent hash values of index keys defined for accessing the data cube; and generating an indexed data cube for storing in a database, wherein the indexed data cube includes the data cube and the index hypercube. The index hypercube includes index hypercube elements, where each index hypercube element represents a unique combination of hashed index key values that map to a data plane in the data cube. | 2017-06-22 |
20170177637 | VOLUMETRIC VECTOR NODE AND OBJECT BASED MULTI-DIMENSIONAL OPERATING SYSTEM - A method for the visualization and addressing of data within a volumetric container, using XYZ coordinates represented as a vector. Whereas users build their own immersive experience, variants, and/or representations of their respective data as polygons nested within a virtual universe. This includes variants such as time, space, velocity and trajectory as they relate to data containers, and the tracking of each user's multi-dimensional representations. This method also creates permanent threaded connections between web data, social communities and data retrieved from any other source, to a structured polygon based correlation library. | 2017-06-22 |
20170177638 | PREDICTIVE OBJECT TIERING BASED ON OBJECT METADATA - In one general embodiment, a computer-implemented method is provided. The computer-implemented method includes identifying a first object in a tiered storage system, and identifying first metadata associated with the first object. The computer-implemented method also includes identifying a second object utilizing the first metadata of the first object. The second object is associated with second metadata. Moreover, the computer-implemented method includes, in response to an access of the first object, modifying a heat value associated with the second object. | 2017-06-22 |
20170177639 | MODULARIZED DATA DISTRIBUTION PLAN GENERATION - A system includes instantiation of a plan generation environment exposing one or more software hooks, each of the one or more software hooks associated with a respective one of a plurality of steps for generating a database table partition redistribution plan, identification, for of the one or more software hooks, of an associated one or more software modules for performing the step associated with the at least one software hook, and execution of the plan generation environment and the identified one or more software modules to generate a database table partition redistribution plan. | 2017-06-22 |
20170177640 | GLOBAL AND LOCAL TEMPORARY DATABASE TABLES - Systems and methods for creating and populating temporary database tables with intermediate data that can be preserved once a database application session ends and used outside of the instant database operation without storing this data in persistent memory are provided. A local temporary database table may be used only in the local instance of a database application, and a global temporary table makes intermediate data available across multiple applications and multiple application instances. | 2017-06-22 |
20170177641 | METHOD AND DEVICE FOR CORRELATING MULTIPLE TABLES IN A DATABASE ENVIRONMENT - A system, process, and method for organizing unstructured data stored in a database environment with table structure such that the data is retrievable using relational set logic, even with a database environment that does not provide relational table structures, is disclosed. The method creates, updates, and deletes database objects as necessary to describe the relationships between disparate data object types for various unique values and to provide the necessary information to retrieve the desired data objects. A device embodying and enabling the practice of the method is also disclosed. | 2017-06-22 |
20170177642 | MANAGMENT OF INTELLEGENT DATA ASSIGNMENTS FOR DATABASE SYSTEMS WITH MULTIPLE PROCESSING UNITS - Data of a database (e.g., database tables) can be reassigned from a first map to a second map in a database system that uses maps to assign data for processing to multiple processing units of a database system in accordance with one or more distributions schemes. Data portions can be selected in groups and moved in the selected groups in an efficient manner. The selection and/or movement of the data portions can be automated without requiring input for users of database systems. | 2017-06-22 |
20170177643 | TECHNIQUES TO CONFIGURE MEDIA PACKAGES - Techniques to configure media packages are described. In one embodiment, an apparatus may comprise a client support component operative to receive search term information from a client device at a server device; and configure the client device with a selected one or more high-priority media items; a media server search component operative to transmit the search term information to a plurality of media servers; receive a plurality of media items from the plurality of media servers in response to the transmitting of the search term information to the plurality of media servers; and select the one or more high-priority media items from the plurality of media items based on priority weights; and a media item evaluation component operative to assign the priority weights to each of the plurality of media items. Other embodiments are described and claimed. | 2017-06-22 |
20170177644 | ATOMIC UPDATE OF B-TREE IN A PERSISTENT MEMORY-BASED FILE SYSTEM - A computer implemented method for updating a file system tree structure through an atomic operation, comprising one or more hardware processor adapted for designating a file system comprising a plurality of files arranged in a plurality of tree structures, the file system is based on a direct mapping persistent memory, receiving instructions from a client to alter an altered file of the plurality of files, creating an alternate tree structure to apply the alteration in case the alteration involves a non-atomic tree structure operation to an original tree structure of the plurality of tree structures containing the altered file and committing the alteration to the file system through an atomic operation. | 2017-06-22 |
20170177645 | ENTERPRISE DATA RE-MATCHING - A system and method for managing media advertising enterprise data including a process for learning enterprise data matching. An EDM (Enterprise Data Management) application module can be configured to include a set of rules at an enterprise level to manage disparate and disconnected records associated with an entity. A number of unmatched and enterprise entities that matches with respect to an active entity can be returned based on a fuzzy logic associated with various matching options stored in an EDM database. A matching process can then be performed to accurately match similar records regardless of manual input, location, and format of the records in a distributed system. Each unmatched record can then be assigned with a parent enterprise entity. Such an optimization mechanism can interactively manage and report records at the enterprise level in a simple and efficient manner. | 2017-06-22 |
20170177646 | PROCESSING TIME SERIES DATA FROM MULTIPLE SENSORS - Processing time sequence data for multiple sensors, wherein the multiple sensors are divided into multiple sensor groups and each data comprises a time stamp and a value associated with the timestamp. The method comprises: receiving time series data from each sensor; assigning the time series data received to a sensor group to which the sensor belongs; storing time series data in a first database of a first memory, such that multiple time series data assigned to the same sensor group in the multiple sensor groups are stored in at least one database record of the first database; obtaining the time series data of each sensor among the multiple sensors from the first database; storing time series data in a second database of a second memory, such that the multiple time series data from the same sensor are stored in at least one database record of the second database. | 2017-06-22 |
20170177647 | PARALLEL DATABASE EDITING - As a conflict resolution system for the modification/editing of databases, the mechanism “for assigning priority to editing based on more up-to-date information” is disclosed. The system is effective in both full-fledged “parallel DB editing” in which a computer holds duplicated DBs permanently and the case in which a computer holds the duplicated DBs temporarily. The method is characterized in that “editing based on old information is determined to be ineffective.” When the information for which a conflict is predicted is edited, the possibility that the editing becomes ineffective can be reduced by a “substantially online operation” which performs “the synchronization with the up-to-date information, the editing, and the transmission of the editing records” quickly. Conversely, when the information for which the conflict is not predicted is edited, it is possible to carry out a “substantially off-line operation” which performs the editing at slow speed and transmits the editing records collectively after the synchronization of the information. | 2017-06-22 |
20170177648 | System and Method for Maintenance of Transitive Closure of a Graph and User Authentication - Disclosed can improve rights list management as well as performance of systems utilizing an access control list. A database server having a transitive closure management module may receive an identification of an entity defined in a database storing a cached transitive closure. The transitive closure management module may incrementally update the cached transitive closure stored in the database by generating a new transitive closure for the entity and determining a delete transitive closure record. The delete transitive closure record may be determined by analyzing the cached transitive closure and the new transitive closure, determining a first transitive closure path for the entity that is not specified in the new transitive closure and that is specified in the cached transitive closure, and selecting as the delete transitive closure record a record specifying the first transitive closure path. The delete transitive closure record can then be deleted from the cached transitive disclosure. | 2017-06-22 |
20170177649 | MAINTAINING DATA INTEGRITY DURING DATA MIGRATION - Various embodiments of systems and methods for maintaining data integrity during data migration are described herein. The systems and methods describe a data migration application that may be installed and executed on a computer device. The data migration application may be connected with multiple data systems via computer network. An authorized user may access the data migration application to migrate data between data systems such as from data source systems to destination systems. In case there is loss of data due to data system interruption, e.g. if a server is abruptly stopped, or software upgrade occurs, the data migration application may create backup data of the failed data migration. The data migration application may reinitiate the data migration to restore the data into the destination system. | 2017-06-22 |
20170177650 | DYNAMIC VIRTUAL SERVICE - A request is received at a virtual service simulating a particular data service. The request includes a uniform resource locator (URL) that includes a service root portion and a resource path portion identifying a particular resource of a data structure. Syntax of at least the resource path portion is verified based on a particular protocol. Consistency of the resource path portion with a structure of a data model corresponding to the particular data service is also verified. A query of a database is performed based on contents of at least the resource path portion and a simulated response of the particular data service to the request is generated using results of the query. | 2017-06-22 |
20170177651 | APPLYING TACIT KNOWLEDGE TO ITERATIVELY REFINE DATASETS - An aspect of applying tacit knowledge to iteratively refine datasets includes determining, via a computer processor, that a data element in the dataset is potentially in non-conformance with other data in the dataset. The potential non-conformance is determined based on a discrepancy in a pattern noted in the dataset with respect to the data element. The dataset spans multiple knowledge domains. An aspect also includes annotating a data structure containing the data element to indicate the potential non-conformance and providing, via a user interface of the computer processor, a plurality of users with access to the data structure. The users collectively indicate domain experts for each of the multiple knowledge domains. | 2017-06-22 |
20170177652 | COPYING GARBAGE COLLECTOR FOR B+ TREES UNDER MULTI-VERSION CONCURRENCY CONTROL - Structures and processes for garbage collection of search trees under Multi-Version Concurrency Control (MVCC). Such search trees may be used to store data within a distributed storage system. A process detects live search tree elements using tracing and then identify storage chunks having no live elements as garbage to be reclaimed. The process can be paused and resumed to reduce impact on other system processing. To reduce disk fragmentation, a garbage collector may copy pages between chunks prior to reclaiming chunk capacity. Also described is a resource efficient scheduler for a garbage collection. | 2017-06-22 |
20170177653 | COMPUTER SYSTEM, METHOD FOR INSPECTING DATA, AND COMPUTER - Provided is a computer system, including: a storage apparatus configured to provide a storage area formed by storage devices; and a computer configured to manage data, in which the storage area is configured to store a plurality of pieces of data, in which the plurality of pieces of data include a piece of data associated with another piece of data, and in which the computer is configured to: verify whether or not the piece of data is normally associated with the another piece of data; and start, when the plurality of pieces of data are verified, verification for one piece of data irrespective of whether or not verification for another piece of data is complete. | 2017-06-22 |
20170177654 | DYNAMIC MASTER DATA MANAGEMENT - A computer-implemented method includes, in a master data management system, receiving a persistent modification request affecting a master data attribute, determining that no preexisting master record exists in the master data management system for the master data attribute, and, responsive to determining that no preexisting master record exists for the master data attribute, adding a new master data attribute and associated new ownership information for the master data attribute to the master data management system, based on the persistent modification request. A corresponding computer program product and computer system are also disclosed. | 2017-06-22 |
20170177655 | DYNAMIC DATA NORMALIZATION AND DUPLICATE ANALYSIS - Methods and apparatuses for dynamic data normalization and duplicate analysis include normalizing data (e.g., merchant identifier data) received from a source entity (e.g., transaction card provider), as well as identifying and resolving potential duplicate transaction data objects based on one or more transaction characteristics. For example, data normalization includes partitioning an identifier into one or more merchant identifier portions, sending a merchant identifier request to a merchant database, and receiving a set of merchant representation candidates in response to sending the merchant identifier request. Further, for instance, duplicate analysis includes determining whether a transaction data object from the first set of transaction data objects that falls within the overlapping portion is not present in the second set of transaction data objects, and identifying the transaction data object within the second set of transaction data objects and the one or more non-overlapping portions. | 2017-06-22 |
20170177656 | SYSTEMS AND METHODS FOR RESOLVING DATA DISCREPANCY - Exemplary embodiments are provided for resolving data discrepancies. A request for resolution of data discrepancy is generated at a terminal in response to a difference between a first data value and a second data value. A server determines whether the difference between the first data value and the second data value is within a pre-defined threshold. When the difference is within the threshold, a message is transmitted to use the second data value. When the difference is not within the threshold, a message is transmitted to hand held devices to resolve the discrepancy. The hand held devices transmit a message including instructions on how to resolve the data discrepancy. The server transmits the instructions to the terminal to resolve the data discrepancy. | 2017-06-22 |
20170177657 | SYSTEMS, METHODS, AND APPARATUSES FOR FIXING LOGICAL OR PHYSICAL CORRUPTION IN DATABASES USING LSM TREES - In accordance with disclosed embodiments, there are provided methods, systems, and apparatuses for fixing logical or physical corruption in databases using LSM trees including, for example, means for storing records in a LSM database at the host organization; processing transactions to the LSM database by writing the transactions into immutable extents for subsequent merge into the LSM database; recording a history of the transactions in a log; identifying corruption in at least one of the records of the LSM database represented within the immutable extents prior to use of the immutable extents in the LSM database; and correcting the identified corruption to the at least one of the records of the LSM database based at least in part on the recorded history of the transactions in the log during live operation of the LSM database. Other related embodiments are disclosed. | 2017-06-22 |
20170177658 | TABLE REPLICATION IN A DATABASE ENVIRONMENT - Technologies are described for performing replication of data within a database environment having a source node and a replica node. The source node executes a database operation on at least one database table stored by the source node. The source node asynchronously sends the database operation to the replica node. A prepare commit request is synchronously sent from the source node to the replica node. The source node receives a synchronous precommit acknowledgement from the replica node. The precommit acknowledgement indicates that the database operation was executed at the replica node. The source node commits a transaction associated with the database operation. | 2017-06-22 |
20170177659 | SYSTEMS AND METHODS FOR HOST DETECTION OF USB ASYNCHRONOUS NOTIFICATION CAPABILITY - Systems and methods for detecting legacy storage devices that may falsely and/or incorrectly report to host systems that they have removable media. Such false or incorrect reporting may cause the host system to periodically poll the storage device as to whether the device is ready for I/O processing. Such polling would be unnecessary and represent a waste of power expended by the host system. In one embodiment, the present system may implement processes that periodically poll storage media and update a database. The database would be a listing of storage devices indicating whether they truly have removable media or falsely report that they have removable media. In another embodiment, the present system may apply some heuristically testing to determine whether a storage device so falsely indicates removable media. In another embodiment, telemetry service may be used by a group of hosts to share data regarding such storage devices. | 2017-06-22 |
20170177660 | NATURAL LANGUAGE EMBELLISHMENT GENERATION AND SUMMARIZATION FOR QUESTION-ANSWERING SYSTEMS - Systems and methods are disclosed for augmenting or summarizing an information processing task in a bilateral Q&A format. An initial query is received from an analyst user to conduct an analysis on user-provided data attributes. A primary result is generated from processing the initial query. In addition, defined data attributes associated with the primary result are ranked to create relevant follow-up queries. A summary of the primary result, using both graphical representations and natural language summaries, are provided to the analyst user. The relevant follow-up queries can also be provided to the analyst user, thereby progressing a contextually-based conversation regarding the data. The analytics session can progress as the user traverses the results and follow-up queries, until the user terminates the session or all relevant follow-up queries are exhausted. A concise narrative of the session with varying levels of detail specified by the user is presented in natural language to provide the analyst user with a relevant summary of the performed analysis. | 2017-06-22 |
20170177661 | IDENTIFYING USER MANAGED SOFTWARE MODULES - A computer system for identifying user managed software modules includes program instructions for: receiving a request for a directed load of a software module into memory, wherein the request includes an address; storing the software module at the address in the received request; adding a name and an address range of the stored software module to a data structure identifying software modules that have been loaded into memory via directed loads; receiving a query that includes an input module name or an input address range; and responsive to determining that the input module name or input address range of the received query is not stored in one or more data structures identifying one or more software modules that have been loaded into memory without directed loads, searching the data structure identifying software modules that have been loaded into memory via directed loads for the respective query. | 2017-06-22 |
20170177662 | ACCESSING ON-PREMISE AND OFF-PREMISE DATASTORES THAT ARE ORGANIZED USING DIFFERENT APPLICATION SCHEMAS - Techniques are disclosed for accessing on-premise and off-premise datastores organized using different application schemas. An interface serves requests, from a tenant, by accessing either the on-premise datastore or the off-premise datastore. The interface receives a request for a particular data set. Based on the request itself, the interface selects either the on-premise datastore or the off-premise datastore to retrieve the particular data set. The interface retrieves the particular data set from the selected datastore without attempting to retrieve the particular data set from the non-selected datastore. The interface transmits and/or presents the particular data set. | 2017-06-22 |
20170177663 | METHODS AND SYSTEMS FOR ESTIMATING THE NUMBER OF POINTS IN TWO-DIMENSIONAL DATA - A method, medium, and system to generate cardinality estimates for at least one query execution plan for a query by representing a given set of multidimensional data including a plurality of data points having a value by a hierarchical tree data structure including nodes, each node representing a distribution of a subset of the points in the data set and being partitioned into tiles; calculating a bounding rectangle of the data points in each node; entering all non-empty tiles into a queue; processing of the queue can continue until a computational memory space limit is reached or until a desired estimation resolution is met; and encoding the resulting tree structure. | 2017-06-22 |
20170177664 | ELIMINATING REDUNDANCY WHEN GENERATING INTERMEDIATE REPRESENTATION CODE - Disclosed herein are system, method, and computer program product embodiments for eliminating redundancy when generating intermediate representation code. An embodiment operates by traversing a query execution plan, and for at least one operator in the query execution plan, determining whether the operator is derived from a parent class operator. If it is determined that the operator is derived from the parent class operator, source code for the native access plan is generated using one or more code generator functions corresponding to the parent class operator and/or one or more generator functions specifically corresponding to the child class operator. If it is determined that the operator is not derived from the parent class operator, source code for the native access plan is generated using one or more code generator functions corresponding to the operator. | 2017-06-22 |