Sciweavers

2859 search results - page 147 / 572
» Querying Complex Structured Databases
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang
CIKM
2006
Springer
13 years 10 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
ICDT
2003
ACM
139views Database» more  ICDT 2003»
14 years 1 months ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo
VLDB
1991
ACM
134views Database» more  VLDB 1991»
13 years 11 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
DEXAW
2008
IEEE
145views Database» more  DEXAW 2008»
13 years 10 months ago
ECQ: A Simple Query Language for the Semantic Web
With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems. In ...
María del Mar Roldán García, ...