Sciweavers

6274 search results - page 258 / 1255
» From query complexity to computational complexity
Sort
View
FGCS
2000
81views more  FGCS 2000»
15 years 4 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
WWW
2010
ACM
15 years 12 months ago
Not so creepy crawler: easy crawler generation with standard xml queries
Web crawlers are increasingly used for focused tasks such as the extraction of data from Wikipedia or the analysis of social networks like last.fm. In these cases, pages are far m...
Franziska von dem Bussche, Klara A. Weiand, Benedi...
136
Voted
VLDB
1997
ACM
124views Database» more  VLDB 1997»
15 years 9 months ago
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
Surajit Chaudhuri, Vivek R. Narasayya
CAISE
2005
Springer
15 years 10 months ago
Heuristic Horizontal XML Fragmentation
A challenging question is how XML can be used to support distributed databases. This leads to the problem of how to obtain a suitable, cost-efficient distribution design for XML do...
Hui Ma, Klaus-Dieter Schewe
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 10 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven