Sciweavers

2889 search results - page 137 / 578
» Querying Structured Hyperdocuments
Sort
View
SDMW
2004
Springer
14 years 1 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...
ICDE
2006
IEEE
112views Database» more  ICDE 2006»
14 years 9 months ago
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
Ashraf Aboulnaga, Ihab F. Ilyas, M. Tamer Özs...
COMPGEOM
1997
ACM
14 years 10 days ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
AAAI
2008
13 years 10 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
JODL
2000
114views more  JODL 2000»
13 years 8 months ago
Integrating ontologies and thesauri for RDF schema creation and metadata querying
In this paper we present a new approach for building metadata schemas by integrating existing ontologies and structured vocabularies (thesauri). This integration is based on the s...
Bernd Amann, Irini Fundulaki, Michel Scholl