Sciweavers

2859 search results - page 152 / 572
» Querying Complex Structured Databases
Sort
View
ICDT
2009
ACM
173views Database» more  ICDT 2009»
14 years 9 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
WWW
2006
ACM
14 years 9 months ago
Evaluating structural summaries as access methods for XML
Structural summaries are data structures that preserve all structural features of XML documents in a compact form. We investigate the applicability of the most popular summaries a...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
DEBU
2010
128views more  DEBU 2010»
13 years 5 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
ICDE
2005
IEEE
124views Database» more  ICDE 2005»
14 years 9 months ago
XML Views as Integrity Constraints and their Use in Query Translation
The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do ...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
VLDB
1997
ACM
140views Database» more  VLDB 1997»
14 years 12 days ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis