1007 search results - page 27 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
133
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
204
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
129
click to vote
PVLDB
2010
15 years 19 days ago
2010
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
232
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
96
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...