Sciweavers

513 search results - page 43 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
80
Voted
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 1 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
14 years 7 months ago
Query Rewrites with Views for XML in DB2
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
Parke Godfrey, Jarek Gryz, Andrzej Hoppe, Wenbin M...
PODS
2002
ACM
136views Database» more  PODS 2002»
15 years 9 months ago
Models and Issues in Data Stream Systems
In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
PODS
2006
ACM
196views Database» more  PODS 2006»
15 years 9 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
CIKM
2006
Springer
15 years 1 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella