Abstract: Technology is described that includes a method of feature specification via semantic queries. The method can include the operation of obtaining a data set having an identifier for each data row and a plurality of data features for each data row. A semantic query can be received that can be applied to the dataset that is usable by a machine learning tool. A entity feature map can be supplied that has entities and associated features for use by the machine learning tool. Further, a query structure can be analyzed using the entity feature map to identify input from the dataset for the machine learning tool.

Abstract: Described are techniques to facilitate temporal features in a semantic data store. Information about lifetimes of facts in a semantic store is maintained. Even when a fact is logically deleted, a physical record is kept available. The record of a logically deleted or invalid fact has associated lifetime information. For example, valid-from and valid-to time values. The record of a fact not yet deleted may have a valid-from time value indicating when it was created, became valid, etc. Queries against the semantic store may specify a timeslice (a point in time or a time range). The lifetime information can be used to satisfy such time-specific queries. Because records are maintained after they are logically deleted, it is also possible to accurately query a past state of the semantic store. Even if such a query is run at different times, same results may be obtained.

Abstract: Described are techniques to facilitate temporal features in a semantic data store. Information about lifetimes of facts in a semantic store is maintained. Even when a fact is logically deleted, a physical record is kept available. The record of a logically deleted or invalid fact has associated lifetime information. For example, valid-from and valid-to time values. The record of a fact not yet deleted may have a valid-from time value indicating when it was created, became valid, etc. Queries against the semantic store may specify a timeslice (a point in time or a time range). The lifetime information can be used to satisfy such time-specific queries. Because records are maintained after they are logically deleted, it is also possible to accurately query a past state of the semantic store. Even if such a query is run at different times, same results may be obtained.

Abstract: Technology is described that includes a method of feature specification via semantic queries. The method can include the operation of obtaining a data set having an identifier for each data row and a plurality of data features for each data row. A semantic query can be received that can be applied to the dataset that is usable by a machine learning tool. A entity feature map can be supplied that has entities and associated features for use by the machine learning tool. Further, a query structure can be analyzed using the entity feature map to identify input from the dataset for the machine learning tool.

Abstract: A relational database system. The system includes a relational database configured to store and present data in a plurality of tables and a database application operatively coupled with the relational database. The system is configured to execute in an intermediate language runtime environment that supports native treatment of user data type definitions, and the database application and the relational database are configured to populate the plurality of tables with records that are each uniquely identified by a key. For each record, the key is constructed in accordance with a compound user-defined data type, such that the key includes: identification of an originating table and additional record-identifying information for the record.

Abstract: A semantic frame store system including a semantic frame store configured to provide representation of data items in a semantic frame schema having a plurality of tables. The semantic frame store system and semantic frame store are configured to enable a conceptual structure of the data items to be changed without requiring alteration to the semantic frame schema.

Abstract: Described is a system and method that facilitates fast and reliable synchronization of computer/file system directories. A synchronization (FastSync) subsystem operates in a discovery/enumeration phase to provide a calling client with a set of the differences between directories, and then operates in an action phase to perform operations as directed by the client to synchronize the different directories. The discovery/enumeration and action phases use parallel operation and I/O (input/output) pipelining. Multiple threads are used during enumeration to enumerate each directory's children, and enqueues each sub-directory to be handled by a new thread. During the action phase, when an operation is requested, the FastSync subsystem packages up the operation, item pointer, and context information into an internal context block and queues that packet as a work item for a process thread pool to handle.

Abstract: A system and method are provided for implementing conflict resolution in a sync manager. In case of a conflict, the sync operation creates and stores a conflict object, and resumes the sync operation without requiring user input. The sync operation can thus be completed without user input and the user may choose to resolve outstanding conflicts, either on-line or off-line, at a convenient time. Furthermore, the invention provides a platform for developing standardized, user-friendly sync operations. In addition, the invention presents a centralized location that allows a user to quickly and easily resolve conflicts originating from many devices.

Abstract: Described is a system and method that synchronizes cached files and directories with a server's files and directories via a layered architecture, by collapsing state information into an index into a fixed set of known states, and looking up the action that synchronizes that state. The actions are then taken to synchronize the content. Any of fifty possible synchronization states are thus handled. A synchronization controller requests a subsystem to evaluate a local cache and remote file system to generate state flags for each item considered for synchronization. The synchronization controller processes the state information to identify a selected table from among a plurality of tables that contain the fifty values, and uses other flags to compute an index into the table. The selected table contains values that index into an action table containing actions that specify an operation set that is requested to synchronize the particular state scenario.

Abstract: A system and method for implementing a consistent user name-space on networked computing devices is provided. When a network connection between a local or host computing device and one or more remote computing devices is present, remote items are represented using the same methodology as items located on the host computing device. To the user, remote and local items are indistinguishable. When the network connection is lost or items located on a remote computer are otherwise unavailable, the unavailable items remain represented on the host computing device. Unavailable items are represented in a way that informs the user that the items may not be fully accessed.

Abstract: The present invention provides a novel client side caching (CSC) infrastructure that supports transition states at the directory level to facilitate a seamless operation across connectivity states between client and remote server. More specifically, persistent caching is performed to safeguard the user (e.g., client) and/or the client applications across connectivity interruptions and/or bandwidth changes. This is accomplished in part by caching to a client data store the desirable file(s) together with the appropriate file access parameters. Moreover, the client maintains access to cached files during periods of disconnect. Furthermore, portions of a path can be offline while other portions upstream can remain online. CSC operates on the logical path which cooperates with DFS which operates on the physical path to keep track of files cached, accessed and changes in the directories. In addition, truth on the client is facilitated whether or not a conflict of file copies exists.

Abstract: The present invention provides a novel client side caching (CSC) infrastructure that supports transition states at the directory level to facilitate a seamless operation across connectivity states between client and remote server. More specifically, persistent caching is performed to safeguard the user (e.g., client) and/or the client applications across connectivity interruptions and/or bandwidth changes. This is accomplished in part by caching to a client data store the desirable file(s) together with the appropriate file access parameters. Moreover, the client maintains access to cached files during periods of disconnect. Furthermore, portions of a path can be offline while other portions upstream can remain online. CSC operates on the logical path which cooperates with DFS which operates on the physical path to keep track of files cached, accessed and changes in the directories. In addition, truth on the client is facilitated whether or not a conflict of file copies exists.

Abstract: The present invention provides a novel client side caching (CSC) infrastructure that supports transition states at the directory level to facilitate a seamless operation across connectivity states between client and remote server. More specifically, persistent caching is performed to safeguard the user (e.g., client) and/or the client applications across connectivity interruptions and/or bandwidth changes. This is accomplished in part by caching to a client data store the desirable file(s) together with the appropriate file access parameters. Moreover, the client maintains access to cached files during periods of disconnect. Furthermore, portions of a path can be offline while other portions upstream can remain online. CSC operates on the logical path which cooperates with DFS which operates on the physical path to keep track of files cached, accessed and changes in the directories. In addition, truth on the client is facilitated whether or not a conflict of file copies exists.

Abstract: A data presentation system dynamically generates and renders a user interface (UI) in the form of a Hypertext Markup Language (HTML) document. Extensible Markup Language (XML) data files contain data that defines the UI. The XML data is maintained independently of any application and/or computing system's settings and controls that define the presentation of the UI. The XML data files also have reference links to secondary data files that contain data further defining the UI. The UI is dynamically generated when an application invokes the XML data files. The HTML document incorporates the data from both the XML data files and from the secondary data files when rendering the UI.

Abstract: A data presentation system dynamically generates and renders a user interface (UI) in the form of a Hypertext Markup Language (HTML) document. Extensible Markup Language (XML) data files contain data that defines the UI. The XML data is maintained independently of any application and/or computing system's settings and controls that define the presentation of the UI. The XML data files also have reference links to secondary data files that contain data further defining the UI. The UI is dynamically generated when an application invokes the XML data files. The HTML document incorporates the data from both the XML data files and from the secondary data files when rendering the UI.

Abstract: The present invention is directed at a system and method for managing and evicting objects stored in a cache. The invention provides a mechanism for determining which objects to evict based on a weight that is calculated for each object stored in the cache. The weight is determined by at least two factors, including file size, file type, primary user, last access time, and the like, and by the relative importance of each of the factors. The weight for each object may be determined autonomously and/or may be determined upon a trigger event. The factors and their relative importance may be obtained from a policy applicable to one or several computers.