Sciweavers

412 search results - page 9 / 83
» Ranked Join Indices
Sort
View
DATESO
2008
131views Database» more  DATESO 2008»
13 years 8 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
TKDE
1998
122views more  TKDE 1998»
13 years 6 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
SIGIR
2009
ACM
14 years 1 months ago
A ranking approach to keyphrase extraction
This paper addresses the issue of automatically extracting keyphrases from document. Previously, this problem was formalized as classification and learning methods for classific...
Xin Jiang, Yunhua Hu, Hang Li
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 8 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
PVLDB
2010
158views more  PVLDB 2010»
13 years 5 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb