Sciweavers

2889 search results - page 347 / 578
» Querying Structured Hyperdocuments
Sort
View
TKDE
2002
127views more  TKDE 2002»
15 years 6 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
CP
2010
Springer
15 years 5 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
IPL
2010
71views more  IPL 2010»
15 years 5 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
PVLDB
2010
86views more  PVLDB 2010»
15 years 5 months ago
Thirteen New Players in the Team: A Ferry-based LINQ to SQL Provider
We demonstrate an efficient LINQ to SQL provider and its significant impact on the runtime performance of LINQ programs that process large data volumes. This alternative provider...
Tom Schreiber, Simone Bonetti, Torsten Grust, Manu...
ICTAI
2010
IEEE
15 years 4 months ago
Ontology-guided Extraction of Complex Nested Relationships
Many applications call for methods to enable automatic extraction of structured information from unstructured natural language text. Due to inherent challenges of natural language ...
Sushain Pandit, Vasant Honavar