Abstract: Systems, methods, and computer-readable media are disclosed for secure integer comparison using binary trees. A server may receive a first encrypted input and a public encryption key from a client. The server may create a binary tree representing a second encrypted input. The server may evaluate the first encrypted input on the binary tree. The evaluation may comprise computing decision bits along a plurality of paths of the binary tree. The decision bits may then be aggregated along each path of the binary tree and the aggregation stored at a leaf node of each path. The leaf node of each path may be evaluated to obtain a comparison result. The comparison result may be encrypted with the public encryption key. The server may send the comparison result to the client for decryption. The comparison result may indicate whether the first input was larger than the second input.

Abstract: Techniques for reducing a distractor object in a first image are presented herein. A system can access a mask and the first image. A distractor object in the first image can be inside a region of interest and can have a pixel with an original attribute. Additionally, the system can process, using a machine-learned inpainting model, the first image and the mask to generate an inpainted image. The pixel of the distractor object in the inpainted image can have an inpainted attribute in chromaticity channels. Moreover, the system can determine a palette transform based on a comparison of the first image and the inpainted image. The transform attribute can be different from the inpainted attribute. Furthermore, the system can process the first image to generate a recolorized image. The pixel in the recolorized image can have a recolorized attribute based on the transform attribute of the palette transform.

Abstract: Systems and methods are described for applying a unifying visual effect, such as posterization, to all or most of the visual elements in a film. In one implementation, a posterization standard includes a line work standard, a color palette, a plurality of color blocks characterized by one or more hard edges, and a gradient transition associated with each of the hard edges. The visual elements, including live actors and set pieces, are prepared in accordance with the posterization standard. The actors are filmed performing live among the set pieces. The live-action segments can be composited with digital elements. The result is a combination of both real and stylized elements, captured simultaneously, to produce an enhanced hybrid of live action and animation.

Abstract: The present disclosure related to techniques for analyzing data from multiple different data sources to determine a relationship between the data (also referred to herein a “data relationship discovery”). The relationships between any two compared datasets may be used to determine one or more recommendations for merging (e.g., joining), or “blending,” the data sets together. Relationship discovery may include determining a relationship between a subset of data, such as a relationship between a pair of columns, or column pair, each column in a different dataset of the datasets that are compared. Given two datasets to process for relationship discovery, relationship discovery may identify and recommends a ranked subset of column pairs between two compared datasets. The ranked column pairs identified as a relationship may be useful for blending the datasets with respect to those column pairs.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for database key identification. One of the methods includes receiving an identification of a first field in a first data set, the first data set including records. The method includes identifying a set of values, the set including, for each record, a value associated with the field. The method includes generating a filter mask based on the set of values, where application of the filter mask is capable of determining that a given value is not in the set of values. The method includes receiving a second data set including a second field, the second data set including records. The method includes determining a count of a number of records in the second data set having a value associated with the second field that passes the filter mask. The method also includes storing the count in a profile.

Abstract: Systems and methods are disclosed involving user interface (UI) search tools for locating data, including tools for summarizing indexed raw machine data that organize and present results to enable expansion and exploration of initial summarizations. The initial summarizations may be explored and refined to help users determine how to identify and best focus a search on data subsets of greater interest.

Abstract: Methods and systems for converting user data from disparate sources to bitmap data are described, where user data from a plurality of different data sources are conformed to a conformed user data set using a conform mapping schema, and the conformed data set is then analyzed to create a bitmap mapping schema which provides a mapping from the conformed user data set to a bitmap data set. The conformed user data set is then converted to a bitmap data set using the bitmap mapping schema and the current user data in the conformed user data set. A query user interface (UI) may be provided to allow clients or others to query the resulting bitmap data set.

Abstract: SCAN operations for databases where scan time is dependent on a payload size consume too much memory space and computing time as payload sizes increase. A database table is configured to include an additional index mapping column that stores bitmaps related to the corresponding row of the table. Each bit in the bitmap corresponds to a column and indicates whether that column stores a value. Inclusion of an index column in a table decouples the time it takes to perform the SCAN operation on a column from the payload size of data stored in the column. The bitmaps stored in the index column are relatively small and uniform in size, so the SCAN operation on such a database requires only for the bitmap values of the applicable rows to be obtained from the index column and inspected.

Abstract: A system and method for pruning data based on metadata. The method may include receiving a query that includes a plurality of predicates and identifying one or more applicable files including database data satisfying at least one of the plurality of predicates. The identifying the one or more applicable files including reading metadata stored in a metadata store that is separate from the database data. The method further includes pruning inapplicable files comprising database data that does not satisfy at least one of the plurality of predicates to create a reduced set of files and reading the reduced set of files to execute the query.

Abstract: A system performs operations that include determining match text data based on a comparison between input text data and an index of keywords and identifying a set of match word tokens from the match text data. The operations further include determining one or more solution sets of input word tokens based on comparing the set of match word tokens and the input text data. Additionally, the operations include calculating a respective solution set score for each of the one or more solution sets of input word tokens based on the calculated similarity values. A match between the input text data and the match text data is determined based on the first solution set score satisfying a score threshold.

Abstract: An electronic payment and authentication system that includes features to verify the authenticity of a payer, validate debit data, and facilitate debit (as opposed to credit) payment transactions. The electronic payment system allows a consumer to purchase items and services via a network while utilizing a debit transaction. The invention provides merchants with the ability to verify the identity of the consumer, determine if the consumer is a good debit transaction risk, and retrieve debit data associated with a particular consumer.

Abstract: A system and method for pruning data based on metadata. The method may include receiving a query comprising a plurality of predicates and identifying one or more applicable files comprising database data satisfying at least one of the plurality of predicates. The identifying the one or more applicable files including reading metadata stored in a metadata store that is separate from the database data. The method further includes pruning inapplicable files comprising database data that does not satisfy at least one of the plurality of predicates to create a reduced set of files and reading the reduced set of files to execute the query.

Abstract: Technologies for artificial neural network training include a computing node with a host fabric interface that sends a message that includes one or more artificial neural network training algorithm values to another computing node in response to receipt of a request to send the message. Prior to sending the message, the host fabric interface may receive a request to quantize the message and quantize the message based on a quantization level included in the request to generate a quantized message. The quantization message includes one or more quantized values such that each quantized value has a lower precision than a corresponding artificial neural network training algorithm value. The host fabric interface then transmits the quantized message, which includes metadata indicative of the quantization level, to another computing node in response to quantization of the message for artificial neural network training. Other embodiments are described and claimed.

Abstract: A method, apparatus and computer program product for managing a storage system are provided. For example, in a method, a tree index of the storage system is obtained, where a leaf node among multiple leaf nodes in the tree index comprising a keyword and an attribute of an object among multiple objects in the storage system. Respective attributes of nodes in a set of the multiple leaf nodes in the tree index are obtained, and the set of the multiple leaf nodes having a same parent node. The tree index is updated based on respective attributes of the leaf nodes in the set of the multiple leaf nodes. With the above example implementations, performance of the index of the storage system can be increased, and further overall response speed of the storage system can be improved. Further, there is provided an apparatus and computer program product for managing a storage system.

Abstract: A method may include identifying, based on a first hash representation of a value, a first cache line corresponding to the value. A first bit and a second bit in the cache line may be identified as corresponding to the value based on a second hash representation of the value. The first bit may be identified based on a first offset in a binary representation of the second hash representation. The second bit may be identified based on a second offset in the binary representation of the second hash representation. Each of the first offset and the second offset may include a portion of the binary digits forming the binary representation of the second hash representation. The value may be determined to be absent from a set of values based the first bit and/or the second bit being set to a first value instead of a second value.

Abstract: A method and system for mapping data elements between a source data structure and a target data structure. A source data element is mapped to a target data element by matching a source key and value pair to a target key and value pair. A parent source Soundex key for each parent element of the source data element is created. A parent target Soundex key for each parent element of a plurality of target data elements snatching the first Soundex key of the source data element is created. The parent source Soundex key for each parent element of the source data element is compared with each parent target Soundex key. The source data element is mapped to the target data element having the parent target Soundex key that matches the parent source Soundex key.

Abstract: Method and apparatus for performing a database query using a bitmap index in a data-base having a plurality of bitmap vectors, the method comprising the steps of: upon receipt of a query containing a selection condition, creating a filter bitmap based on the query input; performing a bitmap scan for the filter bitmap in order to determine at least one value of an existing matching data-base entry; determining a bitmap of the determined at least one value; creating a filtered bitmap by combining the filter bitmap with the bitmap of the determined at least one value; determining all entries in the database matching the filtered bitmap; sub-tracting the filtered bitmap from the filter bitmap, thus creating a new filter bitmap; repeating the steps, starting with the step of performing a bitmap scan based on the new filter bitmap, until the step of sub-tracting results in an empty bitmap.

Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.

Abstract: In a data management method for a storage device, the storage device includes a nonvolatile memory device including a plurality of memory blocks. A TRIM-after-COPY command is received from an external host such that a data compaction operation is performed on a first storage region. Valid data stored in the first storage region are internally copied into a second storage region based on the TRIM-after-COPY command. A TRIM operation is performed based on the TRIM-after-COPY command to update a logical-to-physical address mapping table and a valid page bitmap.

Abstract: The present disclosure related to techniques for analyzing data from multiple different data sources to determine a relationship between the data (also referred to herein a “data relationship discovery”). The relationships between any two compared datasets may be used to determine one or more recommendations for merging (e.g., joining), or “blending,” the data sets together. Relationship discovery may include determining a relationship between a subset of data, such as a relationship between a pair of columns, or column pair, each column in a different dataset of the datasets that are compared. Given two datasets to process for relationship discovery, relationship discovery may identify and recommends a ranked subset of column pairs between two compared datasets. The ranked column pairs identified as a relationship may be useful for blending the datasets with respect to those column pairs.

Abstract: Automated malware detection for application file packages using machine learning (e.g., trained neural network-based classifiers) is described. A particular method includes generating, at a first device, a first feature vector based on occurrences of character n-grams corresponding to a first subset of files of multiple files of an application file package. The method includes generating, at the first device, a second feature vector based on occurrences of attributes in a second subset of files of the multiple files. The method includes sending the first feature vector and the second feature vector from the first device to a second device as inputs to a file classifier. The method includes receiving, at the first device from the second device, classification data associated with the application file package based on the first feature vector and the second feature vector. The classification data indicates whether the application file package includes malware.

Abstract: A computing system locates session state data associated with a preceding data review session corresponding to a user in response to a request to initiate a new data review session for the user. The session state data includes an identifier of a next document to be reviewed, and filter settings of the preceding data review session. The computing system locates the next document to be reviewed based on the session state data and provides the located next document to be reviewed in a graphical user interface when initiating the new data review session for the user. The new data review session is based on the filter settings in the session state data.

Abstract: The technology described herein provides for identifying matching documents for a search query using a bit vector search index. When a search query is received, a term is identified from the search index, and a number of bit vectors corresponding to the term are identified. Each bit vector comprises an array of bits in which at least one bit in each bit vector indicates that a corresponding document includes the term. Each bit vector also includes other bits indicating other documents include other terms. The identified bit vectors are intersected to identify matching documents that contain the term.

Abstract: A method, system and computer program product are provided for reorganizing a database table according to a set of queries. More specifically, the table is reorganized such that random I/O is reduced by more tightly grouping together rows in the table associated with each of the referencing queries. This enables more associated rows from a given table relevant to a query to be read into memory for a given I/O operation.

Abstract: A location search device is provided. The location search device includes a storage in which character string information indicative of a location is divided into three or more search hierarchical levels according to units of division of the search hierarchical levels. The location search device searches for a location by references the character string information in a predefined search sequence of search hierarchical levels to sequentially identify a division on each search hierarchical level based on a character string input from a user. When the location search device accepts a user input designating a search hierarchical level that is reached by moving backward the predefined search sequence of the search hierarchical levels, the location search device regresses to the designated search hierarchical level and re-identify a division.

Abstract: A method, a system, and a computer program product for managing a database are disclosed. Managing the database includes managing an index of a table of the database. Managing the index includes determining the table includes a first field having a first input value configured to identify a first dynamic data function utilized to determine a first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is deterministic, determining the first output value for the first field using the first dynamic data function, and storing the first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is nondeterministic, determining a first special value to represent the first output value for the first field, and storing the first special value for the first field.

Abstract: A system for memory allocation and deallocation with a multi-level memory map is provided. In some implementations, the system performs operations comprising allocating a memory map for addressing a plurality of memory locations in a heap, the memory map comprising a root node, one or more second-level nodes, and a plurality of third-level nodes. The plurality of third-level nodes can comprise third entries for pointing to the memory locations and/or the one or more second-level nodes can comprise a plurality of second entries corresponding to the plurality of third-level nodes. The operations can further include determining a location to store data within the heap and/or tracking the location by placing a pointer within a third-level node of the plurality of third-level nodes and incrementing a counter corresponding to the third-level node. Related systems, methods, and articles of manufacture are also described.

Abstract: Improved systems and methods are provided for identifying financial relationships. In particular, financial relationships may be identified by associating tradelines with one or more people who sign or co-sign on the tradeline. In various embodiments a method is provided comprising, receiving, at a computer-based system for credit data analysis comprising a processor and a tangible, non-transitory memory, credit reporting data relating to a tradeline, parsing, by the computer-based system, the credit reporting data to yield primary debtor data and secondary debtor data and linking, by the computer-based system, the tradeline with the primary debtor data and the secondary debtor data.

Abstract: A method, a system, and a computer program product for managing a database are disclosed. Managing the database includes managing an index of a table of the database. Managing the index includes determining the table includes a first field having a first input value configured to identify a first dynamic data function utilized to determine a first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is deterministic, determining the first output value for the first field using the first dynamic data function, and storing the first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is nondeterministic, determining a first special value to represent the first output value for the first field, and storing the first special value for the first field.

Abstract: One embodiment of the present invention provides a system that facilitates performing multi-stage table updates. During operation, the system receives a query at a query processor, wherein executing the query causes an update to an entire table in a database. Next, the system estimates an amount of transaction log space required to execute the query. If the amount of transaction log space is greater than a pre-determined threshold, the system splits the query into a set of sub-queries, wherein an amount of transaction log space required by each sub-query in the set of sub-queries is less than the pre-determined threshold. For each sub-query in the set of sub-queries, the system executes the sub-query, and performs a mini-commit operation for the sub-query, wherein updates which comprise the mini-commit operation are not exposed to a user. Finally, when mini-commit operations have been performed for all of the sub-queries, the system performs a commit operation for the query.

Abstract: Described herein are systems and methods for generating integrated identifiers that may be combined with database sequence values to create a high probability of uniqueness that minimizes assigning duplicate identifiers to one or more databases. The integrated identifier may be based in part on several identifiers associated with a database. This may include a numeric identifier assigned to the database, a name assigned to the database, or any other database property that may be relatively unique. In one embodiment, the integrated identifier may be associated with a sequence value for a database. While the sequence value may be unique within the database, the integrated identifier may be unique to other database identifiers. When an existing database is cloned, a new integrated identifier may be generated from the cloned database. New records stored in the new database may use the new integrated identifier, while the cloned records will remain unedited.

Abstract: Systems and methodologies that enhance a Tabular Data Stream (TDS) protocol by enabling efficient transmission of a row(s) with null columns(s). An identification component employs a bit map that can be positioned at beginning of a row, to indicate to the receiving side (e.g., a client) columns that are to be sent. Accordingly, by distinguishing columns that are null from columns that are not null—followed by sending columns that are not null—transmission resources can be effectively employed.

Abstract: Provided are methods comprising receiving a query for information from the database, determining particular data element types and data element values that are the subject of the query, instantiating a query data structure containing the data element types and the data element values that are the subject of the query, identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure, and instantiating a results data structure comprising information relating to the identified records.

Abstract: In embodiments of the present invention improved capabilities are described for managing RFID tags, where an RFID tag and associated RFID tag data are presented to a computing device through an RFID drive management facility as a seamless extension of a logical file system within the computing device such that the RFID tag and associated RFID tag data can be managed in a manner that is consistent with other items within the file system.

Abstract: An apparatus and method are described for the discovery of semantics, relationships and mappings between data in different software applications, databases, files, reports, messages, or systems. In one aspect, semantics and relationships and mappings are identified between a first and a second data source. A binding condition is discovered between portions of data in the first and the second data source. The binding condition is used to discover correlations between portions of data in the first and the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source.

Abstract: A cloud computing service stores customer data on a server that is located outside of a network security system of the customer. The cloud computing service automatically monitors the customer data to identify one or more access events that originate from a resource within the cloud computing service. For each access event, the service identifies a resource and a data set. The resource may include an identifier associated with a human operator or a software application that performed the access event, and the data set may include customer data that the resource accessed during the access event. The service may create a report of each access event and the information corresponding to the data set for each access event, and it may cause the report to be transmitted to the customer.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for training scoring models. One method includes storing data identifying a plurality of positive and a plurality of negative training images for a query. The method further includes selecting a first image from either the positive group of images or the negative group of images, and applying a scoring model to the first image. The method further includes selecting a plurality of candidate images from the other group of images, applying the scoring model to each of the candidate images, and then selecting a second image from the candidate images according to scores for the images. The method further includes determining that the scores for the first image and the second image fail to satisfy a criterion, updating the scoring model, and storing the updated scoring model.

Abstract: Techniques for indexing file paths of items in a content repository may include taking turns in querying each different item type or folder type in a round robin schedule to visit select nodes of the folder tree of that type to update and maintain the file path indexes. Item types or folder types may be associated with a count of instances or children of instances that are missing indexes. For each item type or folder type, a query may be performed for instances of the item type or folder type having children that are missing indexes, the instances or children of the instances returned may be associated with file path indexes, and the count of instances or children of instances may be adjusted based on the associating.

Abstract: A plurality of storage devices is organized into a physical volume called an aggregate, and the aggregate is organized into a global storage space, and a data block is resident on one of the storage devices of the plurality of storage devices. A plurality of virtual volumes is organized within the aggregate and the data block is allocated to a virtual volume. A physical volume block number (pvbn) is selected for the data block from a pvbn space of the aggregate, and virtual volume block number (vvbn) for the data block is selected from a vvbn space of the selected vvol. Both the selected pvbn and the selected vvbn are inserted in a parent block as block pointers to point to the allocated data block on the storage device.

Abstract: An additional data structure can be initialized for a column of compressed data to include a prefix storing, for each block of values in the column, a total number of bits set in previous blocks in the bit vector. A block number can be determined for a target block of the plurality of blocks, for example by checking whether or not a specified row number is located in the prefix. If the specified row number is located in the prefix, the prefix value of the prefix is returned, the most frequently occurring value is returned if a corresponding bit in the bit vector in the specified row number is not located in the prefix, or a position of the specified row in an index vector for the column is returned.

Abstract: A system is disclosed for faster processing of range queries. The system includes at least one processor and a memory storing a hybrid range query data structure in the form of a binary tree. The structure includes a root node, non-leaf nodes, and leaf nodes. The root node is a bitmap that includes one bit for each value in a first set of values. The non-leaf nodes are also bitmaps. The leaf nodes eliminate a number of lower levels of the tree and include two or more second values that map to values in the first set of values. The system may include instructions that cause the system to receive a range of first values, use the range of first values to traverse the data structure to identify second values that map to the first values, and return the identified second values in sorted order.

Abstract: A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.

Abstract: Systems and methods for deleting non-key values from an index distributed over a plurality of computing devices maintains a non-key master list that includes the non-key values that are stored on each of the plurality of computing devices and receives a list of non-key values to delete. The systems and methods further intersect the list of non-key values to delete with the non-key master list, creating a first delete list for a first one of the plurality of computing devices that includes non-key values to be deleted that are stored on the first computing device. The systems and methods further transmit the first delete list to the first computing device and update the non-key master list based on the list of non-key values to delete.

Abstract: Techniques for managing query execution based on memory usage using memory compression. Embodiments may receive a query from a requesting entity and estimate an amount of memory required to execute the query. Upon determining that executing the query would consume an impermissible amount of memory, embodiments may optimize the query by adjusting an amount of memory compression used in executing the query. The optimized query may then be executed to produce a set of query results, which may then be returned to the requesting entity.

Abstract: The present disclosure includes techniques for storing indexed values that may increase computing performance. In one example, a method includes receiving a request to store an input value in a data structure. The method also includes determining the input value is not represented by an index value of the first group of index values, generating an index value that represents the input value, and determining the generated index value is not included in the first group of representations. The method also includes generating a second group of index values wherein a first size of index values of the first group is different than a second size of index values of the second group. The method also includes modifying a storage capacity of the data structure to store the index values of the second group of the second size and storing the second group of index values in the data structure.

Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.

Abstract: An extracting method includes storing to a storage device: files that include character units; first index information indicating which file includes at least one character unit in a character unit group having a usage frequency less than a predetermined frequency and among character units having common information in a predetermined portion, the usage frequency indicating the extent of files having a given character unit; second index information indicating which file includes a first character unit having a usage frequency at least equal to the predetermined frequency and among the character units having common information in a predetermined portion; and referring to the first and second index information to extract a file having character units in the first and second index information, when a request is received for extraction of a file having the first character unit and a second character unit that is included in the character unit group.

Abstract: Methods and a device for providing a compressed index of binary records. A method includes: sorting the records by content of a predetermined field of the record, indexing the field from one of the records in a line of a bitmap index, compressing bits in a column of the bitmap index by replacing a group of successive bits with a code, where the sorting includes the steps of assigning, for each record, a hash bucket of a hash table on a basis of a locality sensitive hash function on the contents of the predetermined field, so that the probability for two of the records to be assigned to the same has bucket increases with the similarity of the contents of the predetermined field between the records, and where at least one step of the computer implemented method is executed on a computer device.

Abstract: An integrated circuit includes a search unit configured to access an input vector including a number of bits, and to find a first and a second instance of a predetermined bit value such as a logic zero or a logic one, for example. The search unit may be further configured to generate an output that includes an indication of a bit position of the first instance of the predetermined bit value within the input vector, and an indication of a bit position of the second instance of the predetermined bit value within the input vector.

Abstract: This document describes various techniques for efficiently sequencing structured data in a particular order to provide a sequence of data elements suitable for storage or communication. The sequence may contain values representing a number of default-value structured data elements omitted from the sequence and/or a byte length of the sequence.