Sciweavers

2859 search results - page 71 / 572
» Querying Complex Structured Databases
Sort
View
ICDT
1995
ACM
105views Database» more  ICDT 1995»
15 years 5 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
PODS
2003
ACM
135views Database» more  PODS 2003»
16 years 2 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 3 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
ISCIS
2005
Springer
15 years 7 months ago
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
Margarida Mamede
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
16 years 3 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng