548 search results - page 11 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
112
click to vote
SOFTVIS
2010
ACM
14 years 12 months ago
2010
ACM
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
114
click to vote
KDD
2007
ACM
16 years 2 days ago
2007
ACM
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
106
Voted
PDPTA
2000
15 years 1 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
162
Voted
VLDB
2000
ACM
15 years 3 months ago
2000
ACM
Data allocation is a key performance factor for parallel database systems (PDBS). This holds especially for data warehousing environments where huge amounts of data and complex an...