Sciweavers

520 search results - page 63 / 104
» Contributing to eclipse: A case study
Sort
View
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
15 years 12 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 12 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
EDBT
2008
ACM
122views Database» more  EDBT 2008»
15 years 12 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
ICSE
2008
IEEE-ACM
15 years 12 months ago
Reference architecture knowledge representation: an experience
Software architectures have played a significant role in determining the success of software systems. In spite of impact of the architectures to the software development and, as a...
Elisa Yumi Nakagawa, José Carlos Maldonado
DCC
2001
IEEE
15 years 11 months ago
A Posteriori Quantized Matching Pursuit
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
Pascal Frossard, Pierre Vandergheynst