Sciweavers

146 search results - page 16 / 30
» Querying Incomplete Information in Semistructured Data
Sort
View
CIKM
2011
Springer
12 years 7 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei
ICDT
2001
ACM
162views Database» more  ICDT 2001»
13 years 12 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 7 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
CIKM
2005
Springer
14 years 1 months ago
Access control for XML: a dynamic query rewriting approach
We introduce the notion of views as a mechanism for securing and providing access control in the context of XML. Research in XML has explored several efficient querying mechanism...
Sriram Mohan, Arijit Sengupta, Yuqing Wu
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul