Sciweavers

230 search results - page 13 / 46
» Data Structures for Restricted Triangular Range Searching
Sort
View
92
Voted
CSL
2010
Springer
14 years 10 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 4 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
64
Voted
SEMWEB
2009
Springer
15 years 4 months ago
Using Hybrid Search and Query for E-discovery Identification
: © Using hybrid search and query for e-discovery identification Dave Grosvenor, Andy Seaborne HP Laboratories HPL-2009-155 SPARQL, e-discovery, identification, hybrid search and ...
Dave Grosvenor, Andy Seaborne
DMDW
2000
173views Management» more  DMDW 2000»
14 years 11 months ago
A quality-based framework for physical data warehouse design
Data warehousing is a software infrastructure which supports OLAP applications by providing a collection of tools which allow data extraction and cleaning, data integration and ag...
Mokrane Bouzeghoub, Zoubida Kedad
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 9 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...