Sciweavers

311 search results - page 58 / 63
» Approximate XML joins
Sort
View
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 3 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 5 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ACNS
2011
Springer
254views Cryptology» more  ACNS 2011»
14 years 3 months ago
Linear Analysis of Reduced-Round CubeHash
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
Tomer Ashur, Orr Dunkelman
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 11 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SI3D
1999
ACM
15 years 4 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha