Abstract: A method of accessing a network securely using a personal device which can only access the network via one or more authorized access points, the method including establishing a connection between the network and the personal device via an access point; checking in the network whether the access point is on a white list of authorized access points for use with the network; if the access point is on the white list, allowing the personal device to access the network securely via the access point; and if the access point is not on the white list, not allowing the personal device to access the network securely.

Abstract: A method for reconciling a source data graph with a target data graph, the source graph and the target graph each comprising: and a interconnections, the interconnections each connecting two vertices from and representing a relationship between the connected vertices. The method comprises: generating target event propagation information representing the propagation pattern of executions of each of a set of processing events in the target graph; receiving a request to reconcile the source and graph, and in response to the request, triggering the executions of each of the set in the source graph; generating source event propagation information representing the pattern of each of the executions triggered in the source graph; and using the target event propagation information and the source event propagation information to assess the similarity of pairs of vertices comprising one vertex from each of the source graph and the target graph.

Abstract: A Data Constraint Engine (100) for enforcing data constraints in a polyglot data tier (20) having a plurality of database-specific data stores (21, 22, 23) of various types such as an RDBMS (21), a Triplestore (22), and a MongoDB (23). The Data Constraint Engine uses the concept of a unified data model based on “records” in order to allow data constraints to be defined (using so-called “record shapes”) in a store-agnostic way. The Data Constraint Engine includes APIs (130) for processing incoming requests from remote clients (30) relating to data in the polyglot data tier, for example a request to create or update data in a data store. The APIs extract, from such a request, a record corresponding to the data specified in the request and a data source identifier identifying the data store holding the specified data. Then, on the basis of the record extracted by the interface, an appropriate record shape is extracted from a shapes catalogue (110), the record shape determining the structure of the record.

Abstract: A query mediator arranged to query a polyglot data tier of data stores, each data store adopting a data model and the polyglot data tier including at least two different types of data store with differing data models. The query mediator including at least one HTTP API; a catalogue containing metadata for each data store; and a plurality of adapters, one for each data model. The API receives an incoming query from a client, checks the query against the catalogue to identify a correct data store storing the queried data, and routes the query to an adapter for the correct data store. The adapter transforms the query into a format suitable for use with the data model adopted in the correct data store, for execution by the relevant data store. The API returns the query result to the client in response to the incoming query.

Abstract: A dataflow controller to store dataflow specifications and to control execution of the dataflow specified the specification specifying a series of linked data processing steps, each step specifying a processing operation to generate output data, and each link defining a consecutive pair relationship between two steps within the series, the link instructing the dataflow controller to trigger execution of the preceding member of the pair by, providing the output data of the member as the input data of the member; and a cache memory and memory controller, the memory controller to maintain an accumulation of the output data generated by the most recent execution of the operation of each member of a set of the steps specified by the dataflow controller; the dataflow controller upon execution of the operation of the step, to provide the output data to the memory controller; the memory controller, to update the maintained accumulation.

Abstract: A management apparatus including data storage storing a graph of resources encoded as a plurality of data items, each item being a value for: a subject, a resource identifier; an object, either an identifier of an object resource or a literal value; and a predicate, a named relationship between the subject and the object. A dynamic dataflow controller stores a processor instance specifying an input range, a process, and an output range, and, when triggered by t an item within the input range, generating an output item within the output range, by performing the process. The controller responding to a modification event involving a data item within the input range by providing the data item to the instance; where the controller following the generation of the output provides an item of the output as the input to an instance specifying an input range covering the item in the output.

Abstract: A method for reconciling a source data graph with a target data graph, the source graph and the target graph each comprising: and a interconnections, the interconnections each connecting two vertices from and representing a relationship between the connected vertices. The method comprises: generating target event propagation information representing the propagation pattern of executions of each of a set of processing events in the target graph; receiving a request to reconcile the source and graph, and in response to the request, triggering the executions of each of the set in the source graph; generating source event propagation information representing the pattern of each of the executions triggered in the source graph; and using the target event propagation information and the source event propagation information to assess the similarity of pairs of vertices comprising one vertex from each of the source graph and the target graph.

Abstract: Embodiments include an apparatus to automate integration of non-conceptual data items into a data graph, the graph including graph nodes and graph edges, the computing apparatus comprising: a data storage system configured to store, as a node, a behavior handler to update the data graph in response to an occurrence of a specified trigger event, the node representing the behavior handler being stored in association with the non-conceptual data item; an execution module configured to execute the procedure defined by a behavior handler in response to the event; a modification identification module to identify modified graph elements, and to record the graph elements as modifications attributed to the behavior handler; an inference module configured to infer relationships between behavior handlers by, analyzing the modifications attributed to the behavior handlers to identify relationships between the modifications, and adding the relationships to the data graph as edges between the graph nodes.

Abstract: Embodiments include a data storage system configured to store data encoding a data graph, the data graph comprising a plurality of resources and a plurality of interconnections, each of the plurality of interconnections connecting two resources from among the plurality of resources and representing a relationship between the linked resources; the data storage system comprising: a data storage apparatus configured to store the data encoding the data graph; a plurality of event handlers, each event handler being associated with one or more resources from among the plurality of resources, and being executable at the or each of the respective associated resources; and an event propagation mechanism configured to respond to a processing event at a resource from among the plurality of resources by triggering the execution of one or more event handlers from among the plurality of event handlers at respective associated resources.

Abstract: A method of accessing a network securely using a personal device which can only access the network via one or more authorized access points, the method including establishing a connection between the network and the personal device via an access point; checking in the network whether the access point is on a white list of authorized access points for use with the network; if the access point is on the white list, allowing the personal device to access the network securely via the access point; and if the access point is not on the white list, not allowing the personal device to access the network securely.

Abstract: A computer-implemented method is provided for generating an ontology document, the method comprising inputting a domain description including information about items in the domain and relationships between the items; accessing a data structure and an operation structure, wherein the data structure is a domain-independent model of items and relationships between items, the data structure comprising at least progenitor items each able to contain only progeny items created by the progenitor item as a consequence of the progenitor item accepting an operation from the operation structure invoked against it, the operation structure also being domain-independent; and applying the data structure and the operation structure to the domain description to generate an ontology document for use in producing a software artifact.

Abstract: A computer-implemented method is provided for generating an ontology document, the method comprising inputting a domain description including information about items in the domain and relationships between the items; accessing a data structure and an operation structure, wherein the data structure is a domain-independent model of items and relationships between items, the data structure comprising at least progenitor items each able to contain only progeny items created by the progenitor item as a consequence of the progenitor item accepting an operation from the operation structure invoked against it, the operation structure also being domain-independent; and applying the data structure and the operation structure to the domain description to generate an ontology document for use in producing a software artefact.