3368 search results - page 127 / 674 » The Complexity of Query Reliability |
DEXA
2005
Springer
14 years 3 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
IDEAS
2002
IEEE
14 years 3 months ago
2002
IEEE
A system has been developed permitting database queries over data extracted from a CAD system where the query result is returned back to the CAD for visualization and analysis. Th...
SIGMOD
1990
ACM
14 years 2 months ago
1990
ACM
The role of database knowledge 1susually limited to the evaluation of data queries In this paper we argue that when this knowledge 1sof substantial volume and complexity, there 1s...
BNCOD
2003
13 years 11 months ago
2003
In this paper we describe a query paradigm based on ontologies, aggregate table-driven querying and expansion of QBE. It has two novel features: visually specifying aggregate table...
SEBD
1996
13 years 11 months ago
1996
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...