Sciweavers

4081 search results - page 333 / 817
» Metaprogramming for Relational Databases
Sort
View
VLDB
2008
ACM
140views Database» more  VLDB 2008»
16 years 7 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
16 years 6 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
DASFAA
2006
IEEE
141views Database» more  DASFAA 2006»
16 years 24 days ago
Dataspaces: A New Abstraction for Information Management
straction for Information Management Michael Franklin University of California, Berkeley Alon Halevy Google Inc. and U. Washington David Maier Portland State University The develo...
Alon Y. Halevy, Michael J. Franklin, David Maier
CCGRID
2003
IEEE
16 years 1 days ago
Leveraging Non-Uniform Resources for Parallel Query Processing
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
Tobias Mayr, Philippe Bonnet, Johannes Gehrke, Pra...
183
Voted
IPPS
2002
IEEE
15 years 11 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
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...
Srinivasan Parthasarathy, Arun Ramakrishnan