Sciweavers

5244 search results - page 747 / 1049
» Structural Complexity of AvgBPP
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
272
Voted
VLDB
2007
ACM
105views Database» more  VLDB 2007»
16 years 7 months ago
Using a distributed quadtree index in peer-to-peer networks
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
Egemen Tanin, Aaron Harwood, Hanan Samet
289
Voted
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 6 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen
SIGMOD
2005
ACM
138views Database» more  SIGMOD 2005»
16 years 6 months ago
Automatic Physical Database Tuning: A Relaxation-based Approach
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
Nicolas Bruno, Surajit Chaudhuri
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 6 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...