Sciweavers

311 search results - page 35 / 63
» Approximate XML joins
Sort
View
IQIS
2005
ACM
15 years 5 months ago
Effective and scalable solutions for mixed and split citation problems in digital libraries
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
Dongwon Lee, Byung-Won On, Jaewoo Kang, Sanghyun P...
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
15 years 12 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
IS
2010
14 years 10 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
WEBDB
2005
Springer
88views Database» more  WEBDB 2005»
15 years 5 months ago
Vague Content and Structure (VCAS) Retrieval for Document-centric XML Collections
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...
Shaorong Liu, Wesley W. Chu, Ruzan Shahinian
ALGOSENSORS
2009
Springer
15 years 6 months ago
Approximating Barrier Resilience in Wireless Sensor Networks
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
Sergey Bereg, David G. Kirkpatrick