Full nested searches work with the more inefficient general select, not using gfun all backs on rowid. So I am leaving the general select as it is. Command line script improved so a TE expression is in proper nested order in the table before executing. My word lists are getting longer, I have to use spreadsheets to construct them. So I am anxious to work schema, output filtering and pointer arithmetic so I can more easily general triple files. On schedule, or ahead for a version 2 of full search and schema operation over square sql tables.
Triggers have been moved outside G and into install. So, using more advanced output techniques has been moved to the sql arena and I experiment with my M4 macro, just calling the G_EXEC to create a trigger.
For the general case of managing output, the assumption is that there exists a triple sequence, including the default sequence, which will process output on a column element by column element basis. So if the search script mentioned a scheme, then G has a pointer to the top triple in the schema and can just run the thing for each row received, the scheme doing tits self directed selects. So, very simple, probably three lines of code:
If this column equals this name then output that column to result as a triple.
So, the forward grammar identifies a schema subsequence. The machine open a thread, leaves it in the ready, but pending state. On each row received, the machine looks up any pending schema, does a swap thread on that schema, loops, and done.
So, the basic column select schema for arbitrary square sql table in version 2 is about 15 lines of code. This simplicity made possible by the staff at Imagisoft, where we imagine imaginary things.
No comments:
Post a Comment