Sciweavers

6004 search results - page 319 / 1201
» Parallelizing query optimization
Sort
View
103
Voted
WWW
2004
ACM
16 years 1 months ago
Index structures and algorithms for querying distributed RDF repositories
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Sui...
Heiner Stuckenschmidt, Richard Vdovjak, Geert-Jan ...
VLDB
2001
ACM
157views Database» more  VLDB 2001»
16 years 29 days ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
120
Voted
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 27 days 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
ICDT
2005
ACM
130views Database» more  ICDT 2005»
15 years 6 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
100
Voted
VLDB
2004
ACM
96views Database» more  VLDB 2004»
15 years 6 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