Sciweavers

2987 search results - page 296 / 598
» Multiobjective Query Optimization
Sort
View
113
Voted
ICDT
2005
ACM
130views Database» more  ICDT 2005»
15 years 8 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash
114
Voted
VLDB
2004
ACM
96views Database» more  VLDB 2004»
15 years 8 months ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
126
Voted
DKE
2006
123views more  DKE 2006»
15 years 2 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
IS
2007
15 years 2 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
213
Voted
ICDE
2001
IEEE
141views Database» more  ICDE 2001»
16 years 4 months ago
Processing Queries with Expensive Functions and Large Objects in Distributed Mediator Systems
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
Fabio Porto, Françoise Fabret, Luc Bouganim...