Abstract: Some examples describe a method for using location addressed storage as content addressed storage (CAS). A checksum of a file may be generated during transition of the file to a retained state. The generated checksum, which may represent a content address of the file, may be stored in a database. The database may be queried with the content address of the file to retrieve a location address of the file corresponding to the content address of the file. The location address of the file is used to provide access to the file in the file system.

Abstract: System, method and apparatus are provided for creating and managing programmable rules on containers for collections of data items presented through the operating environment. This invention gives a container (folders or enhanced containers) the ability to be more than a straight-forward receptacle to contain a collection of data objects and other sub-containers. The invention provides for adding a data item into a container system, collecting information from the data item and any pre-existing metadata, matching the information to a container using the container's rules, and if any matching containers are found, filing of the data item proceeds into any candidate locations.

Abstract: A computer-implemented database system as described herein includes a memory device and one or more processors coupled with the memory device. The one or more processors are configurable to create and maintain a folder structure for a user interface (UI) environment, wherein the folder structure includes: a feature folder that defines an application feature supported by the UI environment, the application feature having a UI component associated therewith, and the UI component having a UI text string associated therewith; a component folder located in the feature folder, the component folder having computer readable files that define the UI component; and a text string file located in the component folder, wherein the text string file defines content of the UI text string.

Abstract: A computer data file that is operational or accessible in two or more different forms by two or more different common, ubiquitous and/or native programs or applications is presented herein. More specifically, the computer data file can be accessed in a first form when the computer data file has a first filename extension, and the computer file can be accessed in a second form when the computer data file has a second and different filename extension. At least one of the filename extensions is a browser-based filename extension (.HTM, .HTML) such that the composite file is accessed via a web browser in one of the modes.

Abstract: Provided are a system and method for semantic generation and enrichment. In one example, the method includes displaying a plurality of tiles on a user interface, each displayed tile visually representing a data entity obtained from a data file, detecting, via the user interface, a selection of a first displayed tile visually representing a first data entity and a second displayed tile visually representing a second data entity, and in response to detecting the selection via the user interface, generating a new data entity based on the first data entity visually represented by the first displayed tile and the second data entity visually represented by the second tile, and displaying a new tile visually representing the newly generated data entity. Accordingly, an end user can provide semantic creation and enrichment to visually displayed data without the need for an administrator.

Abstract: A method for migrating a file in a storage device. The storage device obtains a snapshot of metadata of the file. The snapshot includes logical addresses of data blocks of the file and first write time points of the data blocks. The storage device identifies a logical address of a target data block and a first write time point of the target data block. Then, the storage device obtains a second write time point from the metadata of the file. The second write time point indicates a latest time point of writing the target data block into the storage device. If the first write time point of the target data block is identical to the second write time point, the storage device migrates the target data block to pre-allocated continuous storage space. Thereby, disk defragmentation can be achieved.

Abstract: In embodiments, secure compression algorithms are provided that may be employed as a single operation on raw data to produce compressed and encrypted data. In embodiments, the algorithms described herein may be performed using any type of dictionary based encryption. In one embodiment, upon adding a new prefix to a dictionary table, the dictionary table may be permuted to randomize the entries into the table. The randomization may be based upon a permutation value generated by a deterministic pseudo-random generator and/or pseudo-random function. Other embodiments of randomization may be employed to provide secure compression. For example, instead of permuting the entire table upon adding a prefix, the prefix may be randomly added to the table.

Abstract: A method for generating a segmented blockchain includes: storing a first blockchain, the blockchain being comprised of blocks including a recent block, the recent block including a corresponding block header and transaction values; generating a recent hash value via hashing the corresponding block header; writing a terminal block to the first blockchain, the terminal block including a terminal block header comprised of the recent hash value, an activated terminal flag, and a forward reference identifier; generating a terminal hash value via hashing the terminal block header; generating a second blockchain, the second blockchain being comprised of a starting block, the starting blocking including a starting block header comprised of the terminal hash value and an activated starting flag; and transmitting the terminal block and the second blockchain to one or more computing devices associated with the first blockchain.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a hybrid model of fine-grained locking and data-partitioning wherein fine-grained locking is added to existing systems that are based on hierarchical data-partitioning in order in increase parallelism with minimal code re-write.

Abstract: A system and method for obtaining a request to perform a data operation with a volume, wherein the volume is a logical storage space in which data objects may be stored, determining a plurality of zones for performing the data operation with the volume, wherein each zone of the plurality of zones comprises a series of sectors of a computer-readable storage medium that forms an append-only section of the computer-readable storage medium, and performing the data operation with the volume on the plurality of zones.

Abstract: Transmitting filesystem changes over a network is disclosed. A hash of data comprising a chunk of directory elements comprising one or more consecutive directory elements in a set of elements sorted in a canonical order is computed at a client system. One or more directory elements comprising the chunk are sent to a remote server in the event it is determined based at least in part on the computed hash that corresponding directory elements as stored on the remote server are not identical to the directory elements comprising the chunk as stored on the client system.

Abstract: A file may be identified and a plurality of rules associated with a plurality of storage servers may be received. An order for the rules may be identified. A particular storage server of the plurality of storage servers that satisfies a condition for each of the rules in view of the order for the rules and a characteristic associated with each of the plurality of storage servers. The file may be stored at the particular storage server that satisfies the condition for each of the rules.

Abstract: Exemplary methods, apparatuses, and systems include a controller node receiving a request to perform a consistency check of a distributed file system. The controller node transmits, to each of a plurality of nodes, a request for the node to use logical metadata of the distributed file system owned by the node to construct an expected copy of physical metadata mapped to the logical metadata, determine which of the plurality of nodes own actual portions of the physical metadata, transmit corresponding portions of the expected copy of the physical metadata to each of the nodes determined to own actual portions of the physical metadata, and compare expected copies of the physical metadata received from other nodes to the actual physical metadata owned by the node. The controller node receives a result of the comparison from each of the nodes, aggregates the received results, and generates an error report.

Abstract: A method, article of manufacture, and apparatus for providing a site cache in a distributed file system is discussed. Data objects may be written to a site cache prior to writing them to an authoritative object store. This provides performance benefits when a client writing the data has a better connection to the site cache than to the authoritative object store.

Abstract: A management system displays two or more columns lined up in accordance with a sequence order of a selected display rule. Each display rule is a customized rule, and includes a first type, one or more second types, and a sequence order of display for two or more columns respectively corresponding to the first type and the one or more second types. In a first column, which corresponds to a selection type, one or more objects is displayed respectively corresponding to a one or more elements, and in each of a one or more second columns, an object is displayed which belongs to a type corresponding to the second column, and corresponds to an element that is topologically related to at least one of the one or more selected elements.

Abstract: Techniques for enabling fail-safe operations of storage devices are described. A device may be configured to delete an inode in a failsafe manner. A device may be configured to mark directory entries as not in use and ensure this goes to disk before anything else. A device may be configured to create an inode in a failsafe manner. A device may be configured to allocate and initialize a cluster and ensure this is written to disk before anything else. In this manner, a volume may be in a predictable state upon a failure occurring.

Abstract: A computer-implemented method according to one embodiment includes identifying an accessing of a file within an operating system, checking an in-memory cache for path information associated with the file, checking an external cache for the path information associated with the file, conditionally retrieving the path information associated with the file by performing a file system lookup and adding the path information associated with the file to the in-memory cache and the external cache, returning the path information, and reorganizing the external cache to put file information that is frequently accessed together in a single block or adjacent blocks.

Abstract: A data mapping system provides a share, reusable and single mapping tool for mapping data and data lineage. The mapping system provides a version control functionality in the form of spreadsheet for tracking a plurality of mapping tasks that occur in parallel. The system allows multiple users to view the changes in mapping tasks, thereby improving data mapping visibility. Such visibility can significantly reduce conflicts between different mapping tasks that are independently performed by different teams or persons.

Abstract: Distributed locks (e.g., among a plurality of database management services) can be used for accessing a database to ensure data consistency in the database during concurrent continuous data processing and schema or data administration of the database. An exclusive lock of the database may not be held for all operations of an extract, transform, load (ETL) process to load data from a data source into the database. Schema changes that occur to a database schema of the database in the middle of the ETL process when the exclusive lock is not held can be resolved.

Abstract: Embodiments are directed to efficiently migrating data from one version of a service to another version and to temporarily transitioning a user to a different service for evaluation. A computer system pre-transfers user data from a first service to a second, different service before an indication is received that the user is to be transitioned from the first service to the second service. The user data includes identification information identifying users of the first service. The computer system receives an indication that a first service user is to be transitioned to the second service. The computer system transfers service data used by the first service to the second service and synchronizes any changes in the user data that occurred between the user data pre-transfer and the service data transfer, so that the second service is provided using the transferred service data and the synchronized user data.

Abstract: The disclosed embodiments include computerized methods and systems that facilitate automated detection and precision correction of aggregated data collected by multiple, geographically dispersed mobile communications devices. In one embodiment, an apparatus detect a data outlier within portions of the aggregated data having numerical and/or categorical values. The apparatus may transmit information identifying the data outliner and a portion of the aggregated data that includes the data outlier to an additional communications device, which may present the aggregated data portion to a user in a manner that visually distinguishes the data outlined from other elements of aggregated data. In response to a request from the additional communications device, the apparatus may modify portions of the aggregated data in an effort to mitigate the data outlier.

Abstract: An example storage system may include storage media and a storage controller. The storage controller may be to establish virtual volumes, private data stores, and a deduplication data store, each being a virtual storage space of the storage media, wherein each of the private data stores is associated with one of the virtual volumes and the deduplication data store is shared among the virtual volumes. The storage controller may, in response to receiving input data that is to be stored in a given one of the virtual volumes, determine a signature for the input data and select between storing the input data in the private data store associated with the given one of the virtual volumes and storing the input data in the deduplication data store.

Abstract: Methods, systems, and apparatus for obtaining one or more metadata files, determining, by one or more computers and in accordance with a minor compaction setting, to perform a minor compaction of the one or more metadata files, creating one or more intermediate metadata files that each include at least compacted contacts of one or more of the metadata files, according to the determination to perform minor compaction of the one or more metadata files, determining, in accordance with a major compaction setting, to perform a major compaction of one or more of the intermediate metadata files, and creating one or more snapshot metadata files that each include at least compacted contents of one or more of the intermediate metadata files, according to the determination to perform the major compaction of one or more of the intermediate metadata files.

Abstract: A method and system allow for creation and delivery of dynamic communications. The method and system implement software applications allowing content authors to generate dynamic data and scripts. In addition, other software applications allow users to request the generation of dynamic data. These requests are transmitted to a server application, which generates content based on the request sent by users, as well as the dynamic data and scripts stored by content authors. The generated content is then supplied to the user application for display, printing, or other use by the user.

Abstract: A system includes a first and a second storage device and a computing device. A set of partitions includes a first subset of partitions and a second subset of partitions. The first storage device stores the first subset of partitions. The second storage device stores the second subset of partitions. The computing device is configured to execute an iterative update of a selected partition until a fully updated partition is generated. The updated partition generated in a current iteration is used as a selected partition in the next iteration, and a not yet updated partition is updated in every next following iteration.

Abstract: The present teaching relates to associating data from different sources to generate a person-centric space. In one example, information related to a person is received. First data is obtained from a first source private to the person based on the information. One or more types of cross-linking keys are identified from the first data. Second data is obtained from at least one second source based on the one or more types of cross-linking keys. The first data is associated with at least a portion of the second data based, at least in part, on the one or more types of cross-linking keys to generate cross-linked data. The person-centric space is generated based on the cross-linked data.

Abstract: A multi-user operational cascade computer network includes an initiating computer and a plurality of user computers comprising a first user computer and an Nth user computer. A first data label is issued and transmitted by an originating computer. A first operation corresponding to a first task is executed by each user computer to generate and then store the execution data and generate an index. The first task is simultaneously cascaded. The subsequent user computers continue to generate nested datatags, so as to realize the function of each terminal to record the communications between the terminals in the specific application. The operation behavior of each user are recorded and reflected for the specific application, which facilitate follow-up data analyses and management, and big data applications. The disclosed multi-user operational cascade computer network and construction methods have a simple network structure, low application cost, and extensive range of applications.

Abstract: A plus-minus-one array in which adjacent entries vary by no more than positive one and no less than negative one is accessed. A range minimum query directory tree including blocks and subblocks of the plus-minus-one array is determined. Blocks are contained in the plus-minus-one array and subblocks are contained in the blocks. A data structure characterizing positions of minimum elements within the range minimum query directory tree is generated. The characterization includes positions of minimums within each subblock, between subblocks in a respective block, within each block, and between blocks. The data structure is stored. Related apparatus, systems, techniques and articles are also described.

Abstract: A hierarchical data storage and retrieval index uses copy-on-write of a block ancestor path to allow concurrent multi-version read access and single writers, while providing a garbage collector that allows quick recycling of the copied blocks. A further layered tree index uses a copy-on-write concurrent multi-version meta tree above a layer of lock-protected blocks to provide multi-reader multi-writer access. Both indexes are efficient with multiple cores.

Abstract: A multi-token matching scheme efficiently detects multi-token keyword matches in content received by a database system. A keyword list may include multi-token keywords. Head tokens from the multi-token keywords are converted into a head hashmap. Token chains identifying tokens and delimiters in the multi-token keywords are generated and linked to the head hashmap. Tokens in the content are compared with the head hashmap. The matching tokens and following segments in the content are compared with the token chains. Portions of the content matching the token chains are identified as keyword matches. The matching scheme may use reverse delimiter tries to detect content matches for multi-token keywords with leading delimiters.

Abstract: A quick hardware inventory of a software-defined data center (SDDC) multi-rack is created. A hardware management server (HMS) receives an imaging of a first rack and performs a node hash of attributes of the imaging of the first rack. A hash database is then checked for an inventory hash that matches the node hash of the first rack. If a match is found, a rack inventory is loaded from a persistent rack data inventory correlated with the inventory hash instead of the HMS performing a discovery and inventory of the first rack. In addition, a sensor error log of the first rack is checked for any errors and the rack inventory is modified based on any errors in the sensor error log. The rack inventory is then saved into the server switch object cache of the HMS. The steps are repeated by the HMS for each additional rack.

Abstract: A system and method for providing database replay are disclosed. In one embodiment, the system detects a trigger; obtains updated data from a read-only table; stores the updated data in a modifiable table; retrieves a modification history including a comprehensive and persistent record of the changes made to one or more earlier versions of the modifiable table; and applies the modifications indicated in the modification history to the updated data stored in the modifiable table.

Abstract: A storage system and method of operating the storage system is described where the metadata used to access the data stored in a storage device is distributed amongst a plurality of controllers in communication with a user, with each other and with the storage device. Each controller stores at least the metadata needed to access the data relevant to the user at the time, and metadata is updated to respond to internal system activities such as device failures, snapshots, backup operations or the like. To preserve coherence of the metadata, each metadata update is communicated to the other controllers and the storage device. The update is either transmitted to the other controllers and to the storage device and each metadata location is updated, or the update is transmitted to the storage device and each of the controllers is instructed to request an update from the storage device.

Abstract: A non-transitory computer-readable storage medium storing a database control program that causes a computer to execute a process, the process including when an update processing for a value of a data item included in a record stored in a database occurs, generating a first record and a second record, the first record including the data item having a value updated by the update processing, the second record including the data item having a value not updated by the update processing, and when a new update processing occurs for the record for which the update processing occurred, performing the new update processing for both of the first record and the second record.

Abstract: A system includes processing nodes and shared memory. Each processing node includes a processor and local memory. The local memory of each processing node stores at least a partial copy of the immutable data stage of a dataset. The shared memory is accessible by each processing node and stores a sole copy of the mutable data stage of the dataset and a master copy of the immutable data stage of a dataset.

Abstract: Key values can be defined at design time (e.g. in a DTTI object) using character strings that include wildcard characters that define multi-dimensional key ranges. Wildcard characters can designate that a single variable character is to be inserted or that a range from zero to multiple characters can be inserted. The use of wildcards can make checks for key intersection non-trivial. During run time, the key values to be accessed from one or more tables are evaluated, and the operation proceeds. An error can occur if the presence of one or more wildcards in two key value strings used in an aggregation operation result in an overlap such that a same record is included more than once.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.

Abstract: Various embodiments are generally directed to an apparatus, method and other techniques to receiving a sequence of transactions, each transaction including a request to write data to a memory device, processing the sequence of transactions, and communicating a response to a host after the sequence of transaction have been completed.

Abstract: Provided is a data sharing method based on a plurality of blockchains. The method includes registering, by a management server, user block data which includes user information and a hash key of each user of a plurality of users in a user information blockchain, receiving, by the management server, storage information of data provided by a first user from a storage server, and receiving, by the management server, a request for specific data from a second user and transmitting storage information of the specific data to the second user.

Abstract: Performing a user initiated search query is disclosed and comprises receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, constructing a tree data structure based on the description details of the plurality of objects, the tree data structure comprising one or more attributes related to each of the plurality of objects retrieved, displaying visual images associated with the retrieved plurality of objects, the visual images matching at least one of the attributes related to the plurality of objects, and receiving a user selection of one or more of the visual images.

Abstract: A method and associated system for selectively constructing a search result for a data requested by a search request specifying path information of a data node comprising the data. A template tree represents a hierarchy of the search result with expandable nodes which initially do not have actual data. A node of the template tree is dynamically expanded by a callback function to have a respective data for the node when the node is traversed for the first time during traversing the template tree according to the path information. The search result is created by expanding all nodes of the template tree that are specified in the path information. The data node in the search result is communicated to an entity that had originated the search request.

Abstract: In one embodiment, a method includes receiving a query comprising one or more n-grams, generating a plurality of query commands based on a parsing of the query input, wherein each query command comprises a plurality of query constraints, scoring the plurality of query commands based at least in part on a number of objects matching each of the query constraints of the respective query command, selecting a first query command based at least in part on the respective scores of the query commands, wherein the first query command comprises an inverse constraint corresponding to a first query constraint that has previously been flagged as identifying greater than a threshold number of objects and one or more second query constraints, and executing the first query command to identify a plurality of objects matching the inverse constraint and the one or more second query constraints.

Abstract: In some example embodiments, a graphical user interface (GUI) is caused to be displayed on a computing device of a user. The GUI can be configured to enable the user to submit an identification of a dataset and at least one configuration parameter. The identification of the data source and the at least one configuration parameter can be received via the GUI on the computing device. A sampling algorithm can be configured based on the at least one configuration parameter. A sample of data from the dataset can be generated using the configured sampling algorithm. The time parameter can limit an execution time of the generating of the sample of data to within a maximum amount of time indicated by the user.

Abstract: Systems and methods are provided for improved time series databases and time series operations. A time series service responds to requests from external devices. The external devices request time series data and submit time series queries. The time series service generates planned and efficient time series queries from the initial queries. The time series service performs operations such as unit conversion, interpolation, and performing operations on time series data. The time series service can identify which time series database to query from and/or cause data to be populated into a time series database from a data pipeline system.

Abstract: An automatic service monitor in an information-technology environment performs regular search queries against generated machine data to derive performance measurements. The information technology environment is defined in terms of services provided by entities, and the performance measurements are defined as key performance indicators (KPIs) of the services. Generated machine data used by the search queries pertain to the entities performing the service. Definitional information for the services, entities, and KPIs is administered by a user to control the operation of the service monitor. Various aspects of such definitional information as well as related performance measurement information may be presented in a unified console display tailored to, and organized around, a particular entity. The console display may serve as a central launch point by supporting user interaction to navigate to other specialized monitoring interfaces.

Abstract: The cost of data-mining is estimated where data-mining services are delivered via a distributed computing system environment. System requirements are estimated for a particular data-mining task for an input data set having specified properties. Estimating system requirements includes applying a partial learning tool to operate on sample data from the input data set.

Abstract: A database management system (DBMS) generates a query execution plan including information representing one or more database (DB) operations necessary for executing a query and executes the query based on the query execution plan. In the execution of the query, the DBMS dynamically generates a task for executing a DB operation and executes the dynamically generated task. The DBMS executes a task in a plurality of threads executed by a processor core.

Abstract: An analytic is deployed at the task driver, and the analytic performs one or more functions. At the task driver, an execution plan for the analytic is determined based at least in part upon an analysis of the functions. The execution plan determines a location for execution of each of the functions, and the location is one of the computational node or the data node. The functions are executed according to the execution plan.

Abstract: A query identifier is generated for a query received in a database. The received query identifier is matched with query identifiers stored in a dynamic table. It is determined whether an execution plan is available based on matching the query identifiers in the dynamic table. For the matching query identifier, it is determined whether dynamic search criteria are met. Upon determining that the dynamic search criteria are met, a memory address corresponding to the query identifier is retrieved from the dynamic table. Based on the available diagonal search execution plan, the dynamic diagonal search is performed in the table from the memory address to retrieve search result. The dynamic diagonal search involves incrementing a data pointer to access the memory address in a diagonal manner in the table.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes one or more processes for providing the graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system receives a query containing a missing value parameter, wherein the missing value parameter designates an attribute in the graph database with a nonexistent value. The system then produces, from the query, a transformed query comprising one or more parameters that do not include the missing value parameter. Finally, the system uses the transformed query and the graph database to generate a result of the query and provides the result in a response to the query.