552 search results - page 31 / 111 » On the Complexity of Join Predicates |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
ICDE
2009
IEEE
14 years 5 months ago
2009
IEEE
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
TKDE
2002
13 years 9 months ago
2002
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...