109 search results - page 6 / 22 » Example-driven design of efficient record matching queries |
161
Voted
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
111
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Because of the increasing number of electronic data, designing efficient tools to retrieve and exploit documents is a major challenge. Current search engines suffer from two main d...
DEXAW
2006
IEEE
15 years 4 months ago
2006
IEEE
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
JIIS
2000
14 years 9 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
180
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...