Sciweavers

951 search results - page 62 / 191
» Groupwise Processing of Relational Queries
Sort
View
DATESO
2008
131views Database» more  DATESO 2008»
14 years 11 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
DATAMINE
2000
115views more  DATAMINE 2000»
14 years 9 months ago
Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications
Data mining on large data warehouses is becoming increasingly important. In support of this trend, we consider a spectrum of architectural alternatives for coupling mining with da...
Sunita Sarawagi, Shiby Thomas, Rakesh Agrawal
ICDE
2005
IEEE
86views Database» more  ICDE 2005»
15 years 11 months ago
Personalized Queries under a Generalized Preference Model
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The un...
Georgia Koutrika, Yannis E. Ioannidis
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 1 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
PODS
2006
ACM
196views Database» more  PODS 2006»
15 years 10 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