Sciweavers

2095 search results - page 75 / 419
» Modeling and Querying Semi-structured Data
Sort
View
ESWS
2009
Springer
15 years 4 months ago
Benchmarking Fulltext Search Performance of RDF Stores
More and more applications use the RDF framework as their data model and RDF stores to index and retrieve their data. Many of these applications require both structured queries as ...
Enrico Minack, Wolf Siberski, Wolfgang Nejdl
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
PVLDB
2008
146views more  PVLDB 2008»
14 years 9 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
SIGIR
2009
ACM
15 years 4 months ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
DOLAP
2008
ACM
14 years 11 months ago
Bridging the semantic gap in OLAP models: platform-independent queries
The development of data warehouses is based on a threestage process that starts specifying both the static and dynamic properties of on-line analytical processing (OLAP) applicati...
Jesús Pardillo, Jose-Norberto Mazón,...