Sciweavers

84 search results - page 16 / 17
» Decidable Containment of Recursive Queries
Sort
View
PLANX
2007
13 years 7 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
DLOG
2009
13 years 3 months ago
Reasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 7 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
VLDB
1997
ACM
104views Database» more  VLDB 1997»
13 years 10 months ago
Multiple-View Self-Maintenance in Data Warehousing Environments
A data warehouse materializes views derived from data that may not reside at the warehouse. Maintaining these views e ciently in response to base updates is di cult, since it may ...
Nam Huyn
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
11 years 8 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han