813 search results - page 31 / 163 » Languages for Relational Databases over Interpreted Structur... |
ADC
2000
Springer
14 years 23 days ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
AAAI
2008
13 years 10 months ago
2008
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
DEXA
1995
Springer
13 years 12 months ago
1995
Springer
- In order to accomplish independence on the logical data organization, a relational DBMS must be capable of interpreting query language sentences which reference attributes belong...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
IDEAS
2008
IEEE
14 years 2 months ago
2008
IEEE
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...