Sciweavers

765 search results - page 130 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CIKM
2010
Springer
14 years 8 months ago
Brown dwarf: a P2P data-warehousing system
In this demonstration we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data. Deployed on any number of commodity ...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
FTDB
2008
82views more  FTDB 2008»
14 years 10 months ago
Information Extraction
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
Sunita Sarawagi
PVLDB
2010
120views more  PVLDB 2010»
14 years 8 months ago
EXTRUCT: Using Deep Structural Information in XML Keyword Search
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
Arash Termehchy, Marianne Winslett
ICIP
2009
IEEE
15 years 11 months ago
Boosting Object Retrieval By Estimating Pseudo-objects
State-of-the-art object retrieval systems are mostly based on the bag-of-visual-words representation which encodes local appearance information of an image in a feature vector. A ...