Sciweavers

2057 search results - page 327 / 412
» Scalable and Structured Scheduling
Sort
View
EDBT
2006
ACM
106views Database» more  EDBT 2006»
16 years 3 months ago
DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
ICSE
2004
IEEE-ACM
16 years 3 months ago
A Hybrid Architectural Style for Distributed Parallel Processing of Generic Data Streams
Immersive, interactive applications grouped under the concept of Immersipresence require on-line processing and mixing of multimedia data streams and structures. One critical issu...
Alexandre R. J. François
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
16 years 14 days ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
138
Voted
ASPLOS
2010
ACM
15 years 10 months ago
Dynamically replicated memory: building reliable systems from nanoscale resistive memories
DRAM is facing severe scalability challenges in sub-45nm technology nodes due to precise charge placement and sensing hurdles in deep-submicron geometries. Resistive memories, suc...
Engin Ipek, Jeremy Condit, Edmund B. Nightingale, ...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 10 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch