995 search results - page 81 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
156
click to vote
E2EMON
2006
IEEE
15 years 6 months ago
2006
IEEE
Analyzing Internet traffic at packet level involves generally large amounts of raw data, derived data, and results from various analysis tasks. In addition, the analysis often proc...
130
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
123
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
123
click to vote
DEXA
2005
Springer
15 years 8 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...
142
click to vote
ICDT
2012
ACM
13 years 5 months ago
2012
ACM
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...