Abstract: The subject disclosure relates to a syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format. The scripting language can be a declarative programming language, such as the “D” programming language, which is well suited to the authoring of data intensive programs. A compact query syntax is provided for D that simplifies the expression of complex and data intensive programs. In another non-limiting aspect, conventional operator precedence is modified to accommodate the compact syntax and other unique features of a general purpose declarative programming language.

Abstract: An efficient, logical and expressive type system is provided for flexibly defining types of a declarative programming language so that efficient and structurally compact data intensive applications can be generated. The type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. With the type system, types can be expressed as intersections and/or unions of other types. Thus, types can be efficiently represented for a full range of types of data as may be found in real world data stores.

Abstract: The subject disclosure relates to an extensible syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format, and also according to self-defined syntax within the data intensive applications so that a single compilation unit of a program can support multiple syntaxes. An extensible syntax is provided for M that allows alternate syntaxes to be defined in line and then used in the program so as to accommodate user-defined syntaxes and other pre-existing domain specific languages. In one embodiment, the alternate syntaxes can be defined at pre-designated functional points in the program.

Abstract: A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.

Abstract: Embodiments of tree-based directed graph programming structures for a declarative programming language are provided. In various embodiments, complex graph structured data, referred to as “DGraphs” herein in one non-limiting implementation, is authored using a compact, human friendly syntax without the use of explicit identifiers. In one non-limiting aspect, the syntax includes support for conformance relationships, also referred to as factored relationships. In another non-limiting aspect, the semistructured graph data is a tree-based representation and the syntax includes lexical resolution of references or lexical scoping, and/or non local initialization.

Abstract: Implementations are described and claimed herein to detect an invalid policy that may reside in a cache at a client. An expired policy is removed from cache and a current policy is requested. Otherwise the cached policy may be used. The client indicates which policy it is using by generating a policy digest, including, in compressed form, one or more assertions. If the host determines the policy digest is invalid, the host issues an invalid digest fault. If the policy digest is valid, but the assertions included in the policy digest are invalid, the host issues an invalid policy fault. In either case, the client is notified that the cached policy is no longer valid and that a current policy should be requested.

Abstract: An apparatus and method is provided for resolving virtual network names using one or more name routers. A conventional Uniform Resource Locator (URL) naming scheme is extended by allowing any component to be mapped to an address. The resolution process occurs recursively through a plurality of name routers. Resolution can be contextual, such that the same virtual network name may be resolved differently depending on the identity of the client or other parameters.

Abstract: Expanding and contracting a display screen container. Data is stored in a computer readable medium. The data represents a screen container such as a graphical desktop user interface displayable to a user on a computer display of a computing device. Data is stored representing artifacts, including one or more application graphical user interface artifacts for applications that are instantiated on the computing device. Information is stored specifying locations where each of the artifacts should be graphically located in the screen container. The graphical size of screen container is determined by the locations of the artifacts. Based on user input, a portion of the screen container is displayed to the user on the computer display of the computing device. The screen container may be expanded or contracted based on opening or closing graphical user interface artifacts, adding or removing artifacts, or repositioning artifacts.

Abstract: Component domains used to define a binding between various components associated with the component domain. The component domain tracks the various services to be imported by each component, and tracks the various services exported by each component. At runtime, rather than at compile time, the various interrelations between the components are bound using the service import and export data. Accordingly, depending on the components available and their characteristics, the bindings may differ. This permits applications to be much more flexible.

Abstract: Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.

Abstract: Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.

Abstract: Methods and systems for providing a virtual network are disclosed. At least one layer of abstraction is created between network service applications and conventional network protocols by inserting an adaptive dispatcher between applications and network transport services on each machine in a network. The message protocol in the virtual network is extensible, allowing application programs to create new headers within any message as needed. The adaptive dispatcher contains handlers that route and dispatch messages within the virtual network based on arbitrary content within each message, including any combination of headers and/or data content. Each device on the virtual network has a virtual address to which messages are directed, allowing devices to move within the network without reconfiguring routing tables.

Abstract: The present invention extends to methods, systems, and computer program products for fitness based routing. Embodiments of the invention significantly improve the likelihood that routing nodes contained in routing table have adequate (or even relatively increased) ability to transfer and process messages in an overlay network. Thus, when the node is to make a routing decision for a message, the node has some assurances that any selected routing node is adequate (or is at least the best currently available). Further, a sending node can take preference to routing nodes with higher fitness values when sending a message. Preference to higher fitness metric values further insures that messages are adequately transferred and processed. Accordingly, embodiments of the invention can be used to route messages in a manner that optimizes bandwidth and provides efficient routing capability.

Abstract: Methods and systems for providing a virtual network are disclosed. At least one layer of abstraction is created between network service applications and conventional network protocols by inserting an adaptive dispatcher between applications and network transport services on each machine in a network. The message protocol in the virtual network is extensible, allowing application programs to create new headers within any message as needed. The adaptive dispatcher contains handlers that route and dispatch messages within the virtual network based on arbitrary content within each message, including any combination of headers and/or data content. Each device on the virtual network has a virtual address to which messages are directed, allowing devices to move within the network without reconfiguring routing tables.

Abstract: Systems and methods for using endpoint references in a publish-subscribe system are described. In one aspect, an endpoint reference is created by a component of the pub-sub system. The endpoint reference includes an endpoint address and one or more contexts. Each context is directed to a respective component of the pub-sub system. Each context is transparent to the respective component, and selectively opaque to all other pub-sub system components.

Abstract: An apparatus and method is provided for resolving virtual network names using one or more name routers. A conventional Uniform Resource Locator (URL) naming scheme is extended by allowing any component to be mapped to an address. The resolution process occurs recursively through a plurality of name routers. Resolution can be contextual, such that the same virtual network name may be resolved differently depending on the identity of the client or other parameters.

Abstract: An object oriented programming environment is extended to allow a client object oriented application running under a client/server operating system to communicate with a plurality of server object oriented applications located on one or more remote computers in a distributed computer environment. The extended object oriented programming environment provides the capability for a client object oriented application to connect to, and communicate with remote server object oriented applications as well as make object references to remote objects and remote object data. The extended object oriented programming environment is used for designing N-tiered logical models for distributed computing applications, while providing a flexible and adaptable M-tiered physical model underneath the N-tiered logical model. This environment is also used to provide the ability to reference remote objects from Internet and other client network applications.

Abstract: A method of building a dataset in a computing system includes extracting data meeting a predetermined criteria from at least a first database, filling the dataset with data items, extracting from the first database relationships between the data items meeting the predetermined criteria, and filling the dataset with the relationships. A system for building a dataset in a computing system includes a data extraction module, a data populating module, a relationship extraction module, and a relationship populating module. The data extraction module extracts data meeting a predetermined criteria from at least a first database. The data populating module fills the dataset with data items. The relationship extraction module extracts from the first database relationships between the data items meeting the predetermined criteria. The relationship populating module fills the dataset with the relationships.

Abstract: An object oriented programming environment is extended to allow a client object oriented application running under a client/server operating system to communicate with a plurality of server object oriented applications located on one or more remote computers in a distributed computer environment. The extended object oriented programming environment provides the capability for a client object oriented application to connect to, and communicate with remote server object oriented applications as well as make object references to remote objects and remote object data. The extended object oriented programming environment is used for designing N-tiered logical models for distributed computing applications, while providing a flexible and adaptable M-tiered physical model underneath the N-tiered logical model. This environment is also used to provide the ability to reference remote objects from Internet and other client network applications.

Abstract: Data is separated from source. Datasets store tables of data and a graph of the relationships between the tables. The relationship can change at any time. The relationships are described by metadata that describe primary key, foreign key, and lookups, and other relationships between tables. In one embodiment, the tables of data are typed columns of data. The dataset also includes information on the rowstate and differential preservation, therefore, the source does not need to manage states of the data access. Adapters abstract the interface to datasets. More specifically, adapters manage the input/output to the datasets of the tables of data and the relationships. Adapters can be specialized in their purpose, such as an adapter for OLE data or XML data or generalized in their purpose. Furthermore, a composite adapter is specialized for the purpose of interacting with other adapters. Adapters manage the connection to the dataset and the name of the server that hosts the dataset.