Robert,Thanks for the clarification. I think I got it and agree.BTW, after running your code using persistent objects and adding 5000 users, the total on-disk storage is now 5MB (as compared to 9MB by using non-persistent objects), which concurs with what Ian mentioned yesterday. Anyway, just wante
main
system BTree - but until 4.4 you couldn't reclaim that space
(unless it
happened to be reused opportunistically). In 4.4 you can compact the
DB, but elephant does not take advantage of this yet.
Ideally there would be an automated way to 'migrate' which is a
stop-and-copy model of GC
Nov 13, 2006, at 10:22 AM, Robert L. Read wrote: On Mon, 2006-11-13 at 09:47 -0500, Daniel Salama wrote: So, would you say that we based on our approach, we could just store a bunch of random objects (whether person, state, zip, order, etc) in the root and use class indices? Sounds
I'm running 0.6.0 downloaded from the web site.
On Nov 13, 2006, at 1:48 PM, Ian Eslick wrote:
Are running from HEAD or 0.6.0? I'll answer the size question
tonight (on travel today). -Ian
Sent via BlackBerry from T-Mobile
___
elephant-devel sit
ory footprint, I don't know. Therefore, if I loaded my database with 650,000 customer records, the data files will easily exceed 1GB of storage, and that's just one "table".Thanks,DanielOn Nov 12, 2006, at 6:45 PM, Robert L. Read wrote: Dear Daniel and Team, I think the
I'm not familiar with GBBopen and will read up on it. Would anyone
care to comment on it? For the purpose of trying to "develop" a
querying facility for Elephant, will it be useful/needed?
Thanks,
Daniel
On Nov 13, 2006, at 9:16 AM, Venkat Manakkal wrote:
Daniel Salam
On Nov 13, 2006, at 7:57 AM, Ian Eslick wrote:
I think a macro system makes sense when we find we want to have a
query
syntax (a simpler and more elegant version of what SQL tries to do)
that
concisely expresses the class of operations we want to perform and
behind which we need to put a quer
On Nov 13, 2006, at 7:37 AM, Ian Eslick wrote:
Class indexing accomplishes the same thing - it creates a BTree for
each
indexed class type that contains all instances of the class. Slot
indexes can be added/deleted and are secondary BTrees with the class
BTree as primary.
So, would you
gh to allow the user to provide custom predicate functions.
Thanks,
Daniel
On Nov 13, 2006, at 6:52 AM, Pierre THIERRY wrote:
Scribit Daniel Salama dies 12/11/2006 hora 10:28:
I guess we would have to sequentially navigate thru the results in
order to "manually" select each reco
Were you storing persistent-metaclass objects or simply normal
objects?
Normal objects are huge relative to persistent objects as currently
all
the slot names are also serialized (potentially in 32-bit unicode
if on
SBCL). I have some improvements planned to reduce the storage and
processin
Thanks. I'll be great to contribute anything to the project and a
pleasure working with you guys.
On Nov 12, 2006, at 1:11 PM, Ian Eslick wrote:
I'm interested in this problem myself, but haven't had the time to do
the appropriate research. Many SQL query engines are built on top
of a
BTre
, which I have tested on SBCL, illustrated a typical problem that Daniel Salama introduces. To paraphrase, you have a datatype (perhaps compound) which has a lot of slots; you have a GUI, perhaps web-based, that you use to both select or filter the large database, and to decide how to present sort
I'd love to hear/read about your take on the subject.It would be really great to be able to have some querying or even better a reporting tool that worked with Elephant. May be something a la Crystal Reports, but that may be shooting too high :). How about something like http://www.agata.org.br/?An
On Nov 12, 2006, at 3:48 PM, Robert L. Read wrote: This requires a philosophical response. In general, I think it will be way easier than you image, once you have been pointed in the right direction. Take my advice with a grain of salt.I certainly hope so. As I have been learning lisp, I have fu
Hi all,
Coming from a Rails/MySQL world, we are having some difficulty trying
to comprehend/model/implement querying the database using dynamically
generated criteria.
For example, in the life we are trying to leave, we present the user
with advanced search screen, where they can select a
I've been to the site lately and don't see much changes happening
there. So I'm wondering if anyone can comment:
1) How to download the latest and greatest? Is the .gz file always
the latest and greatest or should I get the CVS version? Is the CVS
version stable?
2) Where can I see a tuto
lly won't be the case, obsoleted framework.Thanks again for such great work.- DanielOn Aug 13, 2006, at 5:36 PM, Robert L. Read wrote: On Sun, 2006-08-13 at 02:27 -0400, Daniel Salama wrote: Being that BDB is on version 4.4.20 and there seem to be some
important fixes since the 4.3 version,
Being that BDB is on version 4.4.20 and there seem to be some
important fixes since the 4.3 version, does Elephant support this
version? Is there any plans to support it?
Thanks,
Daniel
___
elephant-devel site list
elephant-devel@common-lisp.net
htt
) (defmethod delete-obj :before ((dir indexing-director) (id key)) (pub-and-proc (list "removedocument" dir (k id))) ) "register-obj" and "delete-obj" are defined in DCM. On Fri, 2006-08-11 at 17:17 -0400, Daniel Salama wrote: Hi,
This may be more of a sugge
Hi,
This may be more of a suggestion since I think I already know the
answer.
I come from the Ruby On Rails world and, as some of you may know,
their Active Record module provides hooks that allow the automatic
and customized evaluation of validation rules at different stages of
the com
s I'm happy to answer
questions
about the rationale behind the code.
Ian
Daniel Salama wrote:
> Granded. Now, your original suggestion addressed the issue of using
> collections in slots and instead of collections of objects,
simply to
> use collections of references to objec
Granded. Now, your original suggestion addressed the issue of using collections in slots and instead of collections of objects, simply to use collections of references to objects, which make sense and in a way is somewhat along the lines of what indexes do (from a general PoV).Not having looked at
tyle
functionality more directly into the persistent object system so
common
linear queries are fast and only reports over non-resident
(infrequently
and not recently accessed) objects is expensive.
Good luck and let us know if you need more suggestions!
Ian
Robert L. Read wrote:
On Wed, 20
Hi all,
I'm relatively new to OODB and in particular Elephant. I learn best
by working with applications, so normally, I would try to migrate
something I have done in a different application into the new
environment I'm learning.
For this exercise, I'd like to migrate an application I dev
24 matches
Mail list logo
