6740 search results - page 207 / 1348 » Querying Databases with Taxonomies |
164
click to vote
EUSFLAT
2001
15 years 8 months ago
2001
Flexible querying aims at expressing preferences inside queries instead of strict requirements. We consider ordinary relational databases and flexible querying calling on fuzzy se...
237
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
144
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
We introduce a rich language of descriptions for semistructured tree-like data, and we explain how such descriptions relate to the data they describe. Various query languages and ...
164
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
While the desire to support fast, ad hoc query processing for large data warehouses has motivated the
131
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
A new approach to query optimization, truly adaptive optimization (TAO), is presented. TAO is a general optimization strategy and is composed of three elements: