Sciweavers

2853 search results - page 488 / 571
» On the Efficiency of Provenance Queries
Sort
View
WWW
2005
ACM
16 years 16 days ago
User-centric Web crawling
Search engines are the primary gateways of information access on the Web today. Behind the scenes, search engines crawl the Web to populate a local indexed repository of Web pages...
Sandeep Pandey, Christopher Olston
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 22 hour ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
16 years 22 hour ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
16 years 21 hour ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...
73
Voted
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
15 years 11 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...