415 search results - page 46 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
167
click to vote
DOLAP
2000
ACM
15 years 10 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
157
click to vote
ICDT
2010
ACM
16 years 3 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
181
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
140
click to vote
ADBIS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The need for location-based services has motivated an important research effort in the efficient processing of location-dependent queries. Most of the existing approaches...
259
click to vote
VLDB
2002
ACM
16 years 5 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...