[Sigia-l] Help with Large Result Set as a Tree View

[O'Brien, Corey (US - Austin)]

You are correct in saying that I will have a large quantity of rows with
groups of them being sortable and pageable.  This is not straightforward
in HTML.  That is why I was requesting help.  I have tried some methods
at this point.  I can build the tree just fine, with mostly DHTML, but
the paging and sorting is a little more tricky.  The sorting is not too
bad, and I could figure that part out, but the paging is near impossible
with DHTML alone.

The application that I am building is using Java already, but we would
not like to use applets.  There are a few things that we are looking
into that struts and/or other people have coded.

Thanks for your help.

Corey O'Brien
Deloitte Consulting



-----Original Message-----
From: Listera [mailto:listera at rcn.com] 
Sent: Monday, July 14, 2003 10:14 PM
To: sigia-l at asis.org
Subject: Re: [Sigia-l] Help with Large Result Set as a Tree View


I'm sorry I still don't have a clear picture mostly because of the
terminology you are using. For the most part, a "tree" is a hierarchical
list and has no straightforward HTML equivalent. The closest widget I
can think of is a table with n rows and 6/7 columns. And you want to be
able to treat an arbitrary range of rows as grouped and independently
sortable. If this is the correct picture, read on, if not please ignore
the rest.

I designed a similar system for a bank tied to a multi-terrabyte,
multi-location datastore. After considering various options including
frames, iframes, DHTML, on-the-fly DOM-tree node construction, etc. I
decided that the hassle of coding such a complex, brittle system with
little chance of working hassle-free across browser, I decided to spec
it in Java. (Flash MX, not available then, would also be an option
today). The alternatives are just not worth the trouble, especially
given all the other stuff you get with Java.

Sorry if this is not the answer you were hoping for.

Ziya
Nullius in Verba 


"O'Brien, Corey (US - Austin)" wrote:

> This is a result-set of 6 or 7 columns of data.  For each level of the

> tree, there are 6 or 7 columns of data.  The users want to be able to 
> sort within the level that they are seeing.  When they expand to the 
> third level, they want to be able to sort on the transaction dates of 
> the third level, and because of the limit of vertical space and 
> database bandwidth, we will also have to page within each of the 
> sub-levels as well.
> 
> Each of these are columns.  This is the structure:
> 
> L1- X X X      (record 1 of 50)
> L2-   Y Y Y    (record 1.1 of 50.50)
> L2-   Y Y Y    (record 1.2 of 50.50
> L3-     Z Z Z  (record 1.2.1 of 50.50.50)
> L3-     Z Z Z  (record 1.2.2 of 50.50.50)
> L2-   Y Y Y    (record 1.3 of 50.50)
> L1- X X X      (record 2 of 50)
> 
> Make more sense or did I confuse more?


------------
When replying, please *trim your post* as much as possible. *Plain text,
please; NO Attachments

Searchable list archive:   http://www.info-arch.org/lists/sigia-l/
________________________________________
Sigia-l mailing list -- post to: Sigia-l at asis.org
Changes to subscription: http://mail.asis.org/mailman/listinfo/sigia-l
This message (including any attachments) contains confidential
information intended for a specific individual and purpose, and is
protected by law.  If you are not the intended recipient, you should
delete this message.  Any disclosure, copying, or distribution of this
me
ssage, or the taking of any action based on it, is strictly
prohibited.


-----------------------------------------------------------------------


This message (including any attachments) contains confidential information intended for a specific individual and purpose, and is protected by law.  If you are not the intended recipient, you should delete this message.  Any disclosure, copying, or distribution of this message, or the taking of any action based on it, is strictly prohibited.