The VLDB Journal

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Rule-based spatiotemporal query processing for video databases
The VLDB Journal - Tập 13 - Trang 86-103 - 2004
Mehmet Emin Dönderler, Özgür Ulusoy, Ugur Güdükbay
In our earlier work, we proposed an architecture for a Web-based video database management system (VDBMS) providing an integrated support for spatiotemporal and semantic queries. In this paper, we focus on the task of spatiotemporal query processing and also propose an SQL-like video query language that has the capability to handle a broad range of spatiotemporal queries. The language is rule-base...... hiện toàn bộ
Fast fully dynamic labelling for distance queries
The VLDB Journal - Tập 31 - Trang 483-506 - 2021
Muhammad Farhan, Qing Wang, Yu Lin, Brendan McKay
Finding the shortest-path distance between an arbitrary pair of vertices is a fundamental problem in graph theory. A tremendous amount of research has explored this problem, most of which is limited to static graphs. Due to the dynamic nature of real-world networks, such as social networks or web graphs in which a link between two entities may fail or become alive at any time, there is a pressing ...... hiện toàn bộ
Label-constrained shortest path query processing on road networks
The VLDB Journal -
Junhua Zhang, Long Yuan, Wentao Li, Lu Qin, Ying Zhang, Wenjie Zhang
RailwayDB: adaptive storage of interaction graphs
The VLDB Journal - Tập 25 - Trang 151-169 - 2015
Robert Soulé, Buğra Gedik
We are living in an ever more connected world, where data recording the interactions between people, software systems, and the physical world is becoming increasingly prevalent. These data often take the form of a temporally evolving graph, where entities are the vertices and the interactions between them are the edges. We call such graphs interaction graphs. Various domains, including telecommuni...... hiện toàn bộ
Special Issue: Modern Hardware
The VLDB Journal - Tập 25 - Trang 623-624 - 2016
Peter Boncz, Wolfgang Lehner, Thomas Neumann
Diversifying recommendations on sequences of sets
The VLDB Journal - Tập 32 - Trang 283-304 - 2022
Sepideh Nikookar, Mohammadreza Esfandiari, Ria Mae Borromeo, Paras Sakharkar, Sihem Amer-Yahia, Senjuti Basu Roy
Diversifying recommendations on a sequence of sets (or sessions) of items captures a variety of applications. Notable examples include recommending online music playlists, where a session is a channel and multiple channels are listened to in sequence, or recommending tasks in crowdsourcing, where a session is a set of tasks and multiple task sessions are completed in sequence. Item diversity can b...... hiện toàn bộ
Non-binary evaluation measures for big data integration
The VLDB Journal - - 2017
Tomer Sagi, Avigdor Gal
The evolution of data accumulation, management, analytics, and visualization has led to the coining of the term big data, which challenges the task of data integration. This task, common to any matching problem in computer science involves generating alignments between structured data in an automated fashion. Historically, set-based measures, based upon binary similarity matrices (match/non-match)...... hiện toàn bộ
View matching for outer-join views
The VLDB Journal - Tập 16 - Trang 29-53 - 2006
Per-Åke Larson, Jingren Zhou
Prior work on computing queries from materialized views has focused on views defined by expressions consisting of selection, projection, and inner joins, with an optional aggregation on top (SPJG views). This paper provides a view matching algorithm for views that may also contain outer joins (SPOJG views). The algorithm relies on a normal form for outer-join expressions and is not based on bottom...... hiện toàn bộ
Ước lượng tính chọn lọc nhất quán thông qua entropy tối đa Dịch bởi AI
The VLDB Journal - Tập 16 - Trang 55-76 - 2006
V. Markl, P. J. Haas, M. Kutsch, N. Megiddo, U. Srivastava, T. M. Tran
Các bộ tối ưu truy vấn dựa trên chi phí cần ước lượng tính chọn lọc của các phép toán liên hợp khi so sánh các kế hoạch thực thi truy vấn thay thế. Để đạt được điều này, các bộ tối ưu nâng cao sử dụng thống kê đa biến để cải thiện thông tin về phân phối đồng thời của các giá trị thuộc tính trong một bảng. Phân phối đồng thời cho tất cả các cột gần như luôn quá lớn để lưu trữ hoàn toàn, và việc sử ...... hiện toàn bộ
Profiling relational data: a survey
The VLDB Journal - Tập 24 - Trang 557-581 - 2015
Ziawasch Abedjan, Lukasz Golab, Felix Naumann
Profiling data to determine metadata about a given dataset is an important and frequent activity of any IT professional and researcher and is necessary for various use-cases. It encompasses a vast array of methods to examine datasets and produce metadata. Among the simpler results are statistics, such as the number of null values and distinct values in a column, its data type, or the most frequent...... hiện toàn bộ
Tổng số: 788   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10