Sciweavers

17329 search results - page 3202 / 3466
» Improved non-approximability results
Sort
View
ICALP
2009
Springer
16 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
VLDB
2002
ACM
141views Database» more  VLDB 2002»
16 years 6 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
VLDB
2002
ACM
120views Database» more  VLDB 2002»
16 years 6 months ago
Efficient schemes for managing multiversionXML documents
Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and "...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
VLDB
2006
ACM
124views Database» more  VLDB 2006»
16 years 6 months ago
Dynamic buffer management with extensible replacement policies
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...
Chong Leng Goh, Yanfeng Shu, Zhiyong Huang, Beng C...
VLDB
2007
ACM
197views Database» more  VLDB 2007»
16 years 6 months ago
Indexable PLA for Efficient Similarity Search
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
Qiuxia Chen, Lei Chen 0002, Xiang Lian, Yunhao Liu...
« Prev « First page 3202 / 3466 Last » Next »