Melnik, S.: 2001, `RDF API Draft'. http://www-db.stanford.edu/~melnik/ rdf/api.html.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Common Data and Query Exchange Model Internally Edutella Peers use a Datalog based model to represent queries and their results. Figure 4 visualizes this data model as UML class diagram. All classes beginning with RDF are standard RDF concepts and reflect their usage in the Stanford RDF API [28]. Each query is represented as an instance of EduQuery which aggregates an arbitrary number of EduRule and EduLiteral These views can be combined, though, see, e.g. 20] and[14] and to some extent RDFS, which specifies classes in an object oriented way, even though it does not introduce object ....

Sergey Melnik. RDF API Draft, January 2001. http://www-db.stanford.edu/ melnik/rdf/api.html.

....to the given Datalog rules and the knowledge base to be queried (cf. below for results) 2.2.2 ECDM Datamodel and Queries Figure 4 visualizes the ECDM, as implemented in our current prototype, as UML diagram. Our Java binding relies on JXTA [5] and makes extensive use of the Stanford RDF API [10]. The implementation of all classes shown in figure 4 is found in the Java package net.jxta.edutella.util.datamodel. All classes whose names start with RDF represent standard RDF concepts and correspond to their equivalent counterparts within the Stanford RDF API. These are RDFReifiedStatement, ....

Sergey Melnik. RDF API Draft, January 2001. http://www-db.stanford.edu/ melnik/rdf/api.html.

....Common Data and Query Exchange Model (ECDM) Internally Edutella Peers use a Datalog based model to represent queries and their results. Figure 4 visualizes this data model as UML diagram. All classes beginning with RDF are standard RDF concepts and reflect their usage within the Stanford RDF API [26]. 2 see the discussion in Section 4.7 7 Each query is represented by an instance of EduQuery which aggregates an arbitrary number of EduRule and EduLiteral objects. EduLiterals are either RDFReifiedStatements (binary predicates ternary statement literals, corresponding to reified RDF ....

Sergey Melnik. RDF API Draft, January 2001. http://www-db.stanford.edu/ melnik/rdf/api.html.

.... Wilbur s XML parser (written in Common Lisp) has an interface similar to SAX 1 [22] The parser was written with RDF s needs in mind and does not, for example, support DTDs (except for entity declarations) lecting triples from a database, similar to the find interface of the Stanford RDF API [23] (not to be confused with the Wilbur frame query language described later) For debugging purposes, the object inspector of the Macintosh Common Lisp was extended to allow easy browsing of RDF graphs. 2 3. Integration Issues Our two previous frame systems, BEEF [12, 16] and PORK [17] both ....

Sergey Melnik: "RDF API Draft", working document, Stanford University, 1999

....that offers functionality to add data to, or to retrieve or delete data from the repository. RAL implementations translate calls to the API methods into operations on the underlying repository. Rather than adopting or extending an existing RDF API, such as the Stanford API proposed by Sergey Melnik [Melnik, 2000], we have created a completely new API. The main differences between our proposal and the Stanford API are that: a. The Stanford API is very much targeted at data that is kept in memory, whereas our API is considerably more lightweight as all data is returned one at a time in data streams. b. ....

....incrementally adding RDF data schema information; 2. clearing a repository. The admin module retrieves its information from an RDF(S) source (usually an online RDF(S) document in XML serialized form) and parses it using a streaming RDF parser (currently, we use the SiRPAC RDF parser [Barstow and Melnik, 2000] The parser delivers the information to the admin module on a per statement basis: S, P, O) The admin subsequently checks each statement for consistency with the information already present in the repository, and infers implied information if necessary, as follows: if P equals type, then ....

Melnik, S. (2000). RDF API Draft. public draft, Database Group, Stanford University. See http://www-db.stanford.edu/melnik/rdf/api.html.

No context found.

Melnik, S.: 2001, `RDF API Draft'. http://www-db.stanford.edu/~melnik/ rdf/api.html.

No context found.

S. Melnik. Rdf api draft, 2001. http://www-db. stanford.edu/melnik/rdf/api.html.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC