Sciweavers

552 search results - page 29 / 111
» On the Complexity of Join Predicates
Sort
View
HICSS
2005
IEEE
133views Biometrics» more  HICSS 2005»
14 years 3 months ago
Who Joins the Platform? The Case of the RFID Business Ecosystem
Today, many knowledge-based technology applications form a business ecosystem: a set of complex products and services made by multiple firms in which no firm is dominant. For this...
Anne Quaadgras
CSL
2003
Springer
14 years 3 months ago
The Arithmetical Complexity of Dimension and Randomness
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned...
John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwij...
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 9 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
14 years 11 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
VLDB
1998
ACM
121views Database» more  VLDB 1998»
14 years 2 months ago
Hash Joins and Hash Teams in Microsoft SQL Server
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...
Goetz Graefe, Ross Bunker, Shaun Cooper