Sciweavers

3775 search results - page 667 / 755
» The Expression Problem Revisited
Sort
View
135
Voted
CADE
2007
Springer
16 years 4 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
222
Voted
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 3 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita
226
Voted
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 3 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
223
Voted
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 3 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
136
Voted
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
16 years 3 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang