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 method and system for improving a network search query is provided. The method includes receiving a natural language Internet search request and executing a real time search with respect to a database associated with an Internet based search for specified digital information. Categories associated with the natural language Internet search request are identified and associated intent information is received. Digital attributes data identified during the real time search are identified and an associated concept is extracted. The associated concept is mapped to the digital attributes and search based software code is generated and executed. Resulting relevant results are presented and the database is configured such that the relevant results are stored within a logical partition of the database.

Abstract: The present application relates to a data chain archiving method. The method includes: dividing an original data table in a database into partitions, and writing finished data in the partitions into a first temporary table according to a predetermined first processing mode by utilizing preset parallel threads; obtaining data with superior and subordinate association in the first temporary table by utilizing a single thread after the data is written in the first temporary table, and writing the data with the superior and subordinate association into a second temporary table; and dividing the second temporary table into preset partitions after all the data in the first temporary table is processed, archiving the data in the partitions of the second temporary table into a pre-established archive table in the database according to a predetermined second processing mode by utilizing preset parallel threads.

Abstract: Methods and system for content delivery, access, and storage are disclosed. In one aspect, an example method can comprise receiving a content item. The content item can comprise a plurality of fragments. An example method can comprise determining an identifier for each of the plurality of fragments, and generating an index file comprising the determined identifiers. An example method can comprise associating the index file with the content item. Additionally, an example method can comprise storing the content item and the index file. An example method can also comprise performing a de-duplication operation. For example, the de-duplication operation can be performed on one or more unique files to create a master file.

Abstract: A data acquisition device is accessible to correspondence information that defines correspondence between an attribute keyword indicating an attribute and a non-attribute keyword that does not indicate the attribute, and is configured to execute: specifying the attribute keyword corresponding to the non-attribute keyword when the search keyword is the non-attribute keyword with respect to each of a plurality of search keywords; assigning the search keyword to a character string in a retrieval target document corresponding to the search keyword; extracting a specific table assigned with the annotation from one or more tables; selecting at least one of a specific row and a specific column relevant to each of the plurality of search keywords from rows and columns that constitute the specific table extracted on the basis of the annotation; and acquiring a cell in the specific table specified by a first selection result.

Abstract: In an approach, a processor receives a first request to store a specific key to index pages of a database, wherein: the request indicates that the specific key is to be stored to a specific leaf page in a key-ordered chain of the index pages, and there is insufficient room in the specific leaf page to store the specific key. A processor determines at least one sibling leaf page of the specific leaf page in the key-ordered chain, the specific leaf page and the at least one sibling leaf page forming a first set. A processor determines that there is enough room in leaf pages of the first set to store existing keys in the leaf pages of the first set together with the specific key. A processor stores the existing keys in the leaf pages of the first set together with the specific key according to a redistribution policy.

Abstract: The disclosed technology relates to a system configured to identify a set of modifications based on a set of tree data structures including a sync tree, a remote tree, and a local tree. The sync tree represents a known synced state between a server state and a file system state, the remote tree represents the server state, and the local tree represents the file system state. The system is further configured to select a set of unblocked modifications from the set of modifications based on whether each modification has a dependency and execute, based on the set of unblocked modifications, a set of tasks configured to converge the server state and the file system state.

Abstract: Systems, methods, and devices for storing database data in journal tables comprising a snapshot and a log table. A method includes defining a journal table comprising a snapshot and a log table, the snapshot comprising an up-to-date representation of data in the journal table at a point in time. The method includes assigning a timestamp to the snapshot indicating when the snapshot was generated. The method includes receiving a request to execute a transaction on the journal table to modify the data in the journal table, the transaction comprising one or more of an insert, a delete, an update, or a merge. The method includes inserting a new row into the log table in lieu of executing the transaction on the snapshot of the journal table, the new row comprising an indication of a change requested to be made to the journal table based on the transaction.

Abstract: A system includes reception of a first query including a first temporary materialized view, where the first temporary materialized view associated with a first view and a first temporary table. The first temporary table is refreshed if it is determined that the first temporary materialized view is stale, and the first query is executed using a result set cached in the first temporary table. The first temporary table caches the result set for the remainder of the current database session.

Abstract: According to an aspect, a method for data placement in a distributed database includes obtaining access pattern information relating to end clients that requested access to data stored in a first regional quorum of replicas located within a first region, where the first regional quorum includes a first lead replica. The method includes identifying a placement algorithm from a configuration file associated with the distributed database, and executing the placement algorithm to generate a suggested placement for the data based on the obtained access pattern information, where the suggested placement includes a second regional quorum of replicas located in a second region different than the first region, and the second regional quorum includes a second lead replica. The method includes transmitting a migration request to the distributed database to transfer the data from the first regional quorum to the second regional quorum.

Abstract: A computer readable storage device includes a first memory section that stores operational instructions that, when executed, cause a computing device to, as data accesses occur for a plurality of data objects of a storage container, update object values to produce updated object values, update object retention costs to produce updated object retention costs, adjust a dynamic retention threshold based on the updated object values and the updated object retention costs and update a data object retention policy for a data object based on the dynamic retention threshold to produce an updated retention policy for the data object. The computer readable storage device includes a second memory section that stores operational instructions that, when executed, cause the computing device to, when a data access is a deletion request, utilizing a current updated data object retention policy to determine and execute a deletion-retention option for the data object.

Abstract: Methods and systems for organizing media. The systems and methods described herein organize media items based on metadata and unique media item content attributes. If a media item satisfies one or more criteria, the media item is transferred to an album to be shared with authorized users.

Abstract: A system includes reception of a query to update a partition key value of a first set of rows of a database table, determination, based on fetched row identifiers, of a first subset of the first rows which are not stored on the first database server node and a second subset of the first rows which are stored on the first database server node, fetching of the first subset of rows from the database server nodes, update of the partition key value of each row of the fetched first subset of rows, instructing of the first database server node to: store the updated rows of the fetched first subset in the first partition stored on the first database server node, and update the partition key value of each of the second subset of rows of the partition stored on the first database server node.

Abstract: This application belongs to the field of database application technologies, and discloses a data scrubbing method and apparatus. In the method, a server adds a share update exclusive lock to a target table, to prevent a system from performing a data definition language (DDL) operation on the target table. The server then creates a temporary table and a temporary index, copies data from the target table to the temporary table, and generates index information according to the data in the temporary table. Next, the server adds an access exclusive lock to the target table to prevent the system from performing a data manipulation language (DML) operation on the target table. Then data in the target table and the temporary table as well as corresponding index information is exchanged, thereby completing cleaning and reclaiming of disk space.

Abstract: A method for data generation performed by a computer includes: executing a collation process that includes acquiring reference source data representing a first axis and reference destination data representing a second axis and having a graph structure including a node and an edge, and collating a node of the reference destination data using a value of the acquired reference source data; executing a identification process that includes identifying a second node representing a kind of a first node sharing a first edge between a plurality of collation nodes collated by the collation process, and identifying a third node representing a definition of a domain of the first edge between the first node and the collation nodes; and executing a join process that includes associating the reference source data with the reference destination data based on the second node and the third node.

Abstract: A system and method include receiving, by a troubleshooting system of a virtual computing system, a search query for troubleshooting a problem associated with a component of the virtual computing system. The search query is received via a troubleshooting interface of the troubleshooting system. The system and method also include parsing the search query, including associating a troubleshooting category with the parsed search query, determining possible causes of the problem from the troubleshooting category, and ranking the possible causes based on a pre-determined criteria. The system and method additionally include displaying a subset of highest ranked possible causes of the problem on the troubleshooting interface.

Abstract: A method for extending a tag of an information resource in an information network may be provided. The method may include providing a group of tags, stored in a database, in a user interface, and selecting at least one tag out of the group of tags and linking the tag to an information resource using the user interface. Furthermore, the method may include extending the tag, such that the resulting extended tag may be a semantically structured string of characters building a first expression including a first operand, a first operator and a first value, wherein the tag may be the operand, such that the extended tag is machine-interpretable by a parser, such that the information resource may be tagged with the machine-interpretable, extended tag.

Abstract: A computer program product, system, and computer implemented method for automatic maintenance of standby databases for non-logged workloads, the process comprising: maintaining a redo stream of redo records sent from a primary database to a standby database, identifying a change made at the primary database for which a redo record was not created, inserting a placeholder redo record into the redo stream corresponding to the change identified at the primary database for which the redo record was not created, sending, to the standby database, a copy of one or more data blocks corresponding to the change that is associated with the placeholder redo record, receiving the placeholder redo record from the redo stream, identifying the copy of the one or more data blocks sent from the primary database corresponding to the placeholder redo record, and applying the copy of one or more data blocks to update the standby database.

Abstract: Embodiments relate to efficiently performing an inner join on segments from a data source, where the segments have wildcards in join columns. An algorithm for an inner segment join operator may build a location map that describes locations, by segment and column, of values in the join columns of rows in the segments. A map of wildcard locations, by segment and column, may also be constructed. The location map may be supplemented with information from the wildcard map. The data source is scanned and contents of rows in the data source are queried against the location map to join rows with segments that match due to either matching values or wildcard presence. A user interface may be provided to facilitate construction of joins using the inner segment join operator.

Abstract: A Searchable Application Representation is generated with the exact structure, content, functionality, and behavior of the Native Mobile Applications and is searchable by Search Engines by providing metadata pointing to the Native Mobile Applications. The Search Engine searches the Searchable Application Representation. When the Search Engine finds the Searchable Application Representation, Pointer, Metadata and Search Material to Corresponding Native Mobile Application on the Internet, the Search Engine becomes aware of the Native Mobile Application and can search the Content contained in the Searchable Application Representation. The Search Engine finds and ranks Content in the Searchable Representation and Pointer, Metadata, and Search Material corresponding to such Content in the Native Mobile Application is passed to the Search Engine, which can use such information to determine the relevancy of such Content according to a certain Search Criteria.