Abstract: A method and system for implementing enhanced indexing in a backup system as well as manage file recovery. The method implemented at a backup server receives a filename from a client to be retrieved from a backup system and queries the filename on a directory records database. As a query return, a directory record is received including a savetime identifying a backup instance and an inode of a directory for the filename of the requested file. The process then queries the inode on a node records database and receives at least one node record where the node record has the inode of the directory record as a parent.

Abstract: Machines, systems and methods for optimizing data replication in a distributed storage network, the method comprising determining a need to create a replica for a data item in a remote failure zone in a data storage network; creating a temporary replica of the data item in a local failure zone defined in the data storage network, in response to determining that it is beneficial to create the temporary replica in the local failure zone based on a cost versus reliability improvement analysis; attempting to create the replica in the remote failure zone; and removing the temporary replica from the local failure zone, in response to successfully creating the replica in the remote failure zone.

Abstract: Methods and arrangements for predictively placing columns of a large database in a multi-tier storage system. Aspects include receiving a database to be stored in the multi-tier storage system, wherein the database comprises a plurality of columns and the multi-tier storage system comprises at least two storage devices and evaluating one or more attributes of each of the plurality of columns of the database. Aspects also include storing each of the plurality of columns of the database on one of the at least two storage devices, wherein a determination of which of the at least two storage devices to store each of the plurality of columns is based on the one or more attributes of each of the columns, a predictive model based on the weighted columnar relationship graph, and the characteristics of the storage devices.

Abstract: Some embodiments can factorize input data into a sequence of elements. Next, for at least one element in the sequence of elements, the embodiments can identify one or more prime data elements and determine a reconstitution program based on the element and the one or more prime data elements. The embodiments can then use the one or more prime data elements and the reconstitution program to generate a losslessly reduced representation of the element, and store the losslessly reduced representation of the element at a storage location. Next, in response to determining that a keyword is present in the element, the embodiments can (i) create a link that associates the keyword with the storage location, and (ii) store the link in the keyword index. The link can additionally associate the keyword with an offset where the keyword occurs in the element.

Abstract: A method, system, and/or computer program product manages content tags of electronic postings. A first weighted tag is received from a first reader of an electronic posting that supports tagging by non-authors. The first weighted tag, which includes a first weight, comprises metadata that describes the electronic posting. A second weighted tag, which includes a second weight, is received from a second reader of the electronic posting. The first and second weights are summed to generate a summed weight of the first and second weighted tags. In response to the summed weight of the first and second weighted tags being less than a predefined value, the metadata is automatically prohibited from being displayed with the electronic posting.

Abstract: A method, system, and/or computer program product manages content tags of electronic postings. A first weighted tag is received from a first reader of an electronic posting that supports tagging by non-authors. The first weighted tag, which includes a first weight, comprises metadata that describes the electronic posting. A second weighted tag, which includes a second weight, is received from a second reader of the electronic posting. The first and second weights are summed to generate a summed weight of the first and second weighted tags. In response to the summed weight of the first and second weighted tags being less than a predefined value, the metadata is automatically prohibited from being displayed with the electronic posting.

Abstract: Query formation and modification techniques are described. In one or more embodiments, a query is received that is formed in a text field as a phrase in a human-readable language that includes a visual indicator that represents a missing term that is a subject of the query. Based on the query, a defined database is searched, and one or more modified versions of the phrase are presented that replace the visual indicator with a respective result of the searching. In addition, one or more options are presented that are selectable to automatically complete the phrase as a sentence in the human-readable language.

Abstract: A system and method for searching indexed content data using multiple proximity keyword searches to quickly and efficiently locate subsets of data that are either relevant or irrelevant to an issue of interest to a user.

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: A method and system for implementing enhanced indexing in a backup system as well as manage file recovery. The method implemented at a backup server receives backup meta data from a client over a network. The backup meta data is checked to determine whether the backup meta data is directory data or node data and the directory data and node data from the received backup meta data is committed to a set of databases as received during the backup process.

Abstract: A query of time series data stored in a database is received that specifies at least one value. The database includes (i) an index table specifying groups of segments of compressed time series data with corresponding ranges each having a lowest value and a highest value, and (ii) a segments table specifying individual segments of compressed time series data. Thereafter, using the index table, at least one group for which the specified at least one value falls within the corresponding range is identified. The segments table is then queried for the segments corresponding to the identified at least one group to generate a new segments table specifying at least one segment. Next, the at least one segment specified by the new segments table is decompressed. Data responsive to the query within the decompressed at least one segment is then identified using the specified at least one value.

Abstract: A query collector may be configured to receive a plurality of queries applied by a search engine to obtain corresponding search results. A graph manager may be configured to generate, based on the plurality of queries, a directed graph of nodes, each node corresponding to at least one query and connected to another node, and further configured to merge at least two of the nodes based on a similarity of corresponding queries thereof, to obtain a merged node, and generate at least one representative query representing the merged node. A suggestion generator may be configured to match a current query with a matching node of the nodes, determine that the merged node is a successor node of the matching node within the directed graph, and provide the at least one representative query as a suggested query for a future search to be conducted by the search engine.

Abstract: A suite of network-based services, such as the services corresponding to the server application distributed by Microsoft® SharePoint™, may be provided to users with high availability. The suite of network-based services may include browser-based collaboration functions, process management functions, index and search functions, document-management functions, help and help search functions, and/or other functions. A plurality of computing devices functioning as servers may be backed up by a single computing device.

Abstract: Methods and systems for detecting a likelihood that a travel path is a correct travel path of a user using possible duplicate travel path information. A set of travel paths comprising at least two travel paths is obtained. Any paths that break up more than one reservation are removed. Each travel path is broken into at least one leg. Each leg in each travel path is compared to each leg in every other travel path to determine whether any travel paths are duplicates. A likelihood that each of the at least two travel paths is the correct travel path is determined using information about whether any of the at least two travel paths are duplicates.

Abstract: Provided are techniques for locating a row. A page filter in a page is stored, wherein the page filter is associated with a collision chain and includes a portion of a hash value of the row in the collision chain that has overflowed to an overflow area. In response to a request to locate a target row, the page filter is used to determine that the row has overflowed based on a portion of a hash value of the target row matching the portion of the hash value of the row that has overflowed.

Abstract: A hierarchical compression tester and associated method employs a grid-based storage capacity wherein a storage unit is defined by a grouping of data blocks. Each data block is stored in one of a plurality of storage devices. Each stored data block has a data portion and a data integrity field (DIF) including a data reliability qualifier (DRQ) indicating whether the respective data portion is valid. The tester also has a logical device allocation map that includes a storage unit descriptor array that identifies one or more storage units corresponding to a selected logical address. The logical device allocation map has a DIF array that identifies whether any of the data blocks in the one or more storage units corresponding to the selected logical address includes invalid data.

Abstract: At least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above.

Abstract: Embodiments relate to systems and methods for the enforcement of security profiles in a multi-tenant database. A multi-tenant database can be populated with data from different users or other entities. Different users may enjoy different sets of permissions to access, modify, store, and/or otherwise manipulate sets of data within the database. After authentication, a user's associated set of permissions are retrieved. When data is requested, matching tables or other objects located in the database are identified based on the user's query. Rather than retrieving matching tables or other objects directly, a meta data security engine can check the requesting user's permissions, and apply any filters or restrictions required by those permissions to the data present in the table(s). A substitution can be made of a table-valued function, including any filtered data entries, for the table itself. Flexible and granular data security rules can thereby be applied, transparently to the user.

Abstract: Systems and methods for hierarchical reference counting via sibling trees are provided. The hierarchical data structure, together with its associated operations, can efficiently maintain reference counts and significantly reduce input/output (IO) operations compared to traditional techniques. The data structure presented here is applicable to any directed acyclic graph (DAG-type) structure where reference counts are used. Various embodiments of the present invention use a data structure to maintain a “sibling pointer” (pointing to the sibling node as a way to avoid reference count updates) and a “sibling count.” When nodes in the tree diverge, the sibling pointer and sibling count are updated as opposed to directly manipulating the reference counts of the children of the diverging nodes. Various other embodiments can use additional entries or fields that allow for improved efficiency and advantages.

Abstract: Embodiments of the invention relate to database large object (LOB) reorganization. An aspect of the invention includes calculating an activity of an inline LOB. The length of an inline LOB is redefined according to the activity of the inline LOB. LOB reorganization is performed based on the redefined length of the inline LOB.