Sciweavers

970 search results - page 90 / 194
» Query by tapping system based on alignment algorithm
Sort
View
143
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
132
Voted
CIKM
2011
Springer
14 years 2 months ago
Integrating and querying web databases and documents
There exist many interrelated information sources on the Internet that can be categorized into structured (database) and semistructured (documents). A key challenge is to integrat...
Carlos Garcia-Alvarado, Carlos Ordonez
SAC
2006
ACM
15 years 8 months ago
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...
Abraham Bernstein, Christoph Kiefer
244
Voted
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 2 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
SIGMOD
2010
ACM
188views Database» more  SIGMOD 2010»
15 years 7 months ago
A demonstration of FlexPref: extensible preference evaluation inside the DBMS engine
This demonstration presents FlexPref, a framework implemented inside the DBMS query processor that enables efficient and extensible preference query processing. FlexPref provides ...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...