Sciweavers

2889 search results - page 74 / 578
» Querying Structured Hyperdocuments
Sort
View
PODS
2004
ACM
139views Database» more  PODS 2004»
14 years 8 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
13 years 9 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 12 days ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
VLDB
2006
ACM
203views Database» more  VLDB 2006»
14 years 8 months ago
The CQL continuous query language: semantic foundations and query execution
CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registeri...
Arvind Arasu, Shivnath Babu, Jennifer Widom
EDBTW
2004
Springer
14 years 1 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...