Sciweavers

1039 search results - page 163 / 208
» Query reformulation with constraints
Sort
View
VLDB
1999
ACM
174views Database» more  VLDB 1999»
15 years 2 months ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 1 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
15 years 1 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
ESOP
2009
Springer
15 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
DASFAA
2009
IEEE
108views Database» more  DASFAA 2009»
15 years 1 months ago
An Effective and Efficient Method for Handling Transmission Failures in Sensor Networks
Abstract. The suppression scheme is a solution for limited energy constraints in sensor networks. Temporal suppression, spatial suppression and spatio-temporal suppression are prop...
Heejung Yang, Chin-Wan Chung