Sciweavers

591 search results - page 87 / 119
» The complexity of XPath query evaluation
Sort
View
VLDB
1995
ACM
214views Database» more  VLDB 1995»
14 years 5 days ago
Dynamic Multi-Resource Load Balancing in Parallel Database Systems
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. ...
Erhard Rahm, Robert Marek
PVLDB
2010
97views more  PVLDB 2010»
13 years 7 months ago
TRAMP: Understanding the Behavior of Schema Mappings through Provenance
Though partially automated, developing schema mappings remains a complex and potentially error-prone task. In this paper, we present TRAMP (TRAnsformation Mapping Provenance), an ...
Boris Glavic, Gustavo Alonso, Renée J. Mill...
WINE
2007
Springer
124views Economy» more  WINE 2007»
14 years 2 months ago
Stochastic Models for Budget Optimization in Search-Based Advertising
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
S. Muthukrishnan, Martin Pál, Zoya Svitkina
LICS
2000
IEEE
14 years 1 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
TLSDKCS
2010
13 years 3 months ago
Improving Retrievability and Recall by Automatic Corpus Partitioning
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
Shariq Bashir, Andreas Rauber