Sciweavers

329 search results - page 21 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
HPDC
2010
IEEE
13 years 9 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
ICDCS
2007
IEEE
14 years 9 days ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
CIKM
2011
Springer
12 years 8 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
PVLDB
2008
126views more  PVLDB 2008»
13 years 8 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 8 months ago
Use of Wikipedia Categories in Entity Ranking
Wikipedia is a useful source of knowledge that has many applications in language processing and knowledge representation. The Wikipedia category graph can be compared with the clas...
James A. Thom, Jovan Pehcevski, Anne-Marie Vercous...