activerdf_rdflite 1.0

data/LICENSE

@@ -0,0 +1,504 @@
+		  GNU LESSER GENERAL PUBLIC LICENSE
+		       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+		  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+  
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+			    NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
+
+

data/README

@@ -0,0 +1,16 @@
+== Welcome to rdflite
+
+rdflite is a small RDF datastore, based on sqlite3. It can be used as a 
+datastore for ActiveRDF: it acts as a gemplugin for ActiveRDF. rdflite does not 
+scale well for large datasets, but is very fast for small ones. It supports the 
+full ActiveRDF query grammar (basically, select/distinct/count with arbitrary 
+joins in the where clauses) and offers full-text search over the literals if 
+ferret is installed. 
+
+See http://www.activerdf.org/ for more information.
+
+== License
+rdflite is distributed under the LGPL license.
+
+== Authors
+* Eyal Oren

data/Rakefile

@@ -0,0 +1,44 @@
+require 'rake'
+require 'rake/testtask'
+require 'rake/clean'
+require 'rake/gempackagetask'
+require 'rake/rdoctask'
+require '../tools/rakehelp'
+require 'fileutils'
+include FileUtils
+
+setup_tests
+setup_rdoc ['README', 'LICENSE', 'lib/**/*.rb', 'doc/**/*.rdoc']
+
+desc "test and package gem"
+task :default => [:test, :package]
+
+# get ActiveRdfVersion from commandline
+ActiveRdfVersion = ENV['REL'] || '0.9.7'
+NAME="activerdf_rdflite"
+GEMNAME="#{NAME}-#{ActiveRdfVersion}.gem"
+
+# define package task
+setup_gem(NAME,ActiveRdfVersion) do |spec|
+  spec.summary = "an RDF database for usage in ActiveRDF (based on sqlite3)" 
+  spec.description = spec.summary
+  spec.author="Eyal Oren <eyal.oren@deri.org"
+  spec.add_dependency('gem_plugin', '>= 0.2.1')
+  spec.add_dependency('activerdf', '>= 0.9.2')
+  spec.add_dependency('sqlite3-ruby', '>= 1.1.0')
+end
+
+task :install => [:package] do
+  sh %{sudo gem install pkg/#{name}-#{version}.gem}
+end
+
+task :uninstall => [:clean] do
+  sh %{sudo gem uninstall #{name}}
+end
+
+task :reinstall => [:uninstall, :install]
+
+task :upload => :package do |task|
+  sh "scp pkg/#{GEMNAME} eyal@m3pe.org:/home/eyal/webs/activerdf/gems/"
+end
+

data/lib/activerdf_rdflite/init.rb

@@ -0,0 +1,11 @@
+
+# add the directory in which this file is located to the ruby loadpath
+file =
+if File.symlink?(__FILE__)
+  File.readlink(__FILE__)
+else
+  __FILE__
+end
+$: << File.dirname(File.expand_path(file))
+
+require 'rdflite'

data/lib/activerdf_rdflite/rdflite.rb

@@ -0,0 +1,471 @@
+# RDFLite is a lightweight RDF database on top of sqlite3. It can act as adapter 
+# in ActiveRDF. It supports on-disk and in-memory usage, and allows keyword 
+# search if ferret is installed.
+#
+# Author:: Eyal Oren
+# Copyright:: (c) 2005-2006 Eyal Oren
+# License:: LGPL
+
+require 'sqlite3'
+require 'active_rdf'
+require 'federation/connection_pool'
+
+$log.info "loading RDFLite adapter"
+
+begin 
+	require 'ferret'
+	@@have_ferret = true
+rescue LoadError
+	$log.info "Keyword search is disabled since we could not load Ferret. To 
+	enable, please do \"gem install ferret\""
+	@@have_ferret = false
+end
+
+class RDFLite < ActiveRdfAdapter
+	ConnectionPool.register_adapter(:rdflite,self)
+	bool_accessor :keyword_search
+
+	# instantiates RDFLite database
+	# available parameters:
+	# * :location => filepath (defaults to memory)
+	# * :keyword => true/false (defaults to true)
+	# * :pidx, :oidx, etc. => true/false (enable/disable these indices)
+	def initialize(params = {})
+		$log.info "initialised rdflite with params #{params.to_s}"
+
+		@reads = true
+		@writes = true
+	
+		# if no file-location given, we use in-memory store
+		file = params[:location] || ':memory:'
+		@db = SQLite3::Database.new(file) 
+
+		# we enable keyword unless the user specifies otherwise
+		@keyword_search = if params[:keyword].nil?
+												true
+											else
+											  params[:keyword]
+											end
+
+		# we can only do keyword search if ferret is found
+		@keyword_search &= @@have_ferret
+		$log.debug "we #{keyword_search? ? "do" : "don't"} have keyword search"
+
+		if keyword_search?
+			# we initialise the ferret index, either as a file or in memory
+
+			# we setup the fields not to store object's contents
+			infos = Ferret::Index::FieldInfos.new
+			infos.add_field(:subject, :store => :yes, :index => :no, :term_vector => :no)
+			infos.add_field(:object, :store => :no) #, :index => :omit_norms)
+			
+			@ferret = if params[:location]
+									Ferret::I.new(:path => params[:location] + '.ferret', :field_infos => infos)
+								else
+									Ferret::I.new(:field_infos => infos)
+								end
+		end
+
+		# turn off filesystem synchronisation for speed
+		@db.synchronous = 'off'
+
+		# create triples table. since triples are unique, inserted duplicates are 
+		@db.execute('create table if not exists triple(s,p,o, unique(s,p,o) on conflict ignore)')
+
+		create_indices(params)
+
+		$log.debug("opened connection to #{file}")
+		$log.debug("database contains #{size} triples")
+	end
+
+	# returns the number of triples in the datastore (incl. possible duplicates)
+	def size
+		@db.execute('select count(*) from triple')[0][0].to_i
+	end
+
+	# returns all triples in the datastore
+	def dump
+		@db.execute('select s,p,o from triple') do |s,p,o|
+			[s,p,o].join(' ')
+		end
+	end
+
+	# deletes all triples from datastore
+	def clear
+		@db.execute('delete from triple')
+	end
+
+	# deletes triple(s,p,o) from datastore
+	# nil parameters match anything: delete(nil,nil,nil) will delete all triples
+	def delete(s,p,o)
+		# convert input to internal format
+		# leave nil input alone (we'll deal with it later)
+		s = "<#{s.uri}>" unless s.nil?
+		p = "<#{p.uri}>" unless p.nil?
+		o = case o
+				when RDFS::Resource
+					"<#{o.uri}>"
+				else
+					"\"#{o.to_s}\""
+				end unless o.nil?
+
+		# construct where clause for deletion (for all non-nil input)
+		where_clauses = []
+		conditions = []
+		unless s.nil?
+			conditions << s
+			where_clauses << 's = ?' 
+		end
+
+		unless p.nil?
+			conditions << p
+			where_clauses << 'p = ?' 
+		end
+
+		unless o.nil?
+			conditions << o
+			where_clauses << 'o = ?' 
+		end
+
+		# construct delete string
+		ds = 'delete from triple'
+		ds << " where #{where_clauses.join(' and ')}" unless where_clauses.empty?
+
+		# execute delete string with possible deletion conditions (for each 
+		# non-empty where clause)
+		@db.execute(ds, *conditions)
+		$log.debug(sprintf("sending delete query: #{ds}", *conditions))
+
+		# delete literal from ferret index
+		@ferret.search_each("subject:\"#{s}\", object:\"#{o}\"") do |idx, score|
+			$log.debug "deleting #{o} => #{s} from ferret index"
+			@ferret.delete(idx)
+		end if keyword_search?
+	end
+	
+	# adds triple(s,p,o) to datastore
+	# s,p must be resources, o can be primitive data or resource
+	def add(s,p,o)
+		# check illegal input
+		raise(ActiveRdfError, "adding non-resource #{s}") unless s.respond_to?(:uri)
+		raise(ActiveRdfError, "adding non-resource #{p}") unless p.respond_to?(:uri)
+
+		# get internal representation (array)
+		triple = internal_triple_representation(s,p,o)
+
+		# add triple to database
+		add_internal(*triple)
+	end
+
+	# flushes openstanding changes to underlying sqlite3
+	def flush
+		# since we always write changes into sqlite3 immediately, we don't do 
+		# anything here
+		true
+	end
+
+	# loads triples from file in ntriples format
+	def load(file)
+		ntriples = File.readlines(file)
+
+		@db.transaction do 
+			ntriples.each do |triple|
+				nodes = triple.scan(Node)
+				add_internal(nodes[0], nodes[1], nodes[2])
+			end
+		end
+
+		$log.debug "read #{ntriples.size} triples from file #{file}"
+		@db
+	end
+
+	# executes ActiveRDF query on datastore
+	def query(query)
+		# log received query
+		$log.debug "received query: #{query.to_sp}"
+
+		# construct query clauses
+		sql = translate(query)
+
+		# executing query, passing all where-clause values as parameters (so that 
+		# sqlite will encode quotes correctly)
+		constraints = @right_hand_sides.collect { |value| value.to_s }
+
+		$log.debug format("executing: #{sql.gsub('?','"%s"')}", *constraints)
+
+		# executing query
+		results = @db.execute(sql, *constraints)
+
+		# if ASK query, we check whether we received a positive result count
+		if query.ask?
+			return [results[0][0].to_i > 0]
+		else
+			# otherwise we convert results to ActiveRDF nodes and return them
+			return wrap(query, results)
+		end
+	end
+
+	# translates ActiveRDF query into internal sqlite query string
+	def translate(query)
+		construct_select(query) + construct_join(query) + construct_where(query) + 
+			construct_limit(query)
+	end
+
+	private
+	# constants for extracting resources/literals from sql results
+	Resource = /<([^>]*)>/
+	Literal = /"([^"]*)"/
+	Node = Regexp.union(/<[^>]*>/,/"[^"]*"/)
+	SPO = ['s','p','o']
+
+	# adds s,p,o into sqlite and ferret
+	# s,p,o should be in internal format: <uri> and "literal"
+	def add_internal(s,p,o)
+		# insert the triple into the datastore
+		@db.execute('insert into triple values (?,?,?)', s,p,o)
+
+		# if keyword-search available, insert the object into keyword search
+		@ferret << {:subject => s, :object => o} if keyword_search?
+	end
+
+	# construct select clause
+	def construct_select(query)
+		# ASK queries counts the results, and return true if results > 0
+		return "select count(*)" if query.ask?
+
+		# add select terms for each selectclause in the query
+		# the term names depend on the join conditions, e.g. t0.s or t1.p
+		select = query.select_clauses.collect do |term|
+			variable_name(query, term)
+		end
+
+		# add possible distinct and count functions to select clause
+		select_clause = ''
+		select_clause << 'distinct ' if query.distinct?
+		select_clause << select.join(', ')
+		select_clause = "count(#{select_clause})" if query.count?
+
+		"select " + select_clause
+	end
+
+	# construct (optional) limit and offset clauses
+	def construct_limit(query)
+		clause = ""
+
+		# if no limit given, use limit -1 (no limit)
+		limit = query.limits.nil? ? -1 : query.limits
+
+		# if no offset given, use offset 0
+		offset = query.offsets.nil? ? 0 : query.offsets
+
+		clause << " limit #{limit} offset #{offset}"
+		clause
+	end
+
+	# construct join clause
+	# TODO: joins don't work this way, they have to be linear (in one direction 
+	# only, and we should only alias tables we didnt alias yet)
+	# we should only look for one join clause in each where-clause: when we find 
+	# one, we skip the rest of the variables in this clause.
+	def construct_join(query)
+		join_stmt = ''
+
+		# no join necessary if only one where clause given
+		return ' from triple as t0 ' if query.where_clauses.size == 1
+
+		where_clauses = query.where_clauses.flatten
+		considering = where_clauses.uniq.select{|w| w.is_a?(Symbol)}
+
+		# constructing hash with indices for all terms
+		# e.g. {?s => [1,3,5], ?p => [2], ... }
+		term_occurrences = Hash.new()
+		where_clauses.each_with_index do |term, index|
+			ary = (term_occurrences[term] ||= [])
+			ary << index 
+		end
+
+		aliases = {}
+
+		where_clauses.each_with_index do |term, index|
+			# if the term has been joined with his buddy already, we can skip it
+			next unless considering.include?(term)
+
+			# we find all (other) occurrences of this term
+			indices = term_occurrences[term]
+
+			# if the term doesnt have a join-buddy, we can skip it
+			next if indices.size == 1
+
+			# construct t0,t1,... as aliases for term
+			# and construct join condition, e.g. t0.s
+			termalias = "t#{index / 3}"
+			termjoin = "#{termalias}.#{SPO[index % 3]}"
+
+			join = if join_stmt.include?(termalias)
+							 ""
+						 else
+							 "triple as #{termalias}"
+						 end
+
+			indices.each do |i|
+				# skip the current term itself
+				next if i==index
+
+				# construct t0,t1, etc. as aliases for buddy,
+				# and construct join condition, e.g. t0.s = t1.p
+				buddyalias = "t#{i/3}"
+				buddyjoin = "#{buddyalias}.#{SPO[i%3]}"
+
+				# TODO: fix reuse of same table names as aliases, e.g.
+				# "from triple as t1 join triple as t2 on ... join t1 on ..."
+				# is not allowed as such by sqlite
+				# but on the other hand, restating the aliases gives ambiguity:
+				# "from triple as t1 join triple as t2 on ... join triple as t1 ..."
+				# is ambiguous
+				join << " join triple as #{buddyalias} on #{termjoin} = #{buddyjoin} "
+			end
+			join_stmt << join
+			
+			# remove term from 'todo' list of still-considered terms
+			considering.delete(term)
+		end
+
+		if join_stmt == ''
+			return " from triple as t0 "
+		else
+			return " from #{join_stmt} "
+		end
+	end
+
+	# construct where clause
+	def construct_where(query)
+		# collecting where clauses, these will be added to the sql string later
+		where = []
+
+		# collecting all the right-hand sides of where clauses (e.g. where name = 
+		# 'abc'), to add to query string later using ?-notation, because then 
+		# sqlite will automatically encode quoted literals correctly
+		@right_hand_sides = []
+
+		# convert each where clause to SQL:
+		# add where clause for each subclause, except if it's a variable
+		query.where_clauses.each_with_index do |clause,level|
+			clause.each_with_index do |subclause, i|
+				# dont add where clause for variables
+				unless subclause.is_a?(Symbol)
+					where << "t#{level}.#{SPO[i]} = ?"
+					@right_hand_sides << case subclause
+				 	when RDFS::Resource
+						"<#{subclause.uri}>"
+					else
+						subclause.to_s
+					end
+				end
+			end
+		end
+
+		# if keyword clause given, convert it using keyword index
+		if query.keyword?
+			subjects = []
+			select_subject = query.keywords.collect {|subj,key| subj}.uniq
+			raise ActiveRdfError, "cannot do keyword search over multiple subjects" if select_subject.size > 1
+
+			keywords = query.keywords.collect {|subj,key| key}
+			@ferret.search_each("object:\"#{keywords}\"") do |idx,score|
+				subjects << @ferret[idx][:subject]
+			end
+			subjects.uniq! if query.distinct?
+			where << "#{variable_name(query,select_subject.first)} in (#{subjects.collect {'?'}.join(',')})"
+			@right_hand_sides += subjects
+		end
+
+		if where.empty?
+			''
+		else
+			"where " + where.join(' and ')
+		end
+	end
+
+	# returns sql variable name for a queryterm
+	def variable_name(query,term)
+		# look up the first occurence of this term in the where clauses, and compute 
+		# the level and s/p/o position of it
+		index = query.where_clauses.flatten.index(term)
+
+		if index.nil? 
+			# term does not appear in where clause
+			# but maybe it appears in a keyword clause
+				
+			# index would not be nil if we had:
+			# select(:o).where(knud, knows, :o).where(:o, :keyword, 'eyal')
+			#
+			# the only possibility that index is nil is if we have:
+			# select(:o).where(:o, :keyword, :eyal) (selecting subject)
+			# or if we use a select clause that does not appear in any where clause
+
+			# so we check if we find the term in the keyword clauses, otherwise we throw 
+			# an error
+			if query.keywords.keys.include?(term)
+				return "t0.s"
+			else
+				raise ActiveRdfError,'unbound variable in select clause'
+			end
+		end
+
+		termtable = "t#{index / 3}"
+		termspo = SPO[index % 3]
+		return "#{termtable}.#{termspo}"
+	end
+
+	# wrap resources into ActiveRDF resources, literals into Strings
+	def wrap(query, results)
+		results.collect do |row|
+			row.collect do |result|
+				case result
+				when Resource
+					RDFS::Resource.new($1)
+				when Literal
+					String.new($1)
+				else
+					# when we do a count(*) query we get a number, not a resource/literal
+					results
+				end
+			end
+		end
+	end
+
+	def create_indices(params)
+		sidx = params[:sidx] || false
+		pidx = params[:pidx] || false
+		oidx = params[:oidx] || false
+		spidx = params[:spidx] || true
+		soidx = params[:soidx] || false
+		poidx = params[:poidx] || true
+		opidx = params[:opidx] || false
+
+		# creating lookup indices
+		@db.transaction do 
+			@db.execute('create index if not exists sidx on triple(s)') if sidx
+			@db.execute('create index if not exists pidx on triple(p)') if pidx
+			@db.execute('create index if not exists oidx on triple(o)') if oidx
+			@db.execute('create index if not exists spidx on triple(s,p)') if spidx
+			@db.execute('create index if not exists soidx on triple(s,p)') if soidx
+			@db.execute('create index if not exists poidx on triple(p,o)') if poidx
+			@db.execute('create index if not exists opidx on triple(o,p)') if opidx
+		end
+	end
+
+	# transform triple into internal format <uri> and "literal"
+	# returns array [s,p,o] 
+	def internal_triple_representation(s,p,o)
+		s = "<#{s.uri}>"
+		p = "<#{p.uri}>"
+		o = case o
+				when RDFS::Resource
+					"<#{o.uri}>"
+				else
+					"\"#{o.to_s}\""
+				end
+		[s,p,o]
+	end
+end

data/test/test_data.nt

@@ -0,0 +1,29 @@
+<http://activerdf.org/test/Person> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Class> .
+<http://activerdf.org/test/Person> <http://www.w3.org/2000/01/rdf-schema#subClassOf> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/eyal> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://activerdf.org/test/Person> .
+<http://activerdf.org/test/eyal> <http://activerdf.org/test/age> "27" .
+<http://activerdf.org/test/eyal> <http://activerdf.org/test/name> "Eyal Oren" .
+<http://activerdf.org/test/eyal> <http://activerdf.org/test/eye> "blue" .
+<http://activerdf.org/test/age> <http://www.w3.org/2000/01/rdf-schema#domain> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/eye> <http://www.w3.org/2000/01/rdf-schema#domain> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/car> <http://www.w3.org/2000/01/rdf-schema#domain> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/age> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property> .
+<http://activerdf.org/test/eye> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property> .
+<http://activerdf.org/test/car> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/1999/02/22-rdf-syntax-ns#Property> .
+<http://activerdf.org/test/age> <http://www.w3.org/2000/01/rdf-schema#domain> <http://activerdf.org/test/Person> .
+<http://activerdf.org/test/age> <http://www.w3.org/2000/01/rdf-schema#range> <http://www.w3.org/1999/02/22-rdf-syntax-ns#Literal> .
+<http://activerdf.org/test/eye> <http://www.w3.org/2000/01/rdf-schema#domain> <http://activerdf.org/test/Person> .
+<http://activerdf.org/test/eye> <http://www.w3.org/2000/01/rdf-schema#range> <http://www.w3.org/1999/02/22-rdf-syntax-ns#Literal> .
+<http://activerdf.org/test/car> <http://www.w3.org/2000/01/rdf-schema#domain> <http://activerdf.org/test/Person> .
+<http://activerdf.org/test/car> <http://www.w3.org/2000/01/rdf-schema#range> <http://www.w3.org/1999/02/22-rdf-syntax-ns#Literal> .
+<http://activerdf.org/test/Person> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/eye> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/eyal> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/age> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://activerdf.org/test/car> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://www.w3.org/2000/01/rdf-schema#Class> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Class> .
+<http://www.w3.org/2000/01/rdf-schema#Class> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://www.w3.org/1999/02/22-rdf-syntax-ns#Property> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Class> .
+<http://www.w3.org/1999/02/22-rdf-syntax-ns#Property> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#domain> <http://www.w3.org/2000/01/rdf-schema#Resource> .
+<http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2000/01/rdf-schema#range> <http://www.w3.org/2000/01/rdf-schema#Class> .

data/test/test_rdflite.rb

@@ -0,0 +1,142 @@
+# Author:: Eyal Oren
+# Copyright:: (c) 2005-2006
+# License:: LGPL
+
+require 'rubygems'
+require 'test/unit'
+require 'active_rdf'
+require 'federation/federation_manager'
+require 'queryengine/query'
+
+class TestRdfLiteAdapter < Test::Unit::TestCase
+  def setup
+    ConnectionPool.clear
+  end
+
+  def teardown
+  end
+
+  def test_registration
+    adapter = ConnectionPool.add_data_source(:type => :rdflite)
+		assert_instance_of RDFLite, adapter
+	end
+
+	def test_initialise
+		adapter = ConnectionPool.add_data_source(:type => :rdflite, :keyword => false)
+		assert !adapter.keyword_search? 
+	end
+
+	def test_initialise_with_user_params
+		#TODO: FIXME
+	end
+
+	def test_duplicate_registration
+    adapter1 = ConnectionPool.add_data_source(:type => :rdflite)
+    adapter2 = ConnectionPool.add_data_source(:type => :rdflite)
+
+		assert_equal adapter1, adapter2
+		assert_equal adapter1.object_id, adapter2.object_id
+	end
+
+
+  def test_simple_query
+    adapter = ConnectionPool.add_data_source(:type => :rdflite)
+
+    eyal = RDFS::Resource.new 'eyaloren.org'
+    age = RDFS::Resource.new 'foaf:age'
+    test = RDFS::Resource.new 'test'
+
+    adapter.add(eyal, age, test)
+
+    result = Query.new.distinct(:s).where(:s, :p, :o).execute
+    assert_instance_of RDFS::Resource, result
+    assert_equal 'eyaloren.org', result.uri
+  end
+
+  def test_federated_query
+    adapter1 = ConnectionPool.add_data_source(:type => :rdflite)
+    adapter2 = ConnectionPool.add_data_source(:type => :rdflite, :fake_symbol_to_get_unique_adapter => true)
+
+    eyal = RDFS::Resource.new 'eyaloren.org'
+    age = RDFS::Resource.new 'foaf:age'
+    test = RDFS::Resource.new 'test'
+    test2 = RDFS::Resource.new 'test2'
+
+    adapter1.add(eyal, age, test)
+    adapter2.add(eyal, age, test2)
+
+    # assert only one distinct subject is found (same one in both adapters)
+    assert_equal 1, Query.new.distinct(:s).where(:s, :p, :o).execute(:flatten=>false).size
+
+    # assert two distinct objects are found
+    results = Query.new.distinct(:o).where(:s, :p, :o).execute
+    assert_equal 2, results.size
+
+    results.all? {|result| assert result.instance_of?(RDFS::Resource) }
+  end
+
+  def test_query_with_block
+    adapter = ConnectionPool.add_data_source(:type => :rdflite)
+
+    eyal = RDFS::Resource.new 'eyaloren.org'
+    age = RDFS::Resource.new 'foaf:age'
+    test = RDFS::Resource.new 'test'
+
+    adapter.add(eyal, age, test)
+    Query.new.select(:s,:p).where(:s,:p,:o).execute do |s,p|
+      assert_equal 'eyaloren.org', s.uri
+      assert_equal 'foaf:age', p.uri
+    end
+  end
+
+	def test_loading_data
+    adapter = ConnectionPool.add_data_source :type => :rdflite
+		adapter.load(File.dirname(File.expand_path(__FILE__)) + '/test_data.nt')
+		assert_equal 29, adapter.size
+		assert_equal 29, Query.new.count(:s).where(:s,:p,:o).execute.to_i
+	end
+
+	def test_person_data 
+    adapter = ConnectionPool.add_data_source :type => :rdflite
+		adapter.load(File.dirname(File.expand_path(__FILE__)) + '/test_data.nt')
+
+    Namespace.register(:test, 'http://activerdf.org/test/')
+    eyal = Namespace.lookup(:test, :eyal)
+    eye = Namespace.lookup(:test, :eye)
+    person = Namespace.lookup(:test, :Person)
+    type = Namespace.lookup(:rdf, :type)
+    resource = Namespace.lookup(:rdfs,:resource)
+
+    color = Query.new.select(:o).where(eyal, eye,:o).execute
+    assert 'blue', color
+    assert_instance_of String, color
+
+    ObjectManager.construct_classes
+    assert eyal.instance_of?(TEST::Person)
+    assert eyal.instance_of?(RDFS::Resource)
+	end
+
+	def test_delete_data
+    adapter = ConnectionPool.add_data_source :type => :rdflite
+		adapter.load(File.dirname(File.expand_path(__FILE__)) + '/test_data.nt')
+		assert_equal 29, adapter.size
+
+    eyal = RDFS::Resource.new('http://activerdf.org/test/eyal')
+		adapter.delete(eyal, nil, nil)
+		assert_equal 24, adapter.size
+
+		adapter.delete(nil,nil,nil)
+		assert_equal 0, adapter.size
+	end
+
+	def test_keyword_search
+    adapter = ConnectionPool.add_data_source :type => :rdflite
+		adapter.load(File.dirname(File.expand_path(__FILE__)) + '/test_data.nt')
+
+    eyal = RDFS::Resource.new('http://activerdf.org/test/eyal')
+		assert_equal eyal, Query.new.distinct(:s).where(:s,:keyword,"blue").execute
+		assert_equal eyal, Query.new.distinct(:s).where(:s,:keyword,"27").execute
+
+		assert_equal eyal, Query.new.distinct(:s).where(:s,:keyword,"eyal oren").execute
+	end
+end

metadata

@@ -0,0 +1,79 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.9.0
+specification_version: 1
+name: activerdf_rdflite
+version: !ruby/object:Gem::Version 
+  version: "1.0"
+date: 2006-11-02 00:00:00 +00:00
+summary: an RDF database for usage in ActiveRDF (based on sqlite3)
+require_paths: 
+- lib
+email: 
+homepage: 
+rubyforge_project: 
+description: an RDF database for usage in ActiveRDF (based on sqlite3)
+autorequire: 
+default_executable: 
+bindir: bin
+has_rdoc: true
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+  - - ">"
+    - !ruby/object:Gem::Version 
+      version: 0.0.0
+  version: 
+platform: ruby
+signing_key: 
+cert_chain: 
+post_install_message: 
+authors: 
+- Eyal Oren <eyal.oren@deri.org
+files: 
+- LICENSE
+- README
+- Rakefile
+- test/test_rdflite.rb
+- test/test_data.nt
+- lib/activerdf_rdflite
+- lib/activerdf_rdflite/init.rb
+- lib/activerdf_rdflite/rdflite.rb
+test_files: []
+
+rdoc_options: []
+
+extra_rdoc_files: 
+- README
+executables: []
+
+extensions: []
+
+requirements: []
+
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: gem_plugin
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Version::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 0.2.1
+    version: 
+- !ruby/object:Gem::Dependency 
+  name: activerdf
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Version::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 0.9.2
+    version: 
+- !ruby/object:Gem::Dependency 
+  name: sqlite3-ruby
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Version::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.1.0
+    version: