Abstract: Systems, apparatuses, methods, and computer program products are disclosed for automated generation and validation of a data dictionary. An example method includes automatically generating a data dictionary based on one or more reference term tokens of a database query. The example method further includes validating the data dictionary by generating, based on the database query and the data dictionary, a skeleton query, and determining, based on the skeleton query, a validation status of the data dictionary.

Abstract: Disclosed system specifies, based on measurement results of communication times taken for accessing a plurality of external databases, relation between the communication times taken for accessing the plurality of external databases, calculates, when accepting an instruction to execute processing using at least one of the plurality of external databases, a processing load when accessing the at least one of the external databases, based on the relation between the communication times, and controls an access to data included in the at least one of the external databases according to the calculated processing load.

Abstract: Techniques are disclosed relating to implementing a machine learning approach to cross-language translation and search. In certain embodiments, a method may include receiving a plurality of characters of a first language that are unsegmented and grouping the plurality of character into multiple groups. The method also includes determining a set of word tokens based on one or more transliterations of the multiple groups and one or more translations of the multiple groups to a second language. Further, the method includes generating one or more word token solution sets by querying an index file using the one or more word tokens. The method also includes determining whether the index file references an entity name corresponding to the plurality of characters of the first language based on comparing the one or more token solution sets with the index file.

Abstract: A low-latency file system file address space management method and system, and a medium. The method of the present invention comprises: generating a superblock and a block group allocation table from an address space of a storage device, wherein the superblock stores file system information and the allocation situation of block groups on a liner address space of the storage device, and the block group allocation table is used for marking the allocation situation of data blocks in the corresponding block group; when a file is created, dynamically creating or selecting a corresponding block group according to the size of a specified data block and allocating the data block; and writing file data into the allocated data block, and updating the block group allocation table and information of the superblock.

Abstract: Systems, apparatuses, methods, and computer program products are disclosed for automated data dictionary generation and validation. An example method includes receiving a first data dictionary. The example method also includes parsing a database query to identify one or more reference term tokens. The example method also includes automatically generating a second data dictionary based on the one or more reference term tokens. The example method also includes validating the first data dictionary based on the second data dictionary. The example method also includes causing presentation of a validation status of the first data dictionary.

Abstract: A method for execution by a computing device of a storage network includes dispersed storage error decoding a plurality of sets of encoded data slices to recover a plurality of secure packages, where the plurality of secure packages include a plurality of encrypted data segments and a plurality of sets of encoded key slices, and where encoded key slices are appended to the encrypted data segments in accordance with an appending approach. The method includes splitting the plurality of secure packages into the plurality of encrypted data segments and the plurality of sets of encoded key slices. The method includes decoding the at least the decode threshold number of each set of the plurality of sets of encoded key slices to recover a plurality of encryption keys. The method includes decrypting the plurality of encrypted data segments using the plurality of encryption keys to recover the data segments.

Abstract: Intelligent analysis and prognosis-based data partitioning orchestration for optimizing database performance. Partitioning is not limited to partitioning keys established solely based on the columns of the table being partitioned, rather analysis is undertaken on dependent tables and the past behavior of fundamental data elements in the database is assessed as a means for determining the most optimal partitioning scheme. Thus, relevant information and values in the table being partitioned, as well as dependent tables and the fundamental data elements is used to determine how likely each record/row in the table is to be subjected to a data manipulation operation. The likelihood of a data manipulation operation being performed on each record serves as the basis for assigning the record to one of a plurality of partitions.

Abstract: An in-memory digital processor, Perpetual Digital Perceptron (PDP), is disclosed. The digital in-memory processor of the invention processes the input digital information according to a database of the digital content data stored/hardwired in the Content Read Only Memory (CROM) array and outputs the correspondent digital response data stored/hardwired in the Response Read Only Memory (RROM) array. The PDP is the hardwired digital in-memory processor without re-configuration capability and similar to the instinct functions of biological hardwired brains without re-shaping their neuromorphic structures from training and learning.

Abstract: A method by a computing device implementing an attack analyzer for processing malicious events. The method includes determining a first set of features describing a malicious event detected by a firewall, determining a set of distances using a non-Euclidean distance function and the first set of features, wherein the non-Euclidean distance function is used to determine geographic origin similarity between different Internet Protocol addresses included in the first and second set of features, generating a statistical distribution object using the set of distances, wherein the statistical distribution object includes information describing a cluster that includes at least the malicious event and one or more other malicious events that are determined to be similar to the malicious event in terms of geographic origin, and transmitting information describing the cluster to a management console for presentation to an administrator on a graphical user interface.

Abstract: A method for managing big metadata using columnar techniques includes receiving a query request requesting data blocks from a data table that match query parameters. The data table is associated with system tables that each includes metadata for a corresponding data block of the data table. The method includes generating, based on the query request, a system query to return a subset of rows that correspond to the data blocks that match the query parameters. The method further includes generating, based on the query request and the system query, a final query to return a subset of data blocks from the data table corresponding to the subset of rows. The method also includes determining whether any of the data blocks in the subset of data blocks match the query parameters, and returning the matching data blocks when one or more data blocks match the query parameters.

Abstract: Mechanisms are provided for adjusting a configuration of data stored in a storage system. According to various embodiments, a storage module may be configured to store a configuration of data. A processor may be configured to identify an estimated performance level for the storage system based on a configuration of data stored on the storage system. The processor may also be configured to transmit an instruction to adjust the configuration of data on the storage system to meet the service level objective when the estimated performance level fails to meet a service level objective for the storage system.

Abstract: In an approach for character encoding, a processor receives a first query involving an attribute, wherein the first query utilizes a value encoded in accordance with a first encoding scheme. A processor identifies a table comprising values of the attribute in a compressed format. A processor creates at least one dictionary associated with the attribute, wherein the at least one new dictionary associated with the attribute maps a compressed value to a corresponding uncompressed value. A processor executes the first query by invoking a conversion operation in a query plan of the first query for decoding one or more queried values of the attribute. A processor fills the at least one new dictionary with one or more decoded query values to create at least one full dictionary. A processors stores the at least one full dictionary in a cache using a predefined cache management policy of the cache.

Abstract: A method for updating a stable cuckoo filter used for membership testing of data streams, executed by a processor, is described. The method includes the steps of: performing a first hash on a first element to be inserted into the stable cuckoo filter to determine a first candidate bucket; performing a second hash on a fingerprint of the first element to determine a second candidate bucket; selecting a target candidate bucket from a group consisting of the first candidate bucket and the second candidate bucket; inserting the first element into the target candidate bucket; updating the stable cuckoo filter according to one or more of a random update strategy, an insertion failure update strategy, a scanning strategy, a skip scanning update strategy, a blocked design strategy and a local time-sensitive update strategy; and obtaining an updated stable cuckoo filter.

Abstract: A data collection system includes a first device that includes a generation unit configured to generate installation data including an edge-server function program for collecting data items generated by a device group including plural devices and a transmission unit configured to transmit the installation data generated by the generation unit to outside and a second device that includes an installation unit configured to install the edge-server function program by using the installation data transmitted from the first device. The second device selects one or more registration candidate devices by comparing first information that is further included in the installation data and second information that is acquirable separately from the installation data and attempts to register the one or more registration candidate devices as data collection targets when installation of the edge-server function program is completed by the installation unit.

Abstract: A query directed at a table organized into a set of batch units is received. The query comprises a predicate for which values are unknown prior to runtime. A set of values for the predicate are determined based on the query. An index access plan is created based on the set of values. Based on the index access plan, the set of batch units are pruned using a pruning index associated with the table. The pruning index comprises a set of filters that index distinct values in each column of the table. The pruning of the set of batch units comprises identifying a subset of batch units to scan for data that satisfies the query. The subset of batch units of the table are scanned to identify data that satisfies the query.

Abstract: A method and device generates a slab identifier and a hash function identifier in response to a memory allocation request with a request identifier and allocation size from a memory allocation requestor. The slab identifier indicates a memory region associated with a base data size and the hash function identifier indicates a hash function. The method and device provides a bit string including the slab identifier and the hash function identifier to the memory allocation requestor.

Abstract: Methods and systems are disclosed where a plurality of precompiled hardware templates are stored in memory, each of the hardware templates being configured for loading onto a re-configurable logic device such as a FPGA to define a data processing operation to be performed by the re-configurable logic device, each of the data processing operations defined by the precompiled hardware templates having an associated performance characteristic. A processor selects a precompiled hardware template from a plurality of the precompiled hardware templates in the memory for loading onto the re-configurable logic device based at least in part on the associated performance characteristics of the data processing operations defined by the precompiled hardware templates.

Abstract: In an embodiment, a first key value is received. A plurality of candidate rows are found in a database table, wherein the plurality of candidate rows are deleted. For the plurality of candidate rows, a plurality of respective impacts on a plurality of respective densities of each of other key values that are stored within a first key range of the first key value are calculated. For the plurality of candidate rows, a plurality of function results of the plurality of respective impacts on the plurality of respective densities are calculated. A selected candidate row of the plurality of candidate rows with a smallest function result of the plurality of function results of the plurality of respective impacts on the plurality of respective densities is selected. The first key value is stored to the selected candidate row.

Abstract: A method, article of manufacture, and apparatus for processing data. In some embodiments, this includes analyzing a first container at a block level, determining a first level of granularity based on the analysis of the first container, based on the first level of granularity, identifying a first set of data objects, storing metadata of the first set of data objects in a recovery catalog, based on the first set of data objects, identifying a second container, analyzing the second container at a block level, determining a second level of granularity based on the analysis of the second container, based on the second level of granularity, identifying a second set of data objects, storing metadata of the second set of data objects in the recovery catalog, wherein the recovery catalog is stored in a storage device.

Abstract: A data structure and method of accessing, modifying, and adding data in the data structure are provided. The data structure includes an encoding dictionary, a decoding dictionary, and an attribute vector. The attribute vector includes information for cross-referencing characteristics associated with the same entry. Responsive to an instruction to add data, the method adds data to the encoding and decoding dictionaries as an entry and assigns a valueID for the added entries. The method then adds the valueID to attribute vector(s) associated with the dictionaries. Responsive to a query for data associated with a value, the method searches for the value in an encoding dictionary, determines a valueID corresponding to the data based on a match in the encoding dictionary, uses the attribute vector to find all relevant data across all dictionaries and attribute vectors, assembles the retrieved information in a tuple, then outputs all data associated with the value.

Abstract: A dictionary data structure is described. The data structure is made up of first, second, and third tables. The first table is comprised of entries each representing a natural language term, each entry of the first table containing a term ID identifying its term. The second table is comprised of entries each representing a definition, each entry of the second containing a definition ID identifying its definition. The third table is comprised of entries each representing correspondence between a terminate definition defining the term, each entry of the third table containing term ID identifying the defined term and a definition ID identifying the defining definition. The contents of the data structure are usable to identify any definitions corresponding to a term.

Abstract: Exemplary embodiments provide various techniques for the creation and access of quota trees in a file system. In one example, a method of identifying metadata referenced by a quota tree is provided. A quota tree metafile is accessed, and this quota tree metafile includes references to locations of inode grouped data structures associated with quota trees. Here, each quota tree is allocated an inode grouped data structure. A reference to a location of an inode grouped data structure that is allocated to the quota tree is identified from the quota tree metafile. The inode grouped data structure is accessed based on the reference, and this inode grouped data structure defines a set of inode identifiers associated with the quota tree.

Abstract: An input lookup key is hashed and the hashed key divided into stride bits into a multi-level Trie structure. A compression function logically combines the stride bits to generate the compressed index bits into the stride tables. The bucket in the last stride table found by the hashed key may have several keys that collide at the same hash value. Discriminant bits are read from the key and select a stored key in the bucket table for verification of its result. Since the hashed key is a compression of the longer input key, more information is contained per bit of the hashed key than in the long key. The multi-stride lookup is performed first on the hashed key, allowing a faster convergence to the lookup result. The first stride can index a single hash table, with the remaining hash bits and discriminant bits used to select from among colliding keys.

Abstract: In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

Abstract: Method and apparatus for formatting information within a directory tree structure into an encyclopedia-like entry. The method includes performing a search by utilizing a selective one or more search methodologies including keyword search, hierarchical search, dichotomous key search, and parametric search to correlate a search criteria to a searchable database for generating one or more matching items, wherein the searchable database is formatted in the directory tree structure. The directory tree structure includes nodes comprising a collection of related data and branches comprising links between the nodes. Each matching item represents a node from within the directory tree structure. The method further includes selecting one of the matching items, formatting the collection of related data corresponding to the node of the selected matching item into an encyclopedia-like entry, and displaying the encyclopedia-like entry corresponding to the node of the selected matching item.

Abstract: Directory tree searching uses a path index to determine a set of documents tor a directory path portion of a search query. The set of documents for the directory path portion is evaluated with a set of document for an indexed term portion of the search query to determine common documents.

Abstract: Answers to search queries are identified and highlighted in search result snippets for documents containing the answers. When a user submits a search query to a search engine, the search engine may query a search index to identify a set of documents as relevant search results for the search query. Additionally, an answer data store may be queried to determine if there is a short answer to the search query. If an answer is found, the answer may be used when generating search result snippets. As such, the search result snippets for documents containing the answer may include the answer. The answer may also be highlighted in the search result snippets.

Abstract: Data for items of information are marked, stored and retrieved. A method for marking, storing and retrieving data for items of information. Markable data is received at an electronic device. The received markable data is marked using an input of the electronic device dedicated to selectively marking received markable data at the discretion of a user of the electronic device. The received marked data is stored as marked data in response to marking the received information. The stored marked data is retrieved using the electronic device. The stored marked data is obtained and presented.

Abstract: A system and method of conveying offers to a user in which at least one company is registered in a database on a first computer server and offering software is installed on a computer of the company. The offering software calculates a discount offer to be offered by the company and sends it to the first computer server, via a communication system. The method of the invention also includes installing monitoring software on a second computer server, so that the first computer server can monitor search queries of users received by the second computer server. When a search query sent by a user to the second computer server matches an offer stored on the first computer server, the matching offer is automatically sent to the second computer server via the communication system. This offer is then sent to the user who sent in the matching search query.

Abstract: The present invention pertains to a method enabling a user to process data generated by multiple separate devices, the data being stored as a data file in a directory corresponding to each device, the method comprising initiating processing of the data, the user selecting multiple data files from one or more directories corresponding to the one or more devices, to form a set of data files without actually loading any of the data files, providing the user with an option to preview one or more of the selected data files of the set on a display, and after the user has confirmed the selection of data files forming the said set, automatically loading the selected data files from the said one or more directories, and processing the data present in the selected data files to obtain a processed result.

Abstract: A device may receive a packet, determine a content identifier of the packet, identify a first processing device that has processed part of content associated with the content identifier, send the packet to the first processing device when the first processing device is identified, select a second processing device among a plurality of processing devices when the first processing device is not identified, and send the packet to the second processing device.

Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets.

Abstract: A worldwide mobile computing apparatus and database of race events indexed for mobile applications used on Smart phones, computers and computer peripherals for customers and enhanced with a proprietary news magazine, online and in print, and promoted with “AppWear” clothing and consumer goods.

Abstract: The present application discloses a method for initiating an external search from a mobile device. The method involves determining that a search term entered into a user interface on the mobile device was not found in a search of data stored on a first memory on the mobile device and requesting the external search be conducted based on the search term for data stored on a second memory, which is external to the mobile device. Other aspects include a mobile device and computer-readable medium configured for implementing the method described above.

Abstract: A method and a device for recording media are provided. The method includes performing a media recording process. During the media recording process, periodically media index information are generated according to currently written media chunks. The generated media index information is saved.

Abstract: An indexing server of a P2P network and a method therefor are provided. The indexing server comprises: a metadata storage unit, which stores one or more entries, each of which is associated with a data file and includes a plurality of information items each indicating a node offering the data file and a location of the node; and a node information managing unit, which monitors the metadata storage unit to identify an entry stored in the metadata storage unit in which the number of information items exceeds a threshold, and transfers a portion of the information items included in the identified entry to another server, the transferred portion including as many as possible such information items that indicate nodes whose locations are close to each other.

Abstract: A computer-implemented method includes receiving a selection of a particular logical field via a database query interface. The method includes querying a discovery registry associated with a data abstraction model of a database to discover one or more web services that are resolvable based on the particular logical field. The data abstraction model includes a plurality of logical fields, where each logical field corresponds to a particular data structure of the database. A web service input and a web service output of a particular discovered web service are associated with logical fields of the data abstraction model via the discovery registry. A modified database query interface includes an input assistance selectable input associated with the discovered web services. In response to a selection of the input assistance selectable input, a form input interface may be displayed that includes one or more input forms associated with the discovered web services.

Abstract: Methods and apparatus for device applet management on smart cards. A method includes obtaining device applets at a first device, generating a directory structure that identifies platform types and corresponding device applets, and storing the device applets in the directory structure on a smart card so that when the smart card is in communication with a second device supporting a selected platform, device applets associated with the selected platform are accessible to the second device. An apparatus includes a transceiver to obtain device applets at a first device, and a processor generate a directory structure that identifies platform types and corresponding device applets, and stores the device applets in the directory structure on a smart card so that when the smart card is in communication with a second device supporting a selected platform, device applets associated with the selected platform are accessible to the second device.

Abstract: This patent application relates to granular and workload driven database index defragmentation techniques. These techniques allow for defragmenting individual index ranges, performing benefit analyses to estimate the impact of defragmenting indexes or index ranges, and leveraging such benefit analyses to provide automated workload-driven recommendations of index(es) or index range(s) to defragment.

Abstract: Described herein are method and apparatus for storing data to a low-latency random read memory (LLRRM) device using non-aligned data striping, the LLRRM device being implemented on a storage system. The LLRRM device may comprise a bank comprising a plurality of memory chips, each chip being simultaneously accessible for storing data on a plurality of erase-units (EUs). A storage operating system may maintain, for each chip, a reserve data structure listing reserve EUs and a remapping data structure for tracking remappings between defective EUs to reserve EUs in the chip. A defective EU in a chip may be mapped to a reserve EU from the reserve data structure. Upon receiving a data block to be stored to the LLRRM device at the defective EU, the storage operating system may stripe the received data block across a plurality of chips in a non-aligned manner using the remapped reserve EU.

Abstract: There is provided a first dock for a portable hard disk, where the first dock is connectable to a host device. There is also provided a corresponding method for accessing content on the host device during use of the dock. It is advantageous that the host device is able to access content from portable hard disks that are docked with the first dock and a second dock.

Abstract: Methods and apparatus are disclosed for generating a result based on a lookup result from a lookup operation using an associative memory and processing based on a discriminator portion of a lookup word. A first lookup operation is performed to generate a lookup result. In one implementation, a second lookup operation is performed based on a discriminator or the lookup result depending on the result of an evaluation, such as whether there was a hit or the lookup result matches a predetermined value. In one implementation, a second lookup operation is performed based on the discriminator, and either the result of the first or second lookup operation is used for subsequent processing. One implementation performs a lookup operation based on a lookup word to generate a lookup result, which is used to retrieve a base address and a bitmap from a memory.

Abstract: A lookup table provides a longest prefix match for a search key longer than a lookup table's mapper key. The lookup table performs a multi-level search in one or more mappers for the result value based on a portion of the search key provided as the mapper key. The lookup table is searched in multiple passes with successive portions of the search key until the result value is found.

Abstract: Tools and techniques for collecting data from target systems without the need for installation of expensive and high-maintenance software agents on the target systems. In some cases, these tools can be used to collect performance data from collection targets while still allowing the operator(s) of the collection targets to govern the access of the tools, alleviating security concerns. Merely by way of example, certain tools employ data collection scripts, which may be analyzed by the collection target against security policies of that collection target, to ensure that the scripts will not take any actions that might violate such security policies. Other tools may be used to collect data in real time by transmitting a script for immediate execution by the host system, which could then return the data produced by the script immediately upon completion (and/or as part of execution of the script).

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

Abstract: A data tag descriptor method and system. The method includes generating by a device, a request for media data. The device generates a globally unique data tag specifying capabilities of the device and a transmission package comprising the request and the globally unique data tag. The device transmits the transmission package to a service provider. The service provider determines based comparing the globally unique data tag to a media tag associated with metadata describing the media data if the media data is compatible with the capabilities of the device. The device receives executable media data from the service provider. The executable media data comprises a specified form of the media data. The executable media data is generated based on results of determining if the media data is compatible with the capabilities of said device. The device executes the executable media data for a user.

Abstract: In general, the invention relates to supporting multiple different character encodings in the same file system. In one embodiment, a method is provided for filename lookup that supports multiple character encodings. The method comprises storing filename data in a first character encoding into an indexed data structure. The method further comprises receiving filename data in a second encoding. The method also comprises looking up filename data in the indexed data structure using the second encoding.

Abstract: An apparatus includes a generation unit configured to generate an address to be provided to a database, a plurality of search units, and a processing unit configured to perform a network protocol processing based on a search result, wherein the search units, including an input unit configured to input a search key, a comparison unit configured to compare data output from the database and the search key input, a setting unit configured to set a search start address and a search end address, and a monitoring unit configured to monitor matching of the generated address and the search end address.

Abstract: According to one aspect of the present disclosure a method and technique for predictive modeling of customer behavior is disclosed. The method includes receiving customer data from a plurality on non-affiliated vendor properties, anonymizing at least a portion of the received customer data and merging the anonymized customer data from each vendor property into a consortium database, and generating at least one predictive model of at least one behavior variable associated with at least one customer represented in the consortium database, the predictive model enabling identification of at least one stimuli likely to affect a desired response by the customer based on the predictive model.

Abstract: A system and method for performing non-binary comparison of biological sequences includes a new measure ?0, which is a non-binary counting measure that is used in a stand alone module called VaSSA-1. This measure obtains substantially more information about sequences and comparisons between them than is gathered by conventional bioinformatics techniques.