Abstract: In an aspect an apparatus for geometric part searching is presented. An apparatus includes at least a processor and a memory communicatively connected to the at least a processor. At least a processor is configured to generate a search index as a function of a plurality of part specification files. At least a processor is configured to receive an input part specification file. At least a processor is configured to generate a query for an input part as a function of an input part specification file and a search index. A query is configured to output a comparison of an input part specification file to a part estimation specification file. At least a processor is configured to identify a matching part estimation file from a plurality of query results.

Abstract: The present technology pertains to restoring a directory to a state prior to a past synchronization event. A content management system can present an interface including history of synchronization events for a directory, and a user can select to restore a directory to a state prior to any one of the past synchronization events.

Abstract: A computer system accesses a storage device. Contents of an object of a request are sorted. The contents of an object of a request are sorted. A hash key is generated to access information in the storage device based on the sorted contents of the object, wherein objects with non-critical differences are mapped to the same hash key. The information in the storage device is accessed based on the generated hash key to produce a response to the request. Embodiments of the present invention further include a method and program product for accessing a storage device in substantially the same manner described above.

Abstract: The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Abstract: Systems and methods are disclosed to implement, in a multi-writer database system, a database engine node that optimistically sends queued purge operations to a backend storage system without waiting for acknowledgement of previous operations from the storage system. If a conflict is later detected for a particular operation, the database engine node may retry some portion of the purge operations in the queue. In embodiments, the purge operations are performed as part of a garbage collection phase of a multi-version concurrency control (MVCC) protocol, where unneeded versions of objects previously generated for isolated snapshots are deleted. In embodiments, the operations in the queue may be grouped so that a rejection of one operation in the group will cause the entire group to be retried. Because these purge operations are idempotent and directed to objects that are invisible, they may be freely retried in arbitrary order, without maintaining any rollback state.

Abstract: Systems and methods for managing file operations over shared content in the presence of two or more heterogeneous file systems. A virtual file system provides data consistency pertaining to asynchronous interactions between the heterogeneous storage systems. Operations of the virtual file system include receiving a file system call from a first storage environment for performing one or more data operations at a second storage environment. After receiving the file system call, the virtual file system issues file system calls to the second storage environment and records a first set of metadata. To determine if and when the one or more data operations at the second storage environment have completed, the virtual file system accesses a second set of metadata from the second storage environment. The two sets of metadata are compared. If there are differences, then the virtual file system performs time delays until the two sets of metadata agree.

Abstract: Techniques are disclosed relating to probabilistic data structures. A database node may maintaining a probabilistic data structure capable of encoding database keys. The probabilistic data structure may include a plurality of levels that are each capable of storing an indication of a transition between successive characters in a database key. The database node may insert a particular database key into the probabilistic data structure and the particular database key may comprise a series of characters. The inserting may include setting, for each transition between successive characters of the series of characters, an indication in a corresponding level of the plurality of levels that is indicative of that transition. The database node may further maintain lineage information specifying one or more lineages that correspond to the transition.

Abstract: Data can be prefetched from a data storage system. For example, a computing device can receive a write request from a software application. The write request can be for writing a first data object to a storage device. The computing device can determine a second data object that is to be prefetched based on a read request for the first data object from the software application. The computing device can generate metadata for the first data object. The metadata can indicate that the second data object is to be prefeteched. The computing device can store the first data object with the metadata in the storage device.

Abstract: An illustrative embodiment disclosed herein is an apparatus including a processor having programmed instructions to update a versioned object by appending a latest version of the versioned object to a data structure, read a predetermined version identifier corresponding to the latest version from a pointer entry, and look up the latest version of the versioned object, in the data structure, using the predetermined version identifier corresponding to the latest version of the versioned object.

Abstract: A system for receiving and deduplicating data strings transmitted over a network is disclosed. The system comprises one or more network sensors detecting data strings while in transit on the network; and non-transitory memory comprising instructions. When the instructions are executed by one or more processors, the one or more processors establish a plurality of Bloom filters, receive a first data string, perform a first insertion operation into each Bloom filter; determine, for each of one or more Bloom filters, a set of bits, whether presently set or cleared, to be unset; and unset each determined set of bits in the one or more Bloom filters. At a later moment in time, the first data string is received again, and each Bloom filter is queried to determine whether the first data string has been inserted, based on a current state of that Bloom filter.

Abstract: Aspects of the technology evaluate whether a response to a client device search query results in the client device traveling to a location associated with the response (FIG. 1). One or more wireless stations are selected based on the location associated with the search query (604, 606). Wireless station identifiers are sent, along with the search results, to the client device (504, 610). The client device compares the received identifiers against the identifiers of one or more observed wireless stations with which the mobile device is in communication or are otherwise visible (508). Log information is generated by the client device as a result of the comparison (510). The log information is transmitted to the network without user ID or other client-identifiable information included in the log (512). The received log information is then used to accurately evaluate conversions and evaluate search quality, which enhances the user experience and provides for a more efficient search result process (612, 614).

Abstract: Embodiments for implementing intelligent audio composition guidance for a video by a processor. One or more acoustic characteristics used in a plurality of video segments may be identified, from a corpus, as having similar acoustic, linguistic, and visual characteristics of a selected video segment.

Abstract: An apparatus in one embodiment comprises at least one processing device comprising a processor coupled to a memory. The processing device is configured to identify a dataset to be scanned to generate a compression estimate for that dataset, to designate a scan criterion to be utilized in the scan, and for each of a plurality of pages of the dataset, to scan the page, where scanning the page includes performing a computation on the page to obtain a page result, determining whether or not the page result satisfies the designated scan criterion, and responsive to the page result satisfying the designated scan criterion, updating a corresponding entry of a compression estimate table for the dataset. The processing device generates the compression estimate for the dataset based at least in part on contents of the compression estimate table.

Abstract: The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Abstract: The described technology is generally directed towards improving indexes and queries for files by indexing file directories. According to an embodiment, a system can comprise a memory and a processor that can execute the components stored in the memory. The components can comprise a data interface to couple to a database system comprising a database storing metadata describing a file system, wherein the database comprises records that correspond to ones of directories of the file system, and wherein the records comprise a field that corresponds to files logically stored in the directories of the file system. The system can further comprise an indexing component that creates an index for the records based on an index key and an analysis of the ones of the files and the directories to which the records correspond, wherein the index comprises links between instances of the index key and ones of the directories.

Abstract: Performing quantum file concatenation is disclosed herein. In one example, a quantum file manager receives a request to concatenate a first quantum file comprising a first plurality of qubits and a second quantum file comprising a second plurality of qubits. Responsive to receiving the request, the quantum file manager concatenates the first quantum file and the second quantum file into a concatenated quantum file comprising a third plurality of qubits, wherein the third plurality of qubits comprises a same number of qubits as a union of the first plurality of qubits and the second plurality of qubits, and stores an identical sequence of data values as the first plurality of qubits followed by the second plurality of qubits.

Abstract: A computer-implemented method for extracting semantic relations is disclosed. In the method, a plurality of hierarchal structures that originates from a corpus of documents is obtained. Each hierarchal structure includes a plurality of elements having respective recitations included in a corresponding document. In the method, for each predetermined relationship between ancestor and descendant elements in the hierarchal structures, a first keyword list is extracted from the ancestor element and a second keyword list is extracted from the descendant element. A statistical index is calculated for each pair of first and second keywords using the first keyword lists and the second keyword lists. The index indicates a strength of association between the first and second keywords. In the method, a candidate list of keyword pairs having semantic relationships is output using the statistical index calculated for each pair.

Abstract: Provided are a data archiving method and apparatus capable of providing a remote near-line data archiving function by receiving remote function invoking from a target system in which data is stored, providing the target system with a first function for archiving, in a storage system, at least some of the data stored in the target system over a network in response to the remote function invoking, and providing the target system with a second function for the query of the data archived in the storage system over the network.

Abstract: A method, system and computer-usable medium for detecting headers in various documents, such as PDF and HTML files. The files are converted to a two dimensional array or table, having orthogonal rows and columns. Either rows or columns are determined to include headers. For determining if rows include headers. For each row in the array or table, pair wise comparison is performed for each cell of each column that is orthogonal to that row. The pair wise comparison scores or values are summed up for each orthogonal column to that row and the sum across for all the orthogonal columns to row provide a score or value for that row. Row scores are evaluated relative to one another to determine likelihood of headers in the row. For determining if columns have headers, similar calculation is performed between columns and their orthogonal rows.

Abstract: A computing entity storing a user profile data store and an informational content data store receives new event information corresponding to a user. The new event information is associated with a user identifier and is provided via user interaction with an interactive user interface (IUI). Using the user identifier, the computing entity identifies and accesses a user profile from the user profile data store that comprises profile information corresponding to the user. Based on the new event information and/or the profile information stored in the user profile, the computing entity prioritizes a plurality of informational content items stored in the informational content data store. Based on the prioritization of the plurality of informational content items, the computing entity selects one or more informational content items that are of high priority for the user and provides a selected informational content item for presentation to the user via the IUI.