Sciweavers

3225 search results - page 237 / 645
» Query Optimization by Stored Queries
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 5 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
GCC
2007
Springer
15 years 11 months ago
Adapting to Application Workflow in Processing Data Integration Queries
Data integration has evolved to provide efficient data management across distributed and heterogeneous data sources in grid environment. However, existing works in data integratio...
Yongwei Wu, Jia Liu, Gang Chen, Guangwen Yang, Bo ...
ICDT
2005
ACM
130views Database» more  ICDT 2005»
15 years 10 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
VLDB
2004
ACM
96views Database» more  VLDB 2004»
15 years 10 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
DKE
2006
123views more  DKE 2006»
15 years 5 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...