Sciweavers

2635 search results - page 5 / 527
» Algorithms for the Database Layout Problem
Sort
View
ISPD
1998
ACM
111views Hardware» more  ISPD 1998»
15 years 3 months ago
A pattern matching algorithm for verification and analysis of very large IC layouts
We propose a simple, isometry invariant pattern matching algorithm for an effective data reduction useful in layout-related data processing of very complex IC designs. The repeata...
Mariusz Niewczas, Wojciech Maly, Andrzej J. Strojw...
PPL
2000
91views more  PPL 2000»
14 years 11 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 3 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 29 days ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
IEEESCC
2005
IEEE
15 years 5 months ago
Satisfying Database Service Level Agreements while Minimizing Cost through Storage QoS
The emerging paradigms of service oriented architectures and utility-based computing have the potential to greatly reduce the cost of data management. Data management service prov...
Frederick Reiss, Tapas Kanungo