Sciweavers

10088 search results - page 186 / 2018
» Queries and Computation on the Web
Sort
View
DAWAK
2003
Springer
15 years 7 months ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 5 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
PERCOM
2008
ACM
16 years 1 months ago
A Context Query Language for Pervasive Computing Environments
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...
Roland Reichle, Michael Wagner, Mohammad Ullah Kha...
142
Voted
DPD
2006
114views more  DPD 2006»
15 years 1 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 4 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu