I tried to think of a simple example so I started thinking about an in-RAM or central indexing system but when I started reckoning that it would be about 250 MBytes I started wondering if I could call it a compression. A (relatively) fast indexing system would be a compression of the relations that were distributed to the data objects to but I ended up thinking about using unary numbers (like weighted reference flags) and so I would feel awkward saying that it was a compression. But the idea makes a lot of sense and I will use something like it. There could be some mundane compression on the reference flags and it would be possible that an indexing into these large flags could be used so that the entire flag system did not need to be decompressed to be used. The central (coarse) indexing could be used in a variety of ways so that the program could start to explore possible associations without first accessing the distributed data. So while it is not an exciting example of compression, it does stand as a relative model of what I am thinking of. Jim Bromer
------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
