Sciweavers

716 search results - page 72 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
VLDB
1998
ACM
116views Database» more  VLDB 1998»
15 years 6 months ago
The Heterogeneity Problem and Middleware Technology: Experiences with and Performance of Database Gateways
In this paper, we present the results that we have obtained by comparing and testing three well-known database middleware solutions. We have analyzed their features related to glo...
Fernando de Ferreira Rezende, Klaudia Hergula
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 7 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
15 years 8 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
CIKM
2007
Springer
15 years 8 months ago
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
With increasing amount of data being stored in XML format, OLAP queries over these data become important. OLAP queries have been well studied in the relational database systems. H...
Fianny Ming-fei Jiang, Jian Pei, Ada Wai-Chee Fu
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 1 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