Sciweavers

210 search results - page 26 / 42
» On the Structure of Bounded Queries to Arbitrary NP Sets
Sort
View
COMAD
2009
13 years 9 months ago
Querying for relations from the semi-structured Web
We present a class of web queries whose result is a multi-column relation instead of a collection of unstructured documents as in standard web search. The user specifies the query...
Sunita Sarawagi
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 9 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
VLDB
1997
ACM
104views Database» more  VLDB 1997»
14 years 23 days ago
A Generic Approach to Bulk Loading Multidimensional Index Structures
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
Jochen Van den Bercken, Bernhard Seeger, Peter Wid...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 8 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
BTW
2007
Springer
292views Database» more  BTW 2007»
14 years 19 days ago
Effective and Efficient Indexing for Large Video Databases
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...
Christian Böhm, Peter Kunath, Alexey Pryakhin...