TechNotes
Logic in DB
Beyond Java
Data Access
SOX
SQL/XML
Restructuring
Trees
Open Source
BizIntel
MySQL
Drivers
ODBC
JDBC
OLE DB
.NET
Podcast
SQL:2003
MS SQL 2005
XML DBs
XQuery
Webcast
XQuery
SQL:2003
MS SQL 2005
|
|
<<Prev 1 2 3
4 5 6 7 8
9 Next >>
Only Limited Processing Complexity is Possible
Hierarchical query processing other than simple single leg linear queries becomes too difficult for procedural navigation and processing to handle correctly and in
a timely manner. The more legs that are involved in the query, the more complicated the query becomes to process. An easily specified, but more internally
complicated example than the previous two leg example, is the selecting of data from two legs based on data values in two other legs. This is a very sophisticated
multi-leg query that compounds the required nonlinear hierarchical processing many times over with multiple LCAs and data selected from different legs each with
different data qualifications at different hierarchical locations. The nonprocedural hierarchical processor is automatically performing this full hierarchical
structure processing by utilizing established hierarchical processing principles and semantic procedures to process these internally complex multi-leg queries
automatically and accurately. This means there are no limits to the internal complexity of multi-leg queries that can be carried out automatically and correctly.
No Global View Support
|
 Fast, reliable data access for ODBC, JDBC, ADO.NET and XML |
A global view can automatically process any possible query in its hierarchical structure domain with optimum efficiency. Today using procedural navigation, each unique
path accessed of all possible queries in a hierarchical structure would have to be specified with procedural navigation which would defeat the purpose of global views
and is not practical. The procedural navigation of all possible different structure paths and combinations of paths can not be realistically specified ahead of time. A
global view operating non-procedurally is driven by what data is required, specified on the query invocation so only the required access paths are dynamically navigated.
This allows for maximum possible reuse of global views. This is also useful for single-leg queries, since each possible single-leg query can also be automatically
navigated dynamically avoiding the necessity for predefined procedural navigation steps.
|
No Support for Global Queries
Global views make global queries possible. A global query is a query that accesses the entire hierarchical structure and outputs the
entire processed hierarchical structure having performed some global operation on the data such as data filtering. This is not reasonably possible using procedural
navigation, but can be specified easily with nonprocedural navigationless processing. An example is SELECT ALL FROM GlobalView WHERE Year=2007. Or just as easily,
SELECT ALL FROM GlobalView WHERE Dept=”Sales” is an entirely different point of view. This is extremely useful to quickly filter the entire hierarchical structure
which can be processed easily because the original full hierarchical structure can be preserved so it can be used without recoding by existing applications.
<< Prev 1 2
3 4 5 6 7
8 9
Next >>
Database Server Watch
SQL Summit Home
Page Articles
© 2008, Ken North Computing LLC, All rights
reserved.
|
|
|
