Sciweavers

736 search results - page 115 / 148
» Answering Imprecise Queries over Web Databases
Sort
View
SSDBM
2007
IEEE
111views Database» more  SSDBM 2007»
14 years 1 months ago
Duplicate Elimination in Space-partitioning Tree Indexes
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 2 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
EDBT
2010
ACM
210views Database» more  EDBT 2010»
13 years 9 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
ICDE
2010
IEEE
206views Database» more  ICDE 2010»
14 years 16 days ago
Evaluating skylines in the presence of equijoins
— When a database system is extended with the skyline operator, it is important to determine the most efficient way to execute a skyline query across tables with join operations...
Wen Jin, Michael D. Morse, Jignesh M. Patel, Marti...
CIKM
2009
Springer
14 years 2 months ago
On the feasibility of multi-site web search engines
Web search engines are often implemented as centralized systems. Designing and implementing a Web search engine in a distributed environment is a challenging engineering task that...
Ricardo A. Baeza-Yates, Aristides Gionis, Flavio J...