Sciweavers

1890 search results - page 256 / 378
» Querying Big Data by Accessing Small Data
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 11 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
HIPEAC
2005
Springer
15 years 4 months ago
Exploiting a Computation Reuse Cache to Reduce Energy in Network Processors
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
Bengu Li, Ganesh Venkatesh, Brad Calder, Rajiv Gup...
SIGSOFT
2004
ACM
15 years 4 months ago
Using an SQL coverage measurement for testing database applications
Many software applications have a component based on database management systems in which information is generally handled through SQL queries embedded in the application code. Wh...
María José Suárez Cabal, Javi...
ACL
2009
14 years 9 months ago
SMS based Interface for FAQ Retrieval
Short Messaging Service (SMS) is popularly used to provide information access to people on the move. This has resulted in the growth of SMS based Question Answering (QA) services....
Govind Kothari, Sumit Negi, Tanveer A. Faruquie, V...
WCNC
2008
IEEE
15 years 5 months ago
Throughput and Delay Performance Analysis of Packet Aggregation Scheme for PRMA
—Packet reservation multiple access (PRMA) protocol is an implicit reservation MAC protocol. It is initially designed for voice packets in the cellular networks [2], [3] but it is...
Qi Zhang, Villy Bæk Iversen, Frank H. P. Fit...