Sciweavers

44 search results - page 8 / 9
» Algebraic Rewritings for Optimizing Regular Path Queries
Sort
View
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
14 years 7 months ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su
IS
2007
13 years 5 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 5 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
SIGMOD
2008
ACM
134views Database» more  SIGMOD 2008»
14 years 5 months ago
SystemT: a system for declarative information extraction
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghava...
DOCENG
2009
ACM
14 years 4 days ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...