1007 search results - page 37 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
146
click to vote
PVLDB
2010
15 years 2 months ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
123
click to vote
SIGMOD
1996
ACM
15 years 8 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
157
click to vote
DEBS
2009
ACM
15 years 10 months ago
2009
ACM
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
167
click to vote
DEBS
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...
189
click to vote
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...