Sciweavers

951 search results - page 31 / 191
» Groupwise Processing of Relational Queries
Sort
View
IS
2006
14 years 9 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
15 years 11 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
COMAD
2008
14 years 11 months ago
Native Multidimensional Indexing in Relational Databases
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
David Hoksza, Tomás Skopal
EDBT
2006
ACM
150views Database» more  EDBT 2006»
15 years 10 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
PODS
2009
ACM
134views Database» more  PODS 2009»
15 years 10 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan