Sciweavers

367 search results - page 53 / 74
» A Storage and Access Architecture for Efficient Query Proces...
Sort
View
SIGMOD
2006
ACM
156views Database» more  SIGMOD 2006»
14 years 7 months ago
MauveDB: supporting model-based user views in database systems
Real-world data -- especially when generated by distributed measurement infrastructures such as sensor networks -- tends to be incomplete, imprecise, and erroneous, making it impo...
Amol Deshpande, Samuel Madden
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 11 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
SSD
1999
Springer
99views Database» more  SSD 1999»
13 years 12 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
WDAS
2000
13 years 9 months ago
Scalable Distributed Data Structures for High-Performance Databases
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang