Sciweavers

2859 search results - page 4 / 572
» Querying Complex Structured Databases
Sort
View
ITNG
2006
IEEE
13 years 11 months ago
Utilizing XML Schema for Describing and Querying Still Image Databases
In this paper, still images are modeled by hierarchical tree structures and object relational graphs. These modeling concepts can be described naturally using XML schema. We intro...
Kazem Taghva, Min Xu, Emma Regentova, Tom Nartker
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
13 years 11 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
FOCS
1998
IEEE
13 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 7 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
SDMW
2004
Springer
13 years 11 months ago
A Structure Preserving Database Encryption Scheme
Abstract. A new simple and efficient database encryption scheme is presented. The new scheme enables encrypting the entire content of the database without changing its structure. I...
Yuval Elovici, Ronen Waisenberg, Erez Shmueli, Ehu...