Sciweavers

613 search results - page 28 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
ICDE
2005
IEEE
260views Database» more  ICDE 2005»
16 years 3 months ago
A Comparative Evaluation of Transparent Scaling Techniques for Dynamic Content Servers
We study several transparent techniques for scaling dynamic content web sites, and we evaluate their relative impact when used in combination. Full transparency implies strong dat...
Cristiana Amza, Alan L. Cox, Willy Zwaenepoel
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
14 years 4 months ago
Querying contract databases based on temporal behavior
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
Elio Damaggio, Alin Deutsch, Dayou Zhou
DASFAA
2007
IEEE
172views Database» more  DASFAA 2007»
15 years 8 months ago
Optimizing Multiple In-Network Aggregate Queries in Wireless Sensor Networks
Abstract. In this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial ...
Huei-You Yang, Wen-Chih Peng, Chia-Hao Lo
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
15 years 7 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 7 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...